dynamic programming;
stereo vision;
regularization;
distance between strings;
string matching;
D O I:
10.1016/S0167-8655(97)00022-6
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
We present a new algorithm for solving the stereo vision matching problem by using dynamic programming. Edge pixels extracted from two images are matched and a dense disparity map is obtained by filling in the spaces between two consecutive edge pixels. (C) 1997 Elsevier Science B.V.
引用
收藏
页码:385 / 393
页数:9
相关论文
共 7 条
[1]
BOLLES, 1993, P IM UND WORKSH, P263
[2]
COX IJ, 1992, STEREO REGULARIZATIO
[3]
Fua P., 1993, Machine Vision and Applications, V6, P35, DOI 10.1007/BF01212430