This Article 
 Bibliographic References 
 Add to: 
Random Walks for Image Segmentation
November 2006 (vol. 28 no. 11)
pp. 1768-1783
Leo Grady, IEEE
A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or predefined) labels, one can analytically and quickly determine the probability that a random walker starting at each unlabeled pixel will first reach one of the prelabeled pixels. By assigning each pixel to the label for which the greatest probability is calculated, a high-quality image segmentation may be obtained. Theoretical properties of this algorithm are developed along with the corresponding connections to discrete potential theory and electrical circuits. This algorithm is formulated in discrete space (i.e., on a graph) using combinatorial analogues of standard operators and principles from continuous potential theory, allowing it to be applied in arbitrary dimension on arbitrary graphs.

[1] L. Grady and G. Funka-Lea, “Multi-Label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials,” Proc. Workshop Computer Vision and Math. Methods in Medical and Biomedical Image Analysis, pp. 230-245, May 2004.
[2] R. Wallace, P.-W. Ong, and E. Schwartz, “Space Variant Image Processing,” Int'l J. Computer Vision, vol. 13, no. 1, pp. 71-90, Sept. 1994.
[3] L. Grady, “Space-Variant Computer Vision: A Graph-Theoretic Approach,” PhD dissertation, Boston Univ., 2004.
[4] S. Kakutani, “Markov Processes and the Dirichlet Problem,” Proc. Japanese Academy, vol. 21, pp. 227-233, 1945.
[5] P. Doyle and L. Snell, Random Walks and Electric Networks, no. 22, Washington, D.C.: Math. Assoc. of Am., 1984.
[6] R. Courant and D. Hilbert, Methods of Math. Physics, vol. 2. John Wiley and Sons, 1989.
[7] R. Hersh and R.J. Griego, “Brownian Motion and Potential Theory,” Scientific Am., vol. 220, pp. 67-74, 1969.
[8] F.H. BraninJr., “The Algebraic-Topological Basis for Network Analogies and the Vector Calculus,” Proc. Conf. Generalized Networks, pp. 453-491, Apr. 1966.
[9] P. Tetali, “Random Walks and the Effective Resistance of Networks,” J. Theoretical Probability, vol. 4, no. 1, pp. 101-109, 1991.
[10] N. Biggs, “Algebraic Potential Theory on Graphs,” Bull. London Math. Soc., vol. 29, pp. 641-682, 1997.
[11] Z. Tu and S.-C. Zhu, “Image Segmentation by Data-Driven Markov Chain Monte Carlo,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 657-673, May 2002.
[12] S.C. Zhu, Y. Wu, and D. Mumford, “Filters, Random Field and Maximum Entropy (FRAME),” Int'l J. Computer Vision, vol. 27, no. 2, pp. 1-20, Mar./Apr. 1998.
[13] P. Perona and J. Malik, “Scale-Space and Edge Detection Using Anisotropic Diffusion,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 7, pp. 629-639, July 1990.
[14] 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.
[15] E. Mortensen and W. Barrett, “Interactive Segmentation with Intelligent Scissors,” Graphical Models in Image Processing, vol. 60, no. 5, pp. 349-384, 1998.
[16] J.A. Sethian, Level Set Methods and Fast Marching Methods. Cambridge Univ. Press, 1999.
[17] M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active Contour Models,” Int'l J. Computer Vision, vol. 1, no. 4, pp. 321-331, 1987.
[18] Y. Boykov and M.-P. Jolly, “Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images,” Proc. Int'l Conf. Computer Vision, pp. 105-112, 2001.
[19] Y. Boykov and V. Kolmogorov, “An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124-1137, Sept. 2004.
[20] Y. Boykov, O. Veksler, and R. Zabih, “A New Algorithm for Energy Minimization with Discontinuities,” Proc. Second Int'l Workshop Energy Minimization Methods in Computer Vision and Pattern Recognition, pp. 205-220, July 1999.
[21] L. Grady, “Multilabel Random Walker Image Segmentation Using Prior Models,” Proc. 2005 IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 763-770, June 2005.
[22] H. Lombaert, Y. Sun, L. Grady, and C. Xu, “A Multilevel Banded Graph Cuts Method for Fast Image Segmentation,” Proc. Int'l Conf. Computer Vision 2005, vol. 1, pp. 259-265, Oct. 2005.
[23] Y. Li, J. Sun, C. Tang, and H. Shum, “Lazy Snapping,” Proc. ACM SIGGRAPH Conf., pp. 303-308, Apr. 2004.
[24] A. Blake, C. Rother, M. Brown, P. Perez, and P. Torr, “Interactive Image Segmentation Using an Adaptic GMMRF Model,” Proc. European Conf. Computer Vision, pp. 428-441, May 2004.
[25] C. Rother, V. Kolmogorov, and A. Blake, “`GrabCut'—Interactive Foreground Extraction Using Iterated Graph Cuts,” ACM Trans. Graphics, vol. 23, no. 3, pp. 309-314, 2004.
[26] C. Zahn, “Graph Theoretical Methods for Detecting and Describing Gestalt Clusters,” IEEE Trans. Computers, vol. 20, pp. 68-86, 1971.
[27] 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.
[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] P. Perona and W. Freeman, “A Factorization Approach to Grouping,” Proc. Fifth European Conf. Computer Vision, pp. 655-670, June 1998.
[30] L. Grady and E.L. Schwartz, “Isoperimetric Graph Partitioning for Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 3, pp. 469-475, Mar. 2006.
[31] A. Barbu and S.-C. Zhu, “Graph Partition by Swendsen-Wang Cuts,” Proc. Ninth IEEE Conf. Computer Vision, vol. 1, pp. 320-327, Oct. 2003.
[32] L. Grady and E. Schwartz, “Anisotropic Interpolation on Graphs: The Combinatorial Dirichlet Problem,” Technical Report CAS/CNS-TR-03-014, Dept. of Cognitive and Neural Systems, Boston Univ., 2003.
[33] A. Levin, D. Lischinski, and Y. Weiss, “Colorization Using Optimization,” Proc. ACM SIGGRAPH Conf., pp. 689-694, Aug. 2004.
[34] X. Zhu, Z. Ghahramani, and J. Lafferty, “Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions,” Proc. 20th Int'l Conf. Machine Learning, pp. 912-919, 2003.
[35] V.B. Eckmann, “Harmonische Funktionen und Randwertaufgaben in einem Komplex,” Commentarii Math. Helvetici, vol. 17, pp. 240-255, 1945.
[36] U.R. Kodres, “Geometrical Positioning of Circuit Elements in a Computer,” Proc. 1959 AIEE Fall General Meeting, Oct. 1959.
[37] W.T. Tutte, “How to Draw a Graph,” Proc. London Math. Soc., vol. 13, no. 3, pp. 743-768, 1963.
[38] H. Wechsler and M. Kidode, “A Random Walk Procedure for Texture Discrimination,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, no. 3, pp. 272-280, 1979.
[39] L. Gorelick, M. Galun, E. Sharon, R. Basri, and A. Brandt, “Shape Representation and Classification Using the Poisson Equation,” Proc. 2004 IEEE CS Conf. Computer Vision and Pattern Recognition (CVPR '04), vol. 2, pp. 61-67, July 2004.
[40] L. Grady and E.L. Schwartz, “Isoperimetric Partitioning: A New Algorithm for Graph Partitioning,” SIAM J. Scientific Computing, vol. 27, no. 6, pp. 1844-1866, June 2006.
[41] D. Harel and Y. Koren, “On Clustering Using Random Walks,” Proc. 21st Conf. Foundations of Software Technology and Theoretical Computer Science, vol. 2245, pp. 18-41, 2001.
[42] L. Yen, D. Vanvyve, F. Wouters, F. Fouss, M. Verleysen, and M. Saerens, “Clustering Using a Random-Walk Based Distance Measure,” Proc. 13th Symp. Artificial Neural Networks, pp. 317-324, 2005.
[43] M.E.J. Newman, “A Measure of Betweenness Centrality Based on Random Walks,” Social Networks, vol. 27, no. 1, pp. 39-54, Jan. 2005.
[44] F. Harary, Graph Theory. Addison-Wesley, 1994.
[45] M.J. Black, G. Sapiro, D.H. Marimont, and D. Heeger, “Robust Anisotropic Diffusion,” IEEE Trans. Image Processing, vol. 7, no. 3, pp. 421-432, Mar. 1998.
[46] X. Zhu, J. Lafferty, and Z. Ghahramani, “Combining Active Learning and Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions,” Proc. ICML 2003 Workshop Continuum from Labeled to Unlabeled Data in Machine Learning and Data Mining, pp. 58-65, 2003.
[47] J. Dodziuk, “Difference Equations, Isoperimetric Inequality and the Transience of Certain Random Walks,” Trans. Am. Math. Soc., vol. 284, pp. 787-794, 1984.
[48] J. Roth, “An Application of Algebraic Topology to Numerical Analysis: On the Existence of a Solution to the Network Problem,” Proc. Nat'l Academy of Science of Am., vol. 41, pp. 518-521, 1955.
[49] C. Mattiussi, “The Finite Volume, Finite Element and Finite Difference Methods as Numerical Methods for Physical Field Problems,” Advances in Imaging and Electron Physics, pp. 1-146, Apr. 2000.
[50] F.R.K. Chung, Spectral Graph Theory, no. 92, Providence, R.I.: Am. Math. Soc., 1997.
[51] N. Biggs, Algebraic Graph Theory, no. 67, Cambridge Univ. Press, 1974.
[52] G. Golub and C. Van Loan, Matrix Computations, third ed. The Johns Hopkins Univ. Press, 1996.
[53] W. Hackbusch, Iterative Solution of Large Sparse Systems of Equations. Springer-Verlag, 1994.
[54] J.J. Dongarra, I.S. Duff, D.C. Sorenson, and H.A. van der Vorst, Solving Linear Systems on Vector and Shared Memory Computers. Philadelphia: SIAM, 1991.
[55] K. Gremban, “Combinatorial Preconditioners for Sparse, Symmetric Diagonally Dominant Linear Systems,” PhD dissertation, Carnegie Mellon Univ., Pittsburgh, Penn. Oct. 1996.
[56] J. Bolz, I. Farmer, E. Grinspun, and P. Schröder, “Sparse Matrix Solvers on the GPU: Conjugate Gradients and Multigrid,” ACM Trans. Graphics, vol. 22, no. 3, pp. 917-924, July 2003.
[57] J. Krüger and R. Westermann, “Linear Algebra Operators for GPU Implementation of Numerical Algorithms,” ACM Trans. Graphics, vol. 22, no. 3, pp. 908-916, July 2003.
[58] Multigrid, U. Trottenberg, C.W. Oosterlee, and A. Schuller, eds. San Diego, Calif.: Academic Press, 2000.
[59] J.E. Dendy, “Black Box Multigrid,” J. Computational Physics, vol. 48, pp. 366-386, 1982.
[60] L. Grady and E.L. Schwartz, “Faster Graph-Theoretic Image Processing via Small-World and Quadtree Topologies,” Proc. 2004 IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 360-365, June-July 2004.
[61] L. Grady and E.L. Schwartz, “The Graph Analysis Toolbox: Image Processing on Arbitrary Graphs,” Technical Report TR-03-021, Boston Univ., Aug. 2003.
[62] G. Kirchhoff, “Über die Auflösung der Gleichungen, auf Welche man bei der Untersuchung der Linearen Verteilung Galvanischer Ströme Geführt Wird,” Poggendorf's Annalen der Physik Chemie, vol. 72, pp. 497-508, 1847.
[63] M. Fiedler, Special Matrices and Their Applications in Numerical Mathematics. Martinus Nijhoff Publishers, 1986.
[64] L. Grady, T. Schiwietz, S. Aharon, and R. Westermann, “Random Walks for Interactive Organ Segmentation in Two and Three Dimensions: Implementation and Validation,” Proc. Conf. Medical Image Computing and Computer-Assisted Intervention 2005 II, pp.773-780, Oct. 2005.

Index Terms:
Image segmentation, interactive segmentation, graph theory, random walks, combinatorial Dirichlet problem, harmonic functions, Laplace equation, graph cuts, boundary completion.
Leo Grady, "Random Walks for Image Segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 1768-1783, Nov. 2006, doi:10.1109/TPAMI.2006.233
Usage of this product signifies your acceptance of the Terms of Use.