An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision (2001)

by Yuri Boykov , Vladimir Kolmogorov
Venue:IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
Citations:1185 - 52 self

Documents Related by Co-Citation

10421 Maximum likelihood from incomplete data via the EM algorithm – A. P. Dempster, N. M. Laird, D. B. Rubin - 1977
1962 Fast approximate energy minimization via graph cuts – Yuri Boykov, Olga Veksler, Ramin Zabih - 2001
936 Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images – Yuri Y. Boykov, et al. - 2001
406 maximum a posteriori estimation for binary images – D M Greig, B T Porteous, A H Seheult - 1989
1400 A taxonomy and evaluation of dense two-frame stereo correspondence algorithms – Daniel Scharstein, Richard Szeliski - 2002
957 What energy functions can be minimized via graph cuts? – Vladimir Kolmogorov, Ramin Zabih - 2004
4618 Sthocastic relaxation, Gibbs distribution, and Bayesian Restoration of Images – S Geman, D Geman - 1984
3436 Normalized Cuts and Image Segmentation – Jianbo Shi, Jitendra Malik - 2000
461 Graphcut textures: Image and video synthesis using graph cuts РVivek Kwatra, Arno Sch̦dl, Irfan Essa, Greg Turk, Aaron Bobick - 2003