String matching for stereo vision

Abstract In this paper, we present a new approach to the problem of stereo matching essentially based on the comparison of two strings. This stereo matching process consists of two parts: first the Global Matching, which deals with the vertical columns, provides an interval; secondly, the Local Matching works between the horizontal epipolar lines to find the corresponding point precisely in this interval. We also propose a method to rectify the error of the calibration.

[1]  Jake K. Aggarwal,et al.  Positioning three-dimensional objects using stereo images , 1987, IEEE J. Robotics Autom..

[2]  Gérard G. Medioni,et al.  Detection of Intensity Changes with Subpixel Accuracy Using Laplacian-Gaussian Masks , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Berthold K. P. Horn Robot vision , 1986, MIT electrical engineering and computer science series.

[4]  Jake K. Aggarwal,et al.  FINDING RANGE FROM STEREO IMAGES. , 1985 .

[5]  Tomaso Poggio,et al.  Cooperative computation of stereo disparity , 1988 .

[6]  S. A. Lloyd Stereo matching using intra- and inter-row dynamic programming , 1986, Pattern Recognit. Lett..

[7]  W. Eric L. Grimson,et al.  Computational Experiments with a Feature Based Stereo Algorithm , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[9]  E. R. Haddow,et al.  A parallel binocular stereo algorithm utilizing dynamic programming and relaxation labelling , 1987 .

[10]  Tomaso Poggio,et al.  A Theory of Human Stereo Vision , 1977 .

[11]  D Marr,et al.  Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

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

[13]  Ramakant Nevatia,et al.  Segment-based stereo matching , 1985, Comput. Vis. Graph. Image Process..

[14]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.