An algorithm for parallel stereo matching based on dynamic programming

Author

Yang, J.A.

Author_Institution

Inst. of Artificial Intelligence, Hefei Univ. of Technol., China

Volume

1

fYear

1996

fDate

14-17 Oct 1996

Firstpage

636

Abstract

This paper proposes an algorithm for parallel stereo matching based on dynamic programming and presents a massively parallel implementation of this algorithm. Our implementation can use many processors per scanline, compared to a naive approach of one processor per scanline. This is important because typical images contain 256 to 1024 scanlines, while massively parallel machines can have many more processors. We also introduce a method of handing inter-scanline inconsistencies that is very well suited for parallel implementation. The method only increases the total amount of processing needed to solve the stereo matching problem by a small fraction. A parallel implementation of both the dynamic programming algorithm and the inter-scanline inconsistency correction algorithm are fully discussed

Keywords

computer vision; dynamic programming; image matching; parallel processing; stereo image processing; Connection Machine; dynamic programming; inter-scanline inconsistency; massively parallel processing; single instruction multiple data; stereo image matching; stereo vision; Artificial intelligence; Cameras; Computer vision; Dynamic programming; Humans; Image edge detection; Image segmentation; Parallel machines; Parallel programming; Stereo vision;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 1996., IEEE International Conference on

Conference_Location

Beijing

ISSN

1062-922X

Print_ISBN

0-7803-3280-6

Type

conf

DOI

10.1109/ICSMC.1996.569868

Filename

569868