A New Binocular Vision Stereo Matching Algorithm

Article Preview

Abstract:

With the shortcomings of the large data amount and long time consuming in the conventional binocular vision stereo matching algorithm, a new fast stereo matching algorithm is presented in this paper. It is fast computed based on the line moments and angle vector .Firstly, the method detects image edge using canny operator, and finds the target objects according line moments, then the object contours feature points are extracted. Finally, using angle vector to realize the corresponding pixel matching in the left and right image .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:

721-725

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] D. Scharstein, R. Szeliski: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms, IJCV 47(2002), pp.7-42.

DOI: 10.1109/smbv.2001.988771

Google Scholar

[2] L. Zhang, D. Wang, and A. Vincent: IEEE Trans. Circuits Syst. Video Technol., Vol. 16, (2006).

Google Scholar

[3] Y. Furukawa and J. Ponce, IEEE Trans. Pattern Anal. Mach. Intell. , vol. 32, (2010).

Google Scholar

[4] A. Hosni, M. Bleyer, M. Gelautz, and C. Rhemann, Lo-cal stereo matching using geodesic support weights, in ICIP, (2009).

DOI: 10.1109/icip.2009.5414478

Google Scholar

[5] M. Humenberger, C. Zinner, M. Weber, W. Kubinger, and M. Vincze: A fast stereo matching algorithm suit-able for embedded real-time systems, Computer Visionand Image Understanding, vol. 114, ( 2010).

DOI: 10.1016/j.cviu.2010.03.012

Google Scholar

[6] Information on http: /www. vision. middlebury. edu/stereo.

Google Scholar