A Fast Algorithm for Stereo Matching

Stereo matching is a useful method to obtain the 3-dimensional (3-D) depth information from a pair of images. In this paper, we first transform the stereo matching problem into a banded cyclic string-to-string correction (BCSTSC) problem. Then a brute-force algorithm, which runs in O(nmd) time, is described, where n and m are the lengths of the two given feature strings and d is the disparity. Further, an improved O(nm log d)-time algorithm for solving the BCSTSC problem is presented. Our result generalizes Maes's result (1990) since the special version of the BCSTSC problem can be transformed into the cyclic string-to-string correction problem when setting d = m.

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

[2]  D Marr,et al.  Cooperative computation of stereo disparity. , 1976, Science.

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

[4]  Dana H. Ballard,et al.  Computer Vision , 1982 .

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

[6]  Bernard Dubuisson,et al.  String matching for stereo vision , 1989, Pattern Recognit. Lett..

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

[8]  Wojciech Rytter,et al.  Text Algorithms , 1994 .

[9]  M. Maes,et al.  On a Cyclic String-To-String Correction Problem , 1990, Inf. Process. Lett..

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

[11]  KUO-LIANG CHUNG,et al.  A Generalized Mapping of 2-d Array Processor to Linear Array Processor and its Applications , 1995, Parallel Algorithms Appl..