Fast and automatic stereo vision matching algorithm based on dynamic programming method
作者： A. Bensrhair , P. Miché , R. Debrie
DOI: 10.1016/0167-8655(96)00004-9
关键词:
摘要: We consider that the matching problem in a stereo vision process can be treated as of finding an optimal path on two-dimensional (2D) search plane. To obtain this path, we non-linear gain function which varies threshold values calculated during preliminary statistical analysis right and left images.
elsevier.com
sci-hub.se 参考文章(5)
Roland Debrie, Pierre Miché, Fast and self-adaptive image segmentation using extended declivity Annales Des Télécommunications. ,vol. 50, pp. 401- 410 ,(1995) , 10.1007/BF02999740
Y.F. Wu, H. Maitre, A new dynamic programming method for stereo vision ignoring epipolar geometry international conference on pattern recognition. pp. 146- 148 ,(1988) , 10.1109/ICPR.1988.28191
H. Harlyn Baker, Thomas O. Binford, Depth from edge and intensity based stereo international joint conference on artificial intelligence. pp. 631- 636 ,(1981)
Shing-Huan Lee, Jin-Jang Leou, A dynamic programming approach to line segment matching in stereo vision Pattern Recognition. ,vol. 27, pp. 961- 986 ,(1994) , 10.1016/0031-3203(94)90138-4
Yuichi Ohta, Takeo Kanade, Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. PAMI-7, pp. 139- 154 ,(1985) , 10.1109/TPAMI.1985.4767639