12 January 1993 Merit maximization approach to binocular vision using dynamic programming
Author Affiliations +
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.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Suya ok You, Suya ok You, Jian Liu, Jian Liu, Faguang Wan, Faguang Wan, } "Merit maximization approach to binocular vision using dynamic programming", Proc. SPIE 1771, Applications of Digital Image Processing XV, (12 January 1993); doi: 10.1117/12.139105; https://doi.org/10.1117/12.139105
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT

Relationship between 3D flight route and terrain
Proceedings of SPIE (September 24 1998)
A Faint Galaxy Counting System
Proceedings of SPIE (November 20 1980)
Programmable Image Processing Element
Proceedings of SPIE (July 22 1982)

Back to Top