FAST AND AUTOMATIC STEREO VISION MATCHING ALGORITHM-BASED ON DYNAMIC-PROGRAMMING METHOD

Authors
BENSRHAIR A MICHE P DEBRIE R
Citation
A. Bensrhair et al., FAST AND AUTOMATIC STEREO VISION MATCHING ALGORITHM-BASED ON DYNAMIC-PROGRAMMING METHOD, Pattern recognition letters, 17(5), 1996, pp. 457-466
Citations number
10
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Artificial Intelligence
Journal title
Pattern recognition letters → ACNP
ISSN journal
01678655
Volume
17
Issue
5
Year of publication
1996
Pages
457 - 466
Database
ISI
SICI code
0167-8655(1996)17:5<457:FAASVM>2.0.ZU;2-N
Abstract
We consider that the matching problem in a stereo vision process can b e treated as the problem of finding an optimal path on a two-dimension al (2D) search plane. To obtain this path, we consider a non-linear ga in function which varies as a function of threshold values calculated during the preliminary statistical analysis of the right and left imag es.