Introduction to algorithms
Three-dimensional computer vision: a geometric viewpoint
Three-dimensional computer vision: a geometric viewpoint
Multilevel enhancement and detection of stereo disparity surfaces
Artificial Intelligence - Special volume on computer vision
A maximum likelihood stereo algorithm
Computer Vision and Image Understanding
A Bayesian approach to binocular stereopsis
International Journal of Computer Vision
A Stereo Machine for Video-Rate Dense Depth Mapping and Its New Applications
CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
Segmentation by Grouping Junctions
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
An Active Multibaseline Stereo System with Real-Time Image Acquisition
An Active Multibaseline Stereo System with Real-Time Image Acquisition
Depth from edge and intensity based stereo
Depth from edge and intensity based stereo
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques
International Journal of Computer Vision
Dense Features for Semi-Dense Stereo Correspondence
International Journal of Computer Vision
What Energy Functions Can Be Minimized via Graph Cuts?
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Multi-camera Scene Reconstruction via Graph Cuts
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Surface Reconstruction Method Using Global Graph Cut Optimization
International Journal of Computer Vision
Accurate and Scalable Surface Representation and Reconstruction from Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stereo Correspondence with Occlusion Handling in a Symmetric Patch-Based Graph-Cuts Model
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast image blending using watersheds and graph cuts
Image and Vision Computing
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
International Journal of Computer Vision
Robust Surface Fitting from Two Views using Restricted Correspondence
Journal of Mathematical Imaging and Vision
A new approach for stereo matching in autonomous mobile robot applications
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
PCS'09 Proceedings of the 27th conference on Picture Coding Symposium
Mitral annulus segmentation from three-dimensional ultrasound
ISBI'09 Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro
A portable stereo vision system for whole body surface imaging
Image and Vision Computing
Stereo vision for obstacle detection: a graph-based approach
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Total absolute Gaussian curvature for stereo prior
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Non-rigid image registration of brain magnetic resonance images using graph-cuts
Pattern Recognition
Fast and robust semi-local stereo matching using possibility distributions
International Journal of Computational Vision and Robotics
Hierarchical stereo matching: from foreground to background
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Exact optimization of discrete constrained total variation minimization problems
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
A fast line segment based dense stereo algorithm using tree dynamic programming
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
Rethinking the prior model for stereo
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
Recent methods for reconstructing surfaces from multiple images
IWMM'04/GIAE'04 Proceedings of the 6th international conference on Computer Algebra and Geometric Algebra with Applications
A noise-driven paradigm for solving the stereo correspondence problem
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Using normal vectors for stereo correspondence construction
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Concurrent stereo matching: an image noise-driven model
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Two-frame stereo photography in low-light settings: a preliminary study
Proceedings of the 9th European Conference on Visual Media Production
| Hi-index | 0.00 |
This paper describes a new algorithm for solving the stereocorrespondence problem with a global 2-d optimizationby transforming it into a maximum-flowproblem in a graph. This transformation effectively removes explicit useof epipolar geometry, thus allowing direct use ofmultiple cameras with arbitrary geometries. The maximum-flow, solved both efficiently and globally, yieldsa minimum-cut that corresponds toa disparity surface for the whole image at once. This global and efficient approach to stereo analysis allowsthe reconstruction to proceed in an arbitrary volume ofspace and provides a more accurateand coherent depth map than the traditional stereo algorithms. In particular, smoothness is applied uniformly instead of only along epipolar lines, while the global optimality of the depth surface is guaranteed. Results show improved depth estimation as well as better handlingof depth discontinuities. While the worst case running time isO(n^1.5 d^1.5 log(nd)), the observed average running time isO(n^1.2 d^1.3) for an image size of n pixels and depth resolution d.