Efficient graph-based image segmentation
Efficient graph-based image segmentation
复制标题
DOI：
10.1023/b:visi.0000022288.19776.77
复制
发表时间：
2004-09-01
影响因子：
19.5
通讯作者：
Huttenlocher, DP
中科院分区：
文献类型：
--
作者：
Felzenszwalb, PF;Huttenlocher, DP
本文探讨了将图像分割为区域的问题。我们使用基于图的图像表示法定义了一个谓词，用于衡量两个区域之间边界的证据。然后，我们基于这个谓词开发了一种高效的分割算法，并表明尽管该算法做出的是贪心决策，但它所产生的分割结果满足全局属性。我们在构建图时使用两种不同的局部邻域将该算法应用于图像分割，并通过真实图像和合成图像展示了结果。该算法的运行时间与图的边数几乎呈线性关系，在实际应用中也很快。该方法的一个重要特点是它能够在低变异性图像区域保留细节，同时忽略高变异性区域的细节。
This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in low-variability image regions while ignoring detail in high-variability regions.