Learning segmentation by random walks

Advances in Neural Information Processing Systems

Volumn , Issue , 2001, Pages

  Meilǎ, Marina ^a   Shi, Jianbo ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; IMAGE SEGMENTATION;

EDGE FLOW; EIGENVALUES AND EIGENVECTORS; NORMALIZED CUTS; RANDOM WALK; SIMILARITY FUNCTIONS; SPECTRAL METHODS; TRANSITION MATRICES;

RANDOM PROCESSES;

EID: 84898985184     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Fan R. K. Chung. Spectral Graph Theory. American Methematical Society, 1997.
2. Ravi Kannan, Santosh Vempala, and Adrian Vetta. On clusterings: good, bad and spectral. In Proc. 41st Symposium on the Foundations of Computer Science, 2000.
3. J. R. Kemeny and J. L. Snell. Finite Markov Chains. Van Nostrand, New York, 1960.
4. Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. Technical report, IBM Research Division, Almaden Research Center, 1997.
5. M. Maila and J. Shi. A random walks view of spectral segmentation. In Proc. International Workshop on AI and Statistics(AISTATS), 2001.
6. Jitendra Malik, Serge Belongie, Thomas Leung, and Jianbo Shi. Contour and texture analysis for image segmentation. International Journal of Computer Vision, 2000.
7. P. Perona and W. Freeman. A factorization approach to grouping. In European Conference on Computer Vision, 1998.
8. G.L. Scott and H. C. Longuet-Higgins. Feature grouping by relocalsation of eigenvectors of the proximity matrix. In Proc. British Machine Vision Conference, 1990.
9. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000. An earlier version appeared in CVPR 1997.
10. Y. Weiss. Segmentation using eigenvectors: a unifying view. In International Conference on Computer Vision, 1999.