基于图的图像分割方法的Python实现可以按照以下步骤进行： 1. **将图片的每个像素投影到特征空间**：将图片的每个像素按照坐标和颜色投影到 (x, y, r, g, b) 特征空间上，初始时每个像素自身属于单独一个区域。 2. **计算所有边的权重大小**：计算八领域内像素的特征向量的欧式距离，并按照距离大小排序。 3. **合并像素到同一区域**：按距离从小到大的顺序，依次将这些边两端的像素合并到同一个区域。能否合并依据特定的合并公式判断。 4. **重复合并步骤**：重复第3步，直到剩余区域数到达设置的下界。 5. **合并小区域**：遍历剩下的区域，将像素数少于50个的区域和相邻的区域直接合并。 以下是一个简单的示例代码： ```python import numpy as np from PIL import Image def feature_vector(image, x, y): """ 计算像素的特征向量 (x, y, r, g, b) """ r, g, b = image.getpixel((x, y)) return np.array([x, y, r, g, b]) def euclidean_distance(v1, v2): """ 计算两个特征向量的欧式距离 """ return np.linalg.norm(v1 - v2) def merge_regions(regions, pixel1, pixel2): """ 合并两个像素所在的区域 """ region1 = regions[pixel1] region2 = regions[pixel2] for pixel, region in regions.items(): if region == region2: regions[pixel] = region1 return regions def graph_based_segmentation(image, min_region_size=50, target_region_count=None): width, height = image.size # 初始化每个像素的区域 regions = {} for x in range(width): for y in range(height): regions[(x, y)] = (x, y) # 计算所有边的权重 edges = [] for x in range(width): for y in range(height): current_pixel = (x, y) current_vector = feature_vector(image, x, y) # 八领域内的像素 neighbors = [(x + dx, y + dy) for dx in [-1, 0, 1] for dy in [-1, 0, 1] if (dx != 0 or dy != 0) and 0 <= x + dx < width and 0 <= y + dy < height] for neighbor in neighbors: neighbor_vector = feature_vector(image, *neighbor) distance = euclidean_distance(current_vector, neighbor_vector) edges.append((distance, current_pixel, neighbor)) # 按距离从小到大排序 edges.sort() # 合并边两端的像素 for distance, pixel1, pixel2 in edges: if regions[pixel1] != regions[pixel2]: regions = merge_regions(regions, pixel1, pixel2) # 检查剩余区域数是否到达下界 if target_region_count is not None and len(set(regions.values())) <= target_region_count: break # 合并像素数少于50个的区域 region_counts = {} for region in regions.values(): if region not in region_counts: region_counts[region] = 0 region_counts[region] += 1 for pixel, region in regions.items(): if region_counts[region] < min_region_size: x, y = pixel neighbors = [(x + dx, y + dy) for dx in [-1, 0, 1] for dy in [-1, 0, 1] if (dx != 0 or dy != 0) and 0 <= x + dx < width and 0 <= y + dy < height] for neighbor in neighbors: if regions[neighbor] != region: regions = merge_regions(regions, pixel, neighbor) break return regions # 示例用法 image = Image.open("apple.jpg") regions = graph_based_segmentation(image, min_region_size=50, target_region_count=10) # 可视化分割结果 segmented_image = Image.new("RGB", image.size) region_colors = {} for pixel, region in regions.items(): if region not in region_colors: region_colors[region] = (np.random.randint(0, 256), np.random.randint(0, 256), np.random.randint(0, 256)) segmented_image.putpixel(pixel, region_colors[region]) segmented_image.save("segmented_apple.jpg") ```