By Topic

An algorithm for parallel stereo matching based on dynamic programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yang, J.A. ; Inst. of Artificial Intelligence, Hefei Univ. of Technol., China

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

Published in:

Systems, Man, and Cybernetics, 1996., IEEE International Conference on  (Volume:1 )

Date of Conference:

14-17 Oct 1996