Isoperimetric graph partitioning for image segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 28, Issue 3, 2006, Pages 469-475

  Grady, Leo ^a   Schwartz, Eric L ^b  

^a SIEMENS CORPORATE RESEARCH   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

Algorithms; Applications; Computer vision; Graph algorithms; Graph theoretic methods; Graphs and networks; Image representation; Special architectures

Indexed keywords

ALGORITHMS; COMPUTER VISION; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; GRAPHIC METHODS; IMAGE QUALITY; SPECTRUM ANALYSIS;

GRAPH ALGORITHMS; GRAPH-THEORETIC METHODS; IMAGE REPRESENTATION; ISOPERIMETRIC GRAPH PARTITIONING; SPECIAL ARCHITECTURES;

IMAGE SEGMENTATION;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; COMPUTER GRAPHICS; EVALUATION; IMAGE ENHANCEMENT; IMAGE SUBTRACTION; INFORMATION RETRIEVAL; METHODOLOGY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER GRAPHICS; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; INFORMATION STORAGE AND RETRIEVAL; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY; SUBTRACTION TECHNIQUE;

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

References (33)

1. J. Cheeger, "A Lower Bound for the Smallest Eigenvalue of the Laplacian," Problems in Analysis, R.C. Gunning, ed., pp. 195-199, Princeton, N.J.: Princeton Univ. Press, 1970.
2. B. Mohar, "Isoperimetric Numbers of Graphs," J. Combinatorial Theory, Series B, vol. 47, pp. 274-291 1989
3. B. Mohar, "Isoperimetric Inequalities, Growth and the Spectrum of Graphs," Linear Algebra and Its Applications, vol. 103, pp. 119-131, 1988.
4. 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.
5. 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.
6. 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. 11, pp. 1101-1113, 1993.
7. Y. Boykov and M.-P. Jolly, "Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images," Proc. Int'l Conf. Computer Vision, vol. 1, pp. 105-112, July 2001.
8. F.R.K. Chung, "Spectral Graph Theory," Regional Conf. Series in Math., no. 92, Providence, R.I.: Am. Math. Soc., 1997.
9. J. Dodziuk, "Difference Equations, Isoperimetric Inequality and the Transience of Certain Random Walks," Trans. Am. Math. Soc., vol. 284, pp. 787-794, 1984.
10. J. Dodziuk and W.S. Kendall, "Combinatorial Laplacians and the Isoperimetric Inequality," From Local Times to Global Geometry, Control and Physics, K.D. Ellworthy, ed., pp. 68-74, Longman Scientific and Technical, 1986.
11. A. Pothen, H. Simon, and K.-P. Liou, "Partitioning Sparse Matrices with Eigenvectors of Graphs," SIAM J. Matrix Analysis Applications, vol. 11, no. 3, pp. 430-452, 1990.
12. Y.C. Wei and C.K. Cheng, "Ratio Cut Partitioning for Hierarchical Designs," IEEE Trans. Computer Aided-Design, vol. 10, no. 7, pp. 911-921, July 1991.
13. C. Hagen and A. Kahng, "New Spectral Methods for Ratio Cut Partitioning and Clustering," IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 11, no. 9, pp. 1074-1085, 1992.
14. S. Wang and J.M. Siskund, "Image Segmentation with Ratio Cut," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 6, pp. 675-690, June 2003.
15. N. Biggs, "Algebraic Graph Theory," Cambridge Tracts in Math., no. 67, 1974.
16. M. Fiedler, Special Matrices and Their Applications in Numerical Mathematics. Martinus Nijhoff Publishers, 1986.
17. L. Grady, "Space-Variant Computer Vision: A Graph-Theoretic Approach," PhD thesis, Boston Univ., 2004.
18. F.H. Branin Jr., "The Algebraic-Topological Basis for Network Analogies and the Vector Calculus," Proc. Generalized Networks, pp. 453-491, Apr. 1966.
19. P. Doyle and L. Snell, "Random Walks and Electric Networks," Carus Math. Monographs, no. 22, Washington, D.C.: Math. Assoc. of Am., 1984.
20. L. Grady and G. Funka-Lea, "Multi-Label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials," Proc. ECCV Workshops CVAMIA and MMBIA Computer Vision and Mathematical Methods in Medical and Biomedical Image Analysis, M. Šonka, I.A. Kakadiaris, and J. Kybic, eds., pp. 230-245, May 2004.
21. P. Tetali, "Random Walks and the Effective Resistance of Networks," J. Theoretical Probability, vol. 4, no. 1, pp. 101-109, 1991.
22. D.A. Spielman and S.-H. Teng, "Spectral Partitioning Works: Planar Graphs and Finite Element Meshes," Technical Report UCB CSD-96-898, Univ. of Calif., Berkeley, 1996.
23. W.N. Anderson Jr. and T.D. Morley, "Eigenvalues of the Laplacian of a Graph," Technical Report TR 71-45, Univ. of Maryland, Oct. 1971.
24. G. Golub and C. Van Loan, Matrix Computations, third ed. Johns Hopkins Univ. Press, 1996.
25. J. Gilbert, C. Moler, and R. Schreiber, "Sparse Matrices in MATLAB: Design and Implementation," SIAM J. Matrix Analysis and Applications, vol. 13, no. 1, pp. 333-356, 1992.
26. M. Fiedler, "Algebraic Connectivity of Graphs," Czechoslovak Math. J., vol. 23, no. 98, pp. 298-305, 1973.
27. 1, Isoperimetric Inequalities for Graphs and Superconcentrators," J. Combinatorial Theory, Series B, vol. 38, pp. 73-88, 1985.
28. Y.F. Hu and R.J. Blake, "Numerical Experiences with Partitioning of Unstructured Meshes," Parallel Computing, vol. 20, pp. 815-829, 1994.
29. L. Grady and E.L. Schwartz, "Faster Graph-Theoretic Image Processing via Small-World and Quadtree Topologies," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 360-365, 2004.
30. M. Fineman, The Nature of Visual Illusion. Dover Publications, 1996.
31. R.B. Lehoucq, D.C. Sorenson, and C. Yang, ARPACK User's Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods. Philadelphia: SIAM, 1998.
32. L. Grady and E.L. Schwartz, "The Isoperimetric Algorithm for Graph Partitioning," SIAM J. Scientific Computing, 2005, http://cns.bu.edu/lgrady/grady2005isoperimetric.pdf.
33. A. Hughes, "The Topography of Vision in Mammals of Contrasting Life Style: Comparative Optics and Retinal Organization," The Visual System in Vertebrates - The Handbook of Sensory Physiology, F. Crescitelli, ed., vol. 7, chapter 11, pp. 613-756, Springer-Verlag, 1977.