
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Leo Grady, Eric L. Schwartz, "Isoperimetric Graph Partitioning for Image Segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 3, pp. 469475, March, 2006.  
BibTex  x  
@article{ 10.1109/TPAMI.2006.57, author = {Leo Grady and Eric L. Schwartz}, title = {Isoperimetric Graph Partitioning for Image Segmentation}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {28}, number = {3}, issn = {01628828}, year = {2006}, pages = {469475}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.57}, 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  Isoperimetric Graph Partitioning for Image Segmentation IS  3 SN  01628828 SP469 EP475 EPD  469475 A1  Leo Grady, A1  Eric L. Schwartz, PY  2006 KW  Index Terms Graphtheoretic methods KW  graphs and networks KW  graph algorithms KW  image representation KW  special architectures KW  algorithms KW  computer vision KW  applications. VL  28 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] J. Cheeger, “A Lower Bound for the Smallest Eigenvalue of the Laplacian,” Problems in Analysis, R.C. Gunning, ed., pp. 195199, Princeton, N.J.: Princeton Univ. Press, 1970.
[2] B. Mohar, “Isoperimetric Numbers of Graphs,” J. Combinatorial Theory, Series B, vol. 47, pp. 274291 1989
[3] B. Mohar, “Isoperimetric Inequalities, Growth and the Spectrum of Graphs,” Linear Algebra and Its Applications, vol. 103, pp. 119131, 1988.
[4] J. Shi and J. Malik, “Normalized Cuts and Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888905, 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. 504525, 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. 11011113, 1993.
[7] Y. Boykov and M.P. Jolly, “Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in ND Images,” Proc. Int'l Conf. Computer Vision, vol. 1, pp. 105112, 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. 787794, 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. 6874, 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. 430452, 1990.
[12] Y.C. Wei and C.K. Cheng, “Ratio Cut Partitioning for Hierarchical Designs,” IEEE Trans. Computer AidedDesign, vol. 10, no. 7, pp. 911921, July 1991.
[13] C. Hagen and A. Kahng, “New Spectral Methods for Ratio Cut Partitioning and Clustering,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 11, no. 9, pp. 10741085, 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. 675690, 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, “SpaceVariant Computer Vision: A GraphTheoretic Approach,” PhD thesis, Boston Univ., 2004.
[18] F.H. BraninJr., “The AlgebraicTopological Basis for Network Analogies and the Vector Calculus,” Proc. Generalized Networks, pp. 453491, 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. FunkaLea, “MultiLabel Image Segmentation for Medical Applications Based on GraphTheoretic 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. 230245, May 2004.
[21] P. Tetali, “Random Walks and the Effective Resistance of Networks,” J. Theoretical Probability, vol. 4, no. 1, pp. 101109, 1991.
[22] D.A. Spielman and S.H. Teng, “Spectral Partitioning Works: Planar Graphs and Finite Element Meshes,” Technical Report UCB CSD96898, Univ. of Calif., Berkeley, 1996.
[23] W.N. AndersonJr. and T.D. Morley, “Eigenvalues of the Laplacian of a Graph,” Technical Report TR 7145, 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. 333356, 1992.
[26] M. Fiedler, “Algebraic Connectivity of Graphs,” Czechoslovak Math. J., vol. 23, no. 98, pp. 298305, 1973.
[27] N. Alon and V.D. Milman, “$\lambda_1$ , Isoperimetric Inequalities for Graphs and Superconcentrators,” J. Combinatorial Theory, Series B, vol. 38, pp. 7388, 1985.
[28] Y.F. Hu and R.J. Blake, “Numerical Experiences with Partitioning of Unstructured Meshes,” Parallel Computing, vol. 20, pp. 815829, 1994.
[29] L. Grady and E.L. Schwartz, “Faster GraphTheoretic Image Processing via SmallWorld and Quadtree Topologies,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 360365, 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 LargeScale 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/lgradygrady2005isoperimetric.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. 613756, SpringerVerlag, 1977.