A Fast Binocular Vision Stereo Matching Algorithm

Article Preview

Abstract:

In this paper we present a fast indoor stereo matching algorithm based on canny edge detection and line moments. We first detect image edge by using Canny operator, then find the target objects according line moments, the feature points of the objects’ contours are extracted. Finally, matching the pixel in stereo image pair according the angle vector. The algorithm effectively reduces the computational complexity, computational cost is decreased greatly. The experimental results show that the algorithm is possible and valid.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3735-3738

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] L. Zhang, D. Wang, and A. Vincent: Adaptive Reconstruction of Intermediate Views from Stereoscopic Images, IEEE Trans. Circuits Syst. Video Technol. Vol. 16 (2006), p.102.

DOI: 10.1109/tcsvt.2005.857785

Google Scholar

[2] D. Scharstein, R. Szeliski: A Taxonomy and Evaluation of Dense Two-frame Sereo Correspondence Algorithms. IJCV 47 (2002), p.7.

Google Scholar

[3] H. Zhang, L. T. Zhang, L. Wang: A New Binocular Vision Stereo Matching Algorithm, Applied Mechanics and Materials . Vol. 389(2013), p.721.

DOI: 10.4028/www.scientific.net/amm.389.721

Google Scholar

[4] Lowe D. G: Distinctive Image Features from Scale-invariant Keypoints, International Journal of Computer Vision, Vol. 60 (2) 2004, p.91.

DOI: 10.1023/b:visi.0000029664.99615.94

Google Scholar

[5] L. Zhang: A Fast Stereo Matching Algorithm for Stereoscopic Intermediate View Reconstruction, in Proc. IEE Eur. Conf. Visual Media Production. Nov. (2005).

Google Scholar