Image segmentation using local variation
Pedro F. Felzenszwalb, Daniel P. Huttenlocher · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · 2002
We present a new graph-theoretic approach to the problem of image segmentation. Our method uses local criteria and yet produces results that reflect global properties of the image. We develop a framework that provides specific definitions of what it means for an image to be under- or over-segmented. We then present an efficient algorithm for computing a segmentation that is neither under- nor over-segmented according to these definitions. Our segmentation criterion is based on intensity differences between neighboring pixels. An important characteristic of the approach is that it is able to preserve detail in low-variability regions while ignoring detail in high-variability regions, which we illustrate with several examples on both real and synthetic images.
Cited by 235 works. doi:10.1109/cvpr.1998.698594
Authors
References
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Introduction to Algorithms
- Algorithms for Clustering Data
- Algorithms for clustering data
- Normalized cuts and image segmentation
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- An optimal graph theoretic approach to data clustering: theory and its application to image segmentation
- Laws of organization in perceptual forms.
- Robust analysis of feature spaces: color image segmentation
- Graph theoretical clustering based on limited neighbourhood sets