An in-depth study of graph partitioning measures for perceptual organization

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 25, Issue 6, 2003, Pages 642-660

  Soundararajan, Padmanabhan ^a   Sarkar, Sudeep ^a  

^a University of South Florida   (United States)

Author keywords

Empirical evaluation; Graph partitioning; Grouping; Perceptual organization; Stochastic orders

Indexed keywords

GRAPH THEORY; RANDOM PROCESSES; VISION;

PERCEPTUAL ORGANIZATION;

IMAGING TECHNIQUES;

EID: 0038719905     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2003.1201817     Document Type: Article

References (42)

1. A. Amir and M. Lindenbaum, "A Generic Grouping Algorithm and Its Quantitative Analysis," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 2, pp. 168-185, 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. 195-216, 2001.
3. R.P. Boppana, "Eigenvalues and Graph Bisection: An Average Case Analysis," Proc. 28th Int'l Symp. Foundations of Computer Science, pp 280-285, 1987.
4. S. Borra and S. Sarkar, "A Framework for Performance Characterization of Intermediate-Level Grouping Modules," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 11, pp. 1306-1312, 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. 181-192, 1984.
6. S. Casadei and S.K. Mitter, "Hierarchical Image Segmentation-Detection of Regular Curves in a Vector Graph," Int'l J. Computer Vision, vol. 27, no. 1, pp. 71-100, 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. 185-223, 2000.
8. D.T. Clemens and D.W. Jacobs, "Space and Time Bounds on Indexing 3D Models from 2D Images," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 10, pp. 1007-1017, Oct. 1991.
9. J. Costeira and T. Kanade, "A Multibody Factorization Method for Motion Analysis," Proc. Int'l Conf. Computer Vision, pp. 1071-1076, 1995.
10. I.J. Cox and S.B.R. an, and Y. Zhong, "Ratio Regions: A Technique for Image Segmentation," Proc. Int'l Cof. Pattern Recognition, pp. 557-564, 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. 367-374, June 2000.
13. W.E.L. Crimson, "The Combinatorics of Heuristic Search Termination for Object Recognition in Cluttered Environments," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 9, pp. 920-935, Sept. 1991.
14. G. Guy and G. Medioni, "Inferring Global Perceptual Contours from Local Features," Int'l J. Computer Vision, vol. 20, pp. 113-133, 1996.
15. L. Herault and R. Horaud, "Figure Ground Discrimination: A Combinatorial Optimization Method," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 899-914, 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. 406-412, 1991.
17. D.W. Jacobs, "Robust and Efficient Detection of Salient Convex Groups," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 1, pp. 23-37, Jan. 1996.
18. I.H. Jermyn and H. Ishikawa, "Globally Optimal Regions and Boundaries as Minimum Ratio Weight Cycles," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1075-1088, Oct. 2001.
19. D.W. Matula, "Graph Theoretic Techniques for Cluster Analysis Algorithms," Classification and Clustering, J.V. Ryzin, ed., pp. 95-129, 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. 655-670, 1998.
22. S.V. Raman, S. Sarkar, and K.L. Boyer, "A Graph-Theoretic Approach to Generating Structure Hypotheses in Cerebral Magnetic Resonance Images," Computer Vision, Graphics, and Image Understanding, vol. 57, no. 1, pp. 81-98, Jan. 1993.
23. Y. Saab and V. Rao, "On the Graph Bisection Problem," IEEE Trans. Circuits and Systems, vol. 39, no. 9, pp. 760-762, Sept. 1992.
24. T. Sanocki, Student Friendly Statistics. Prentice Hall, 2000.
25. H. Saran and V.V. Vazirani, "Finding K-Cuts within Twice the Optimal," SIAM J. Computing, vol. 24, no. 1, pp. 101-108, 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, no. 2, pp. 246-267, 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. 110-136, 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. 504-525, May 2000.
29. G.L. Scott and H.C. Longuet-Higgins, "Feature Grouping by Relocalisation of Eigenvectors of the Proximity Matrix," Proc. British Machine Vision Conf., pp. 103-108, 1990.
30. J. 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. 321-327, 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 Segmentation," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 731-737, June 1997.
33. P. Soundararajan and S. Sarkar, "Investigation of Measures for Grouping by Graph Partitioning," Proc. Int'l Cof. Computer Vision and Pattern Recognition, pp. 239-246, 2001.
34. M. Stoer and F. Wagner, "A Simple Min Cut Algorithm," Algorithms-ESA '94, pp. 141-147, 1994.
35. C.C. Tu and H. Cheng, "Spectral Methods for Graph Bisection Problems," Computers Operations Research, vol. 25, nos. 7/8, pp. 519-530, 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. Int'l Conf. Computer Vision, pp. 517-524, 2001.
38. Y. Weiss, "Segmentation Using Eigenvectors: A Unifying View," Proc. Int'l Conf. Computer Vision, vol. 2, pp. 975-982, 1999.
39. L.R. Williams and D.W. Jacobs, "Stochastic Completion Fields: A Neural Model of Illusory Contour Shape and Salience," Proc. Int'l Conf. Computer Vision, pp. 408-415, 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. 81-96, Aug. 1999.
41. Z. Wu and R. Leahy, "An Optimal Graph Theoretic Approach to Data Clustering: Theory and Application to Image Segmentation," IEHE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1101-1113, Nov. 1993.
42. C.T. Zahn, "Graph Theoretic Methods for Detecting and Describing Gestalt Clusters," IEEE Trans. Computers, vol. 20, pp. 68-86, 1971.