By Topic

A parallel algorithm for incremental stereo matching on SIMD machines

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
$33 $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

2 Author(s)
A. F. Laine ; Dept. of Comput. Sci., Washington Univ., St. Louis, MO, USA ; G. -C. Roman

A parallel algorithm for stereo matching that achieves high speed by exploiting the parallel architectures of typical single-instruction multiple-data (SIMD) processors is presented. The approach is based on several existing techniques dealing with the classification and evaluation of matches, the application of ordering constraints, and relaxation-based matching. The techniques have been integrated and reformulated in terms of parallel execution on a theoretical SIMD machine. Feasibility is demonstrated by implementation on a commercially available SIMD machine. An ideal machine, operating at 60 Hz, can accomplish stereo matching in 1.5 s using 88 machine cycles. On the commercial machine, stereo matching was achieved in 13.5 s using 404 cycles

Published in:

Pattern Recognition, 1990. Proceedings., 10th International Conference on  (Volume:ii )

Date of Conference:

16-21 Jun 1990