An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation (1993)

Cached

Download Links

by Zhenyu Wu , Richard Leahy
Venue:IEEE Transactions on Pattern Analysis and Machine Intelligence
Citations:280 - 0 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
2662 Normalized Cuts and Image Segmentation – Jianbo Shi, Jitendra Malik - 2000
3139 Snakes: Active contour models – Michael Kass, Andrew Witkin, Demetri Terzopoulos - 1988
3813 Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images – S Geman, D Geman - 1984
2200 Algorithms for Clustering Data – A K Jain, R C Dubes - 1988
832 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision – Yuri Boykov, Vladimir Kolmogorov - 2001
337 Exact maximum a posteriori estimation for binary images – D Greig, B Porteous, A Seheult - 1989
1429 Fast approximate energy minimization via graph cuts – Yuri Boykov, Olga Veksler, Ramin Zabih - 2001
680 Set Methods and Fast Marching Methods – Level - 1999