Random Walks for Image Segmentation

  • Leo Grady
  • Published 2006 in
    IEEE Transactions on Pattern Analysis and Machine…

Abstract

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

DOI: 10.1109/TPAMI.2006.233

Extracted Key Phrases

9 Figures and Tables

0100200300'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

2,130 Citations

Semantic Scholar estimates that this publication has 2,130 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Grady2006RandomWF, title={Random Walks for Image Segmentation}, author={Leo Grady}, journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, year={2006}, volume={28}, pages={1768-1783} }