Share Email Print

Proceedings Paper

Merit maximization approach to binocular vision using dynamic programming
Author(s): Suya ok You; Jian Liu; Faguang Wan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, wp cast stereo matching as a problem in merit maximization. This is achieved by the formulation of a merit function which influence the similarity between primitives in the right and left images and the mutual dependency between primitives. Stereo matching are done by finding the "best" paths that maximize the merit function. This is handled by using dynamic programming technique. With this algorithm, a global optimum matching can be obtained. We give a mathematical description for the merit function and the algorithm has been implemented. The experimental results are presented to show the efficacy of the proposed stereo matching method.

Paper Details

Date Published: 12 January 1993
PDF: 6 pages
Proc. SPIE 1771, Applications of Digital Image Processing XV, (12 January 1993); doi: 10.1117/12.139105
Show Author Affiliations
Suya ok You, Huazhong Univ. of Science and Technology (China)
Jian Liu, Huazhong Univ. of Science and Technology (China)
Faguang Wan, Huazhong Univ. of Science and Technology (China)

Published in SPIE Proceedings Vol. 1771:
Applications of Digital Image Processing XV
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top