Fast multiscale image segmentation

We introduce a fast, multiscale algorithm for image segmentation. Our algorithm uses modern numeric techniques to find an approximate solution to normalized cut measures in time that is linear in the size of the image with only a few dozen operations per pixel. In just one pass the algorithm provides a complete hierarchical decomposition of the image into segments. The algorithm detects the segments by applying a process of recursive coarsening in which the same minimization problem is represented with fewer and fewer variables producing an irregular pyramid. During this coarsening process we may compute additional internal statistics of the emerging segments and use these statistics to facilitate the segmentation process. Once the pyramid is completed it is scanned from the top down to associate pixels close to the boundaries of segments with the appropriate segment. The algorithm is inspired by algebraic multigrid (AMG) solvers of minimization problems of heat or electric networks. We demonstrate the algorithm by applying it to real images.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[3]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[4]  Peter E. Hart,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[5]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  James C. Bezdek,et al.  Efficient Implementation of the Fuzzy c-Means Clustering Algorithms , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Theodosios Pavlidis,et al.  Integrating region growing and edge detection , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[8]  Michael Spann,et al.  Image segmentation using a dynamic thresholding pyramid , 1989, Pattern Recognit..

[9]  S Baronti,et al.  Variable Pyramid Structures for Image Segmentation , 1990, Comput. Vis. Graph. Image Process..

[10]  Linda G. Shapiro,et al.  Computer and Robot Vision , 1991 .

[11]  Richard M. Leahy,et al.  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  A. Brandt.  Rigorous quantitative analysis of multigrid, I: constant coefficients two-level cycle with L 2 -norm , 1994 .

[13]  Bart M. ter Haar Romeny,et al.  Geometry-Driven Diffusion in Computer Vision , 1994, Computational Imaging and Vision.

[14]  Azriel Rosenfeld,et al.  A Pyramid Framework for Early Vision , 1994 .

[15]  Emanuele Trucco,et al.  Computer and Robot Vision , 1995 .

[16]  Ingemar J. Cox,et al.  "Ratio regions": a technique for image segmentation , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[17]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[18]  Peter Meer,et al.  Image Segmentation from Consensus Information , 1997, Comput. Vis. Image Underst..

[19]  Pietro Perona,et al.  A Factorization Approach to Grouping , 1998, ECCV.

[20]  Sudeep Sarkar,et al.  Learning to form large groups of salient image features , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[21]  Yair Weiss,et al.  Segmentation using eigenvectors: a unifying view , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.