Computing geodesics and minimal surfaces via graph cuts (2003)

by Yuri Boykov
Venue:in International Conference on Computer Vision
Citations:188 - 22 self

Documents Related by Co-Citation

1429 Fast approximate energy minimization via graph cuts – Yuri Boykov, Olga Veksler, Ramin Zabih - 2001
719 What energy functions can be minimized via graph cuts – Vladimir Kolmogorov, Ramin Zabih - 2004
832 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision – Yuri Boykov, Vladimir Kolmogorov - 2001
260 Multi-camera Scene Reconstruction via Graph Cuts – Vladimir Kolmogorov, Ramin Zabih - 2002
679 Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images – Yuri Y. Boykov, et al. - 2001
1103 Geodesic Active Contours – Vicent Caselles, Ron Kimmel, Guillermo Sapiro - 1997
1072 A taxonomy and evaluation of dense two-frame stereo correspondence algorithms – Daniel Scharstein, Richard Szeliski - 2002
237 A Maximum-Flow Formulation of the N-camera Stereo Correspondence Problem – Sebastien Roy, Ingemar Cox - 1998
782 Cognitive networks – R W Thomas, L A DaSilva, A B MacKenzie - 2005