Sciweavers

Share
PAMI
2006

Random Walks for Image Segmentation

8 years 11 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can analytically and quickly determine the probability that a random walker starting at each unlabeled pixel will first reach one of the pre-labeled 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.
Leo Grady
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2006
Where PAMI
Authors Leo Grady
Comments (0)
books