International Journal of Computer Vision
Stereo Without Epipolar Lines: A Maximum-Flow Formulation
International Journal of Computer Vision - Special issue on computer vision research at NEC Research Institute
Depth Discontinuities by Pixel-to-Pixel Stereo
International Journal of Computer Vision
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift: A Robust Approach Toward Feature Space Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to Algorithms
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Occlusions and Binocular Stereo
ECCV '92 Proceedings of the Second European Conference on Computer Vision
Efficient Stereo with Multiple Windowing
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Advances in Computational Stereo
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Stereo Matching Using Reliability-Based Dynamic Programming and Consistency Constraints
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast variable window for stereo correspondence using integral images
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Hi-index | 0.00 |
In this paper we propose a new segment-based stereo matching algorithm using scene hierarchical structure. In particular, we highlight a previously overlooked geometric fact: the most foreground objects can be easily detected by intensity-based cost function and the farer objects can be matched using local occlusion model constructed by former recognized objects. Then the scene structure is achieved from foreground to background. Two occlusion relations are proposed to establish occlusion model and to update cost function. Image segmentation technique is adopted to increase algorithm efficiency and to decrease discontinuity of disparity map. Experiments demonstrate that the performance of our algorithm is among the state of the art stereo algorithms on various data sets.