𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for stereo matching

✍ Scribed by Kuo-Liang Chung

Book ID
104137436
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
426 KB
Volume
63
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

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 0( nm log &-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. @

πŸ“œ SIMILAR VOLUMES

Fast and Robust Stereo Matching Algorith
Fast and Robust Stereo Matching Algorithms for Mining Automation
✍ Jasmine Banks; Mohammed Bennamoun; Peter Corke πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 184 KB

The mining environment, being complex, irregular, and time-varying, presents a challenging prospect for stereo vision. For this application, speed, reliability, and the ability to produce a dense depth map are of foremost importance. This paper evaluates a number of matching techniques for possible