Segmentation of Multiple Salient Closed Contours from Real Images

Using a saliency measure based on the global property of contour closure, we have developed a segmentation method which identifies smooth closed contours bounding objects of unknown shape in real images. The saliency measure incorporates the Gestalt principles of proximity and good continuity that previous methods have also exploited. Unlike previous methods, we incorporate contour closure by finding the eigenvector with the largest positive real eigenvalue of a transition matrix for a Markov process where edges from the image serve as states. Element (i, j) of the transition matrix is the conditional probability that a contour which contains edge j will also contain edge i. We show how the saliency measure, defined for individual edges, can be used to derive a saliency relation, defined for pairs of edges, and further show that strongly-connected components of the graph representing the saliency relation correspond to smooth closed contours in the image. Finally, we report for the first time, results on large real images for which segmentation takes an average of about 10 seconds per object on a general-purpose workstation.

[1]  D. Anderson,et al.  Algorithms for minimization without derivatives , 1974 .

[2]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[3]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Shimon Ullman,et al.  Structural Saliency: The Detection Of Globally Salient Structures using A Locally Connected Network , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[5]  Edward M. Riseman,et al.  Token-based extraction of straight lines , 1989, IEEE Trans. Syst. Man Cybern..

[6]  Gérard G. Medioni,et al.  Inferring global perceptual contours from local features , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[7]  David W. Jacobs Robust and efficient detection of convex groups , 1993, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[8]  Radu Horaud,et al.  Figure-Ground Discrimination: A Combinatorial Optimization Approach , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Kim L. Boyer,et al.  Hypothesizing structures in edge-focused cerebral magnetic resonance images using graph-theoretic cycle enumeration , 1993 .

[10]  D. Mumford Elastica and Computer Vision , 1994 .

[11]  Steven W. Zucker,et al.  Computing Contour Closure , 1996, ECCV.

[12]  Lance R. Williams,et al.  Analytic solution of stochastic completion fields , 1995, Biological Cybernetics.

[13]  Kim L. Boyer,et al.  Quantitative measures of change based on feature organization: eigenvalues and eigenvectors , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  Lance R. Williams,et al.  Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience , 1997, Neural Computation.

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

[16]  Jitendra Malik,et al.  Image and video segmentation: the normalized cut framework , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

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

[18]  Michael Werman,et al.  A Randomized Algorithm for Pairwise Clustering , 1998, NIPS.

[19]  Kim L. Boyer,et al.  Quantitative Measures of Change Based on Feature Organization: Eigenvalues and Eigenvectors , 1998, Comput. Vis. Image Underst..

[20]  Michael Lindenbaum,et al.  A Generic Grouping Algorithm and Its Quantitative Analysis , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Lance R. Williams,et al.  Segmentation of salient closed contours from real images , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[22]  Mi-Suen Lee,et al.  A Computational Framework for Segmentation and Grouping , 2000 .

[23]  Sudeep Sarkar,et al.  Supervised Learning of Large Perceptual Organization: Graph Spectral Partitioning and Learning Automata , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  Ronen Basri,et al.  Completion Energies and Scale , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  Lance R. Williams,et al.  Orientation, Scale, and Discontinuity as Emergent Properties of Illusory Contour Shape , 1998, Neural Computation.

[26]  Lance R. Williams,et al.  A Comparison of Measures for Detecting Natural Shapes in Cluttered Backgrounds , 1998, International Journal of Computer Vision.