Journal
INTERNATIONAL JOURNAL OF COMPUTER VISION
Volume 59, Issue 2, Pages 167-181Publisher
SPRINGER
DOI: 10.1023/B:VISI.0000022288.19776.77
Keywords
image segmentation; clustering; perceptual organization; graph algorithm
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available