Stereo Matching Algorithm Based on Pyramid Double Dynamic Programming

Article Preview

Abstract:

A stereo matching algorithm was proposed based on pyramid algorithm and dynamic programming. High and low resolution images was computed by pyramid algorithm, and then candidate control points were stroke on low-resolution image, and final control points were stroke on the high-resolution images. Finally, final control points were used in directing stereo matching based on dynamic programming. Since the striking of candidate control points on low-resolution image, the time is greatly reduced. Experiments show that the proposed method has a high matching precision.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

352-355

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Velianki Pratibha, Khambete Madhuri. International Journal of Computer Science Issues, 2011, 8(3): 483-486.

Google Scholar

[2] DeMaeztu Leonardo, Mattoccia Stefano, Villanueva, Arantxa, Cabeza Rafael. Proceeding of the IEEE International Conference on Computer Vision, 2011, 1708-1715.

Google Scholar

[3] Ohta Y and Kanade T. IEEE Trans on Pattern Analysis and Machine Intelligence, PAMI, 1985, vol. 7, no. 2, pp.139-154.

Google Scholar

[4] Stephen S. Intille and Aaron F. Bobick. Disparity-space images and large occlusion stereo[A]. In: ECCV, 1994: 179-186.

DOI: 10.1007/bfb0028349

Google Scholar