Occlusions and binocular stereo
International Journal of Computer Vision
A maximum likelihood stereo algorithm
Computer Vision and Image Understanding
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Occlusions, Discontinuities, and Epipolar Lines in Stereo
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Multi-camera Scene Reconstruction via Graph Cuts
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Efficient graph-based energy minimization methods in computer vision
Efficient graph-based energy minimization methods in computer vision
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Advances in Computational Stereo
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stereo vision for robotic applications in the presence of non-ideal lighting conditions
Image and Vision Computing
Robotics and Autonomous Systems
A 2-point algorithm for 3D reconstruction of horizontal lines from a single omni-directional image
Pattern Recognition Letters
Learning image structures for optimizing disparity estimation
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part III
Hi-index | 0.00 |
The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However, the majority of these methods are known to be computationally expensive requiring minutes of computation. In this paper, we propose a fast minimisation scheme that produces high quality stereo reconstructions for significantly reduced running time, requiring only a few seconds of computation. The minimisation scheme is carried out using our iterated dynamic programming algorithm, which iterates over entire rows and columns for fast stereo matching. A quadtree subregioning process is also used for efficient computation of a matching cost volume where iterated dynamic programming operates on.