Fast stereo vision algorithm for robotic applications

Autonomous navigation applications demand sensors with a low sample time to be able to increase speed. We have developed a stereo vision algorithm, capable to deliver dense disparity maps for single, high-resolution scanlines at high speed (40 ms/line), even for wide disparity ranges. We have tested the algorithm with synthetic and real images. Our algorithm is based on a dynamic programming schema with a cost function based on a weighted sum of squared intensify errors. Weight factors are based on gradient values. The algorithm includes explicitly detection of occlusion. Occlusion cost changes dynamically depending on gradient values of matched points.

[1]  R. Bellman Dynamic programming. , 1957, Science.

[2]  Ingemar J. Cox,et al.  Stereo Without Disparity Gradient Smoothing: a Bayesian Sensor Fusion Solution , 1992 .

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

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

[5]  Joachim M. Buhmann,et al.  Real-time phase-based stereo for a mobile robot , 1996, Proceedings of the First Euromicro Workshop on Advanced Mobile Robots (EUROBOT '96).

[6]  Ingemar J. Cox,et al.  A maximum likelihood N-camera stereo algorithm , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[7]  Ingemar J. Cox,et al.  A Maximum Likelihood Stereo Algorithm , 1996, Comput. Vis. Image Underst..

[8]  Joachim M. Buhmann,et al.  Regularizing phase-based stereo , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[9]  Alan L. Yuille,et al.  Occlusions and Binocular Stereo , 1992, ECCV.

[10]  Aaron F. Bobick,et al.  Disparity-Space Images and Large Occlusion Stereo , 1994, ECCV.

[11]  Daniel Scharstein,et al.  Matching images by comparing their gradient fields , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[12]  David Mumford,et al.  A Bayesian treatment of the stereo correspondence problem using half-occluded regions , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.