Fast and automatic stereo vision matching algorithm based on dynamic programming method

We consider that the matching problem in a stereo vision process can be treated as the problem of finding an optimal path on a two-dimensional (2D) search plane. To obtain this path, we consider a non-linear gain function which varies as a function of threshold values calculated during the preliminary statistical analysis of the right and left images.

[1]  Jin-Jang Leou,et al.  A dynamic programming approach to line segment matching in stereo vision , 1994, Pattern Recognit..

[2]  Takeo Kanade,et al.  Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Thomas O. Binford,et al.  Depth from Edge and Intensity Based Stereo , 1981, IJCAI.

[4]  Pierre Miché,et al.  Fast and self-adaptive image segmentation using extended declivity , 1995 .

[5]  Henri Maître,et al.  A new dynamic programming method for stereo vision ignoring epipolar geometry , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.