DocumentCode :
1724117
Title :
Collinear trinocular stereo using two-level dynamic programming
Author :
Ohta, Yuichi ; Yamamoto, Takehiko ; Ikeda, Katsuo
Author_Institution :
Inst. of Inf. Sci. & Electron., Tsukuba Univ., Ibaraki, Japan
fYear :
1988
Firstpage :
658
Abstract :
An almost occlusion-free trinocular stereo algorithm is described. It can cope with the occlusion problem when trying to obtain depth data of good accuracy by using a long stereo baseline. A third camera located midway between a pair of stereo cameras is used for the purpose. A correspondence search algorithmbased on two-level dynamic programming was developed to obtain an optimal correspondence among the three images. Experiments showed the validity of the algorithm
Keywords :
computer vision; computerised pattern recognition; computerised picture processing; dynamic programming; almost occlusion-free trinocular stereo algorithm; collinear trinocular stereo vision; computer vision; correspondence search algorithm; depth data; long stereo baseline; optimal correspondence; pattern recognition; picture processing; two-level dynamic programming; Cameras; Dynamic programming; Image sequences; Layout; Lenses; Stereo vision;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pattern Recognition, 1988., 9th International Conference on
Conference_Location :
Rome
Print_ISBN :
0-8186-0878-1
Type :
conf
DOI :
10.1109/ICPR.1988.28320
Filename :
28320
Link To Document :
بازگشت