Finding the Largest Unambiguous Component of Stereo Matching
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Catadioptric Omnidirectional Camera
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
ICPR '96 Proceedings of the 1996 International Conference on Pattern Recognition (ICPR '96) Volume I - Volume 7270
Computing Visual Correspondence with Occlusions via Graph Cuts
Computing Visual Correspondence with Occlusions via Graph Cuts
Omnidirectional Stereo Vision with a Hiperbolic Double Lobed Mirror
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Efficient Belief Propagation for Early Vision
International Journal of Computer Vision
A versatile method for omnidirectional stereo camera calibration based on BP algorithm
ISNN'06 Proceedings of the Third international conference on Advnaces in Neural Networks - Volume Part II
Image and Vision Computing
Hi-index | 0.00 |
We present a method to obtain dense 3D maps for a mobile robot that is equipped with a novel omnidirectional stereo vision sensor. The vision sensor is composed of a perspective camera and two hyperbolic mirrors. Once the system has been calibrated and two image points respectively projected by upper and nether mirrors are matched, the 3D coordinate of the space point can be acquired by means of triangulation. To satisfy the reliability requirement by mobile robot navigation, we use high-quality stereo matching algorithm - the graph cut method. An initial depth map can be calculated using efficient dynamic programming technique. With a relatively good initial map, the process of graph cut converges quickly. We also show the necessary modification to handle panoramic images, including deformed matching template, adaptable template scale. Experiment shows that this proposed vision system is feasible as a practical stereo sensor for accurate 3D map generation.