Occlusions and binocular stereo
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
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Vision for Mobile Robot Navigation: A Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Cooperative Algorithm for Stereo Matching and Occlusion Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Stereo with Multiple Windowing
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
High-accuracy stereo depth maps using structured light
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
A similarity measure for stereo feature matching
IEEE Transactions on Image Processing
A New Selective Confidence Measure---Based Approach for Stereo Matching
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Robotics and Autonomous Systems
Hi-index | 0.00 |
We propose a new approach to stereo matching for obstacle detection in the autonomous navigation framework. An accurate but slow reconstruction of the 3D scene is not needed; rather, it is more important to have a fast localization of the obstacles to avoid them. All the methods in the literature, based on a punctual stereo matching, are ineffective in realistic contexts because they are either computationally too expensive, or unable to deal with the presence of uniform patterns, or of perturbations between the left and right images. Our idea is to face the stereo matching problem as a matching between homologous regions. The stereo images are represented as graphs and a graph matching is computed to find homologous regions. Our method is strongly robust in a realistic environment, requires little parameter tuning, and is adequately fast, as experimentally demonstrated in a comparison with the best algorithms in the literature.