A stereo matching algorithm based on multiresolution and epipolar constraint

Stereo matching is one of the most active research areas in computer vision. In this paper, a fast stereo matching algorithm by means of epipolar constraint and multiresolution approach was presented. The searching scope of corresponding pixels in the original image is obtained and has diminished a lot based on multiresolution approach. Then intensity correlation principle and epipolar constraint can be applied to get the stereo matching results in this scope. In this way, we reduce the search time for correspondence and ensure the validity of matching. The experimental results show this algorithm is effective and efficient.

[1]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[2]  D. Scharstein,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001).

[3]  Bernhard P. Wrobel,et al.  Multiple View Geometry in Computer Vision , 2001 .

[4]  Takeo Kanade,et al.  A Cooperative Algorithm for Stereo Matching and Occlusion Detection , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  M. J. Hannah.  A system for digital stereo image matching , 1989 .

[6]  Olga Veksler,et al.  Fast variable window for stereo correspondence using integral images , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[7]  Christopher G. Harris,et al.  A Combined Corner and Edge Detector , 1988, Alvey Vision Conference.