The Community for Technology Leaders
Green Image
Issue No. 11 - November (2006 vol. 28)
ISSN: 0162-8828
pp: 1768-1783
L. Grady , Siemens Corporate Research, Department of Imaging and Visualization, Princeton, NJ
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
Image segmentation, Iterative algorithms, Probability, Pixel, Electric potential, Circuits, Graph theory, Laplace equations, Sparse matrices, Symmetric matrices

L. Grady, "Random Walks for Image Segmentation," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 28, no. 11, pp. 1768-1783, 2009.
166 ms
(Ver 3.3 (11022016))