This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Image Segmentation with Ratio Cut
June 2003 (vol. 25 no. 6)
pp. 675-690

Abstract—This paper proposes a new cost function, cut ratio, for segmenting images using graph-based methods. The cut ratio is defined as the ratio of the corresponding sums of two different weights of edges along the cut boundary and models the mean affinity between the segments separated by the boundary per unit boundary length. This new cost function allows the image perimeter to be segmented, guarantees that the segments produced by bipartitioning are connected, and does not introduce a size, shape, smoothness, or boundary-length bias. The latter allows it to produce segmentations where boundaries are aligned with image edges. Furthermore, the cut-ratio cost function allows efficient iterated region-based segmentation as well as pixel-based segmentation. These properties may be useful for some image-segmentation applications. While the problem of finding a minimum ratio cut in an arbitrary graph is NP-hard, one can find a minimum ratio cut in the connected planar graphs that arise during image segmentation in polynomial time. While the cut ratio, alone, is not sufficient as a baseline method for image segmentation, it forms a good basis for an extended method of image segmentation when combined with a small number of standard techniques. We present an implemented algorithm for finding a minimum ratio cut, prove its correctness, discuss its application to image segmentation, and present the results of segmenting a number of medical and natural images using our techniques.

[1] Z. Wu and R. Leahy, “An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1,101-1,113, Nov. 1993.
[2] I.J. Cox, S.B. Rao, and Y. Zhong, Ratio Regions: A Technique for Image Segmentation Proc. Int'l Conf. Pattern Recognition, pp. 557-564, Aug. 1996.
[3] J. Shi and J. Malik, “Normalized Cuts and Image Segmenation,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 731-737, June 1997.
[4] I. Jermyn and H. Ishikawa, “Globally Optimal Regions and Boundaries as Minimum Ratio Cycles,” IEEE Trans. Pattern Analysis and Machine Intelligence, 2001.
[5] I.H. Jermyn and H. Ishikawa, Globally Optimal Regions and Boundaries as Minimum Ratio Cycles IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1075-1088, Oct. 2001.
[6] 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.
[7] J. Shi and J. Malik, Normalized Cuts and Image Segmentation IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000.
[8] O. Veksler, Image Segmentation by Nested Cuts Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 339-344, 2000.
[9] P. Soundararajan and S. Sarkar, Analysis of Mincut, Average Cut, and Normalized Cut Measures Proc. Third Workshop Perceptual Organization in Computer Vision, 2001.
[10] S. Wang and J.M. Siskind, Image Segmentation with Minimum Mean Cut Proc. Eighth Int'l Conf. Computer Vision, vol. 1, pp. 517-524, July 2001.
[11] J. Malik, S. Belongie, T. Leung, and J. Shi, Contour and Texture Analysis for Image Segmentation Int'l J. Computer Vision, vol. 43, no. 1, pp. 7-27, June 2001.
[12] D. Tal, Normalized Cuts Software for Image Segmentation http://www.cs.berkeley.edu/doron/software ncuts, Dec. 2000.
[13] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms,&Applications. Englewood Cliffs, N.J.: Prentice Hall, Feb. 1993.
[14] S. Wang and J. M. Siskind, Image Segmentation with Ratio Cut Extended Version Technical Report TR-ECE-02-07, Purdue Univ., 2002.
[15] R. Karp, A Characterization of the Minimum Cycle Mean in a Digraph Discrete Math., vol. 23, pp. 309-311, 1978.
[16] J. Edmonds, Maximum Matching and a Polyhedron with 0,1-Vertices J. Research Nat'l Bureau of Standards, vol. 69B, pp. 125-130, 1965.
[17] J. Edmonds, Paths, Trees and Flowers Canadian J. Math., vol. 17, pp. 449-467, 1965.
[18] Y. Aumann and Y. Rabani, An$O(\log k)$Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm SIAM J. Computing, vol. 27, no. 1, pp. 291-301, Feb. 1998.
[19] E. Sharon, A. Brandt, and R. Basri, Fast Multiscale Image Segmentation Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2000.
[20] E. Sharon, A. Brandt, and R. Basri, Segmentation and Boundary Detection Using Multiscale Intensity Measurements Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2001.
[21] H.N. Gabow, A Scaling Algorithm for Weighted Matching on General Graphs Proc. 26th Ann. Symp. Foundations of Computer Science, pp. 90-100, 1985.
[22] W. Cook and A. Rohe, Computing Minimum-Weight Perfect Matchings http://www.or.nibonn.de/home/rohematching.html, Aug. 1998.
[23] K. Mehlhorn and S. Naher, LEDA: A Platform for Combinatorial and Geometric Computing. New York: Cambridge Univ. Press, 1999.

Index Terms:
Graph partitioning algorithms, cut ratio, cycle ratio, perfect matching, perceptual organization, edge detection, image segmentation, machine vision.
Citation:
Song Wang, Jeffrey Mark Siskind, "Image Segmentation with Ratio Cut," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 6, pp. 675-690, June 2003, doi:10.1109/TPAMI.2003.1201819
Usage of this product signifies your acceptance of the Terms of Use.