`Region-growing' algorithm for matching of terrain images
Image and Vision Computing
A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Using Real-Time Stereo Vision for Mobile Robot Navigation
Autonomous Robots
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
3D Object Recognition Using Segment-Based Stereo Vision
ACCV '98 Proceedings of the Third Asian Conference on Computer Vision-Volume II
A Quasi-Dense Approach to Surface Reconstruction from Uncalibrated Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape and the Stereo Correspondence Problem
International Journal of Computer Vision
Towards Urban 3D Reconstruction from Video
3DPVT '06 Proceedings of the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)
Hi-index | 0.00 |
In this paper, we present an algorithm for estimating disparity for images containing large textureless regions. We propose a fast and efficient region growing algorithm for estimating the stereo disparity. Though we present results on ice images, the algorithm can be easily used for other applications. We modify the first-best region growing algorithm using relaxed uniqueness constraints and matching for sub-pixel values and slant surfaces. We provide an efficient method for matching multiple windows using a linear transform. We estimate the parameters required by the algorithm automatically based on initial correspondences. Our method was tested on synthetic, benchmark and real outdoor data. We quantitatively demonstrated that our method performs well in all three cases.