This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Segmentation of Multiple Salient Closed Contours from Real Images
April 2003 (vol. 25 no. 4)
pp. 433-444

Abstract—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 . In this paper, 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] A. Amir and M. Lindenbaum, “A Generic Grouping Algorithm and Its Quantitative Analysis,” IEEE Tran. Pattern Analysis and Machine Intelligence, vol. 20, no. 2, pp. 168-185, Feb. 1998.
[2] M. Boldt, R. Weiss, and E. Riseman, “Token-Based Extraction of Straight Lines,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 6, pp. 1581-1595, June 1989.
[3] R.P. Brent, Algorithms for Minimization without Derivatives. Prentice-Hall, 1973.
[4] J. Canny, “A Computational Approach to Edge Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 6, pp. 679-698, June 1986.
[5] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[6] J. Elder and S. Zucker, “Computing Contour Closure,” Proc. European Conf. Computer Vision, pp. 399-412, 1996.
[7] Y. Gdalyahu, D. Weinshall, and M. Werman, “A Randomized Algorithm for Pairwise Clustering,” Advances in Neural Information Processing Systems, vol. 11, 1999.
[8] G. Guy and G. Medioni, “Inferring Global Perceptual Contours from Local Features,” Int'l J. Computer Vision, vol. 20, pp. 113-133, 1996.
[9] L. Herault and R. Horaud, “Figure Ground Discrimination: A Combinatorial Optimization Method,” IEEE Tran. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 899-914, Sept. 1993.
[10] R.A. Horn and C.R. Johnson, Matrix Analysis. Cambridge Univ. Press, 1990.
[11] D.W. Jacobs, "Robust and Efficient Detection of Salient Convex Groups," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, pp. 23-37, Jan. 1996.
[12] D.G. Lowe, Perceptual Organization and Visual Recognition. Boston: Kluwer Academic, 1985.
[13] S. Mahamud, K. Thornber, and L. Williams, “Segmentation of Salient Closed Contours From Real Images,” Proc. Int'l Conf. Computer Vision, 1999.
[14] G. Medioni, M. Lee, and C. Tang, A Computational Framework for Segmentation and Grouping. Elsevier Science B.V., 2000.
[15] D. Mumford, “Elastica and Computer Vision,” Algebraic Geometry and Its Applications, C. Bajaj, ed., New York: Springer-Verlag, 1994.
[16] P. Perona and W.T. Freeman, “A Factorization Approach to Grouping,” Proc. European Conf. Computer Vision '98 (ECCV '98), pp. 655-670, 1998.
[17] S.V. Raman, S. Sarkar, and K.L. Boyer, “Hypothesizing Structures in Edge-Focused Cerebral Magnetic Resonance Images Using Graph-Theoretic Cycle Enumeration,” Computer Vision, Graphics, and Image Processing, vol. 57, no. 1, pp. 81-98, 1993.
[18] S. Sarkar and K.L. Boyer, “Quantitative Measure of Change Based on Feature Organization: Eigenvalues and Eigenvectors,” Computer Vision and Image Understanding, vol. 71, pp. 110-136, July 1998.
[19] S. Sarkar and P. Soundararajan, Supervised Learning of Large Perceptual Organization: Graph Spectral Partitioning and Learning Automata IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 5, pp. 504-525, May 2000.
[20] E. Sharon, A. Brandt, R. Basri, “Completion Energies and Scale,” Proc. Computer Vision and Pattern Recognition, 1997.
[21] A. Shashua and S. Ullman, “Structural Saliency: The Detection of Globally Salient Structures Using a Locally Connected Network,” Proc. Int'l Conf. Computer Vision, 1988.
[22] J. Shi and J. Malik, “Normalized Cuts and Image Segmenation,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 731-737, June 1997.
[23] K.K. Thornber and L.R. Williams, “Analytic Solution of Stochastic Completion Fields,” Biological Cybernetics, vol. 75, pp. 141-151, 1996.
[24] K.K. Thornber, S. Mahamud, and L.R. Williams, “The Eigenvalue Problem for Reversal Matrices,” NEC Technical Report 97-162, 1998.
[25] L.R. Williams and D.W. Jacobs, “Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience,” Neural Computation, vol. 9, pp. 837-858, 1997.
[26] L. Williams and K. Thornber, “A Comparsion of Measures for Detecting Natural Shapes in Cluttered Backgroung,” Int'l J. Computer Vision, vol. 34, pp. 81-96, 1999.
[27] L.R. Williams and K.K. Thornber, “Orientation, Scale and Discontinuity as Emergent Properties of Illusory Contour Shape,” Neural Computation, vol. 13, no. 8, pp. 1683-1711, 2001.

Index Terms:
Perceptual organization, contours, Markov chains, eigenvectors.
Citation:
Shyjan Mahamud, Lance R. Williams, Karvel K. Thornber, Kanglin Xu, "Segmentation of Multiple Salient Closed Contours from Real Images," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 4, pp. 433-444, April 2003, doi:10.1109/TPAMI.2003.1190570
Usage of this product signifies your acceptance of the Terms of Use.