
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Padmanabhan Soundararajan, Sudeep Sarkar, "An InDepth Study of Graph Partitioning Measures for Perceptual Organization," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 6, pp. 642660, June, 2003.  
BibTex  x  
@article{ 10.1109/TPAMI.2003.1201817, author = {Padmanabhan Soundararajan and Sudeep Sarkar}, title = {An InDepth Study of Graph Partitioning Measures for Perceptual Organization}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {25}, number = {6}, issn = {01628828}, year = {2003}, pages = {642660}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2003.1201817}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  An InDepth Study of Graph Partitioning Measures for Perceptual Organization IS  6 SN  01628828 SP642 EP660 EPD  642660 A1  Padmanabhan Soundararajan, A1  Sudeep Sarkar, PY  2003 KW  Perceptual organization KW  grouping KW  graph partitioning KW  stochastic orders KW  empirical evaluation. VL  25 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
Abstract—In recent years, one of the effective engines for perceptual organization of lowlevel image features is based on the partitioning of a graph representation that captures Gestalt inspired local structures, such as similarity, proximity, continuity, parallelism, and perpendicularity, over the lowlevel image features. Mainly motivated by computational efficiency considerations, this graph partitioning process is usually implemented as a recursive bipartitioning process, where, at each step, the graph is broken into two parts based on a partitioning measure. We concentrate on three such measures, namely, the minimum, average, and normalized cuts. The minimum cut partition seeks to minimize the total link weights cut. The average cut measure is proportional to the total link weight cut, normalized by the sizes of the partitions. The normalized cut measure is normalized by the product of the total connectivity (valencies) of the nodes in each partition. We provide theoretical and empirical insight into the nature of the three partitioning measures in terms of the underlying image statistics. In particular, we consider for what kinds of image statistics would optimizing a measure, irrespective of the particular algorithm used, result in correct partitioning. Are the quality of the groups significantly different for each cut measure? Are there classes of images for which grouping by partitioning does not work well? Another question of interest is if the recursive bipartitioning strategy can separate out groups corresponding to K objects from each other. In the analysis, we draw from probability theory and the rich body of work on stochastic ordering of random variables. Our major conclusion is that optimization of none of the three measures is guaranteed to result in the correct partitioning of K objects, in the strict stochastic order sense, for all image statistics. Qualitatively speaking, under very restrictive conditions, when the average interobject feature affinity is very weak when compared to the average intraobject feature affinity, the minimum cut measure is optimal. The average cut measure is optimal for graphs whose partition width is less than the mode of distribution of all possible partition widths. The normalized cut measure is optimal for a more restrictive subclass of graphs whose partition width is less than the mode of the partition width distributions and the strength of interobject links is six times less than the intraobject links. Rigorous empirical evaluation on 50 real images indicates that, in practice, the quality of the groups generated using minimum or average or normalized cuts are statistically equivalent for object recognition, i.e., the best, the mean, and the variation of the qualities are statistically equivalent. We also find that, for certain image classes, such as aerial and scenes with manmade objects, in manmade surroundings, the performance of grouping by partitioning is the worst, irrespective of the cut measure.
[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. 168185, Feb. 1998.
[2] A. Berengolts and M. Lindenbaum, On the Performance of Connected Components Grouping Int'l J. Computer Vision, vol. 41, no. 3, pp. 195216, 2001.
[3] R.P. Boppana, Eigenvalues and Graph Bisection: An Average Case Analysis Proc. 28th Int'l Symp. Foundations of Computer Science, pp 280285, 1987.
[4] S. Borra and S. Sarkar, “A Framework for Performance Characterization of IntermediateLevel Grouping Modules,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 11, pp. 1,3061,312, Nov. 1997.
[5] T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, Graph Bisection Algorithms with Good Average Case Behavior Proc. 25th Int'l Symp. Foundations of Computer Science, pp. 181192, 1984.
[6] S. Casadei and S.K. Mitter, Hierarchical Image SegmentationDetection of Regular Curves in a Vector Graph Int'l J. Computer Vision, vol. 27, no. 1, pp. 71100, 1998.
[7] S. Chavali and S. Sarkar, Modeling Parameter Space Behavior of Vision Systems Using Bayesian Networks Computer Vision and Image Understanding, vol. 79, pp. 185223, 2000.
[8] D. Clemens and D. Jacobs, "Space and time bounds on model indexing," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 10, pp. 1,0071,018, 1991.
[9] J. Costeira and T. Kanade, "A MultiBody Factorization Method for Motion Analysis," Int'l Conf. Computer Vision, pp. 1,0711,076,Cambridge, Mass., June 1995.
[10] I.J. Cox, S.B. Rao, and Y. Zhong, Ratio Regions: A Technique for Image Segmentation Proc. Int'l Conf. Pattern Recognition, pp. 557564, Aug. 1996.
[11] J. Galambos, The Asymptotic Theory of Extreme Order Statistics. John Wiley and Sons, 1978.
[12] Y. Gdalyahu, N. Shental, and D. Weinshall, Perceptual Grouping and Segmentation by Stochaistic Clustering Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 367374, June 2000.
[13] W.E.L. Grimson, "The Combinatorics of Heuristic Search Termination for Object Recognition in Cluttered Environments," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 9, pp. 920935, Sept. 1991.
[14] G. Guy and G. Medioni, Inferring Global Perceptual Contours from Local Features Int'l J. Computer Vision, vol. 20, pp. 113133, 1996.
[15] L. Herault and R. Horaud, “Figure Ground Discrimination: A Combinatorial Optimization Method,” IEEE Tran. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 899914, Sept. 1993.
[16] D.P. Huttenlocher and P.C. Wayner, Finding Convex Edge Groupings in an Image Proc. Int'l Conf. Computer Vision and Pattern Recognition, pp. 406412, 1991.
[17] D.W. Jacobs, "Robust and Efficient Detection of Salient Convex Groups," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, pp. 2337, Jan. 1996.
[18] 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. 10751088, Oct. 2001.
[19] D.W. Matula, Graph Theoretic Techniques for Cluster Analysis Algorithms Classification and Clustering, J.V. Ryzin, ed., pp. 95129, 1977.
[20] K.S. Narendra and M.L. Thathachar, Learning Automata: An Introduction. Prentice Hall, 1989.
[21] P. Perona and W. Freeman, A Factorization Approach to Grouping Proc. European Conf. Computer Vision, pp. 655670, 1998.
[22] S.V. Raman, S. Sarkar, and K.L. Boyer, A GraphTheoretic Approach to Generating Structure Hypotheses in Cerebral Magnetic Resonance Images Computer Vision, Graphics, and Image Understanding, vol. 57, no. 1, pp. 8198, Jan. 1993.
[23] Y. Saab and V. Rao, On the Graph Bisection Problem IEEE Trans. Circuits and Systems, vol. 39, no. 9, pp. 760762, Sept. 1992.
[24] T. Sanocki, Student Friendly Statistics. Prentice Hall, 2000.
[25] H. Saran and V.V. Vazirani, Finding KCuts within Twice the Optimal SIAM J. Computing, vol. 24, no. 1, pp. 101108, Feb. 1995.
[26] S. Sarkar and K.L. Boyer, “A Computational Structure for Preattentive Perceptual Organization: Graphical Enumeration and Voting Methods,” IEEE Trans. Systems, Man, and Cybernetics, vol. 24, pp. 246267, Feb. 1994.
[27] S. Sarkar and K.L. Boyer, Quantitative Measure of Change Based on Feature Organization: Eigenvalues and Eigenvectors Computer Vision and Image Understanding, vol. 71, no. 1, pp. 110136, July 1998.
[28] 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. 504525, May 2000.
[29] G.L. Scott and H.C. LonguetHiggins, Feature Grouping by Relocalisation of Eigenvectors of the Proximity Matrix Proc. British Machine Vision Conf., pp. 103108, 1990.
[30] A. Sha'ashua and S. Ullman, “Structural Saliency: The Detection of Globally Salient Structures Using a Locally Connected Network,” Proc. Int'l Conf. Computer Vision, pp. 321327, 1988.
[31] M. Shaked and J.G. Shantikumar, Stochastic Orders and Their Application. Academic Press Inc., 1994.
[32] J. Shi and J. Malik, “Normalized Cuts and Image Segmenation,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 731737, June 1997.
[33] P. Soundararajan and S. Sarkar, Investigation of Measures for Grouping by Graph Partitioning Proc. Conf. Computer Vision and Pattern Recognition, pp. 239246, 2001.
[34] M. Stoer and F. Wagner, A Simple Min Cut Algorithm AlgorithmsESA '94, pp. 141147, 1994.
[35] C.C. Tu and H. Cheng, Spectral Methods for Graph Bisection Problems Computers Operations Research, vol. 25, nos. 7/8, pp. 519530, July 1999.
[36] D. Wagner and F. Wagner, Between Min Cut and Graph Bisection Technical Report no. 307/1991, Algorithmic Discrete Math. Report, TU Berlin, Sept. 1991.
[37] S. Wang and J.M. Siskind, Image Segmentation with Minimum Mean Cut Proc. Eighth Int'l Conf. Computer Vision, vol. 1, pp. 517524, July 2001.
[38] Y. Weiss, Segmentation Using Eigenvectors: A Unifying View Proc. Int'l Conf. Computer Vision, vol. 2, pp. 975982, 1999.
[39] L. Williams and D. Jacobs, Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience Proc. Fifth Int'l Conf. Computer Vision, pp. 408415, 1995.
[40] L.R. Williams and K.K. Thornber, A Comparison of Measures for Detecting Natural Shapes in Cluttered Backgrounds Int'l J. Computer Vision, vol. 34, nos. 2/3, pp. 8196, Aug. 1999.
[41] 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,1011,113, Nov. 1993.
[42] C.T. Zahn, Graph Theoretic Methods for Detecting and Describing Gestalt Clusters IEEE Trans. Computers, vol. 20, pp. 6886, 1971.