This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Connectedness of Random Walk Segmentation
January 2011 (vol. 33 no. 1)
pp. 200-202
Ming-Ming Cheng, TNList Tsinghua University, Beijing
Guo-Xin Zhang, TNList Tsinghua University, Beijing
Connectedness of random walk segmentation is examined, and novel properties are discovered, by considering electrical circuits equivalent to random walks. A theoretical analysis shows that earlier conclusions concerning connectedness of random walk segmentation results are incorrect, and counterexamples are demonstrated.

[1] L. Grady, "Random Walks for Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 1768-1783, Nov. 2006.
[2] P. Doyle and L. Snell, Random Walks and Electric Networks, Carus Mathematical Monographs, no. 22. Math. Assoc. of Am., 1984.

Index Terms:
Image segmentation, random walk, Laplace's equation, counterexample, connectednes.
Citation:
Ming-Ming Cheng, Guo-Xin Zhang, "Connectedness of Random Walk Segmentation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 1, pp. 200-202, Jan. 2011, doi:10.1109/TPAMI.2010.138
Usage of this product signifies your acceptance of the Terms of Use.