Sciweavers

Share
907 search results - page 1 / 182
» An Experimental Comparison of Stereo Algorithms
Sort
View
ICCVW
1999
Springer
10 years 3 months ago
An Experimental Comparison of Stereo Algorithms
While many algorithms for computing stereo correspondence have been proposed, there has been very little work on experimentally evaluating algorithm performance, especially using r...
Richard Szeliski, Ramin Zabih
EMMCVPR
2001
Springer
10 years 4 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
ECCV
2006
Springer
11 years 1 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother
CVPR
2006
IEEE
10 years 5 months ago
A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms
This paper presents a quantitative comparison of several multi-view stereo reconstruction algorithms. Until now, the lack of suitable calibrated multi-view image datasets with kno...
Steven M. Seitz, Brian Curless, James Diebel, Dani...
CVPR
2008
IEEE
11 years 1 months ago
Classification and evaluation of cost aggregation methods for stereo correspondence
In the last decades several cost aggregation methods aimed at improving the robustness of stereo correspondence within local and global algorithms have been proposed. Given the re...
Federico Tombari, Stefano Mattoccia, Luigi di Stef...
books