A Maximum-Flow Formulation of the N-camera Stereo Correspondence Problem (1998)

Cached

Download Links

by Sebastien Roy , Ingemar Cox
Citations:192 - 3 self

Documents Related by Co-Citation

123 Markov random fields with efficient approximations – Yuri Boykov, Olga Veksler, Ramin Zabih - 1998
905 Fast approximate energy minimization via graph cuts – Yuri Boykov, Olga Veksler, Ramin Zabih - 2001
233 Exact maximum a posteriori estimation for binary images – D Greig, B Porteous, A Seheult - 1989
76 Segmentation by Grouping Junctions – Hiroshi Ishikawa, Davi Geiger - 1998
3012 Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images – S Geman, D Geman - 1984
81 Occlusions, discontinuities, and epipolar lines in stereo – Hiroshi Ishikawa, Davi Geiger - 1998
708 A taxonomy and evaluation of dense two-frame stereo correspondence algorithms – Daniel Scharstein, Richard Szeliski - 2002
363 A theory of shape by space carving – Kiriakos N. Kutulakos, Steven M. Seitz - 1999
35 An experimental comparison of stereo algorithms – Richard Szeliski, Ramin Zabih - 1999
215 Computational vision and regularization theory – T Poggio, V Torre, C Koch - 1985
195 Computing Visual Correspondence with Occlusions using Graph Cuts – Vladimir Kolmogorov, et al.
622 Flows in Networks – L R Ford, D R Fulkerson - 1962
471 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision – Yuri Boykov, Vladimir Kolmogorov - 2001
103 Object-Centered Surface Reconstruction: Combining Multi-Image Stereo and Shading – P. Fua, Y.G. Leclerc - 1995
621 Visual reconstruction – Andrew Blake, Andrew Zisserman - 1987
10 Fast approximate maximum a posteriori restoration of multicolour images – P A Ferrari, A Frigessi, P de SB - 1995
63 Exact Voxel Occupancy with Graph Cuts – Dan Snow, Paul Viola, Ramin Zabih - 2000
305 Markov Random Field Models in Computer Vision – S. Z. Li - 1994
106 Occlusions and Binocular Stereo – David Geiger, Davi Geiger, Bruce Ladendorf, Alan Yuille - 1995