A Parallel Algorithm for Incremental Stereo Matching on SIMD Machines

Authors

Andrew F. Laine, Washington University in St Louis
Gruia-Catalin Roman, Washington University in St Louis

Document Type

Technical Report

Publication Date

1990-04-01

Filename

WUCS-90-15.pdf

Technical Report Number

WUCS-90-15

Abstract

Previous matching algorithms have achieved high speeds through algorithm simplification and/or relied on custom hardware. The objective of our work has been the development a robust high-speed stereo matcher by exploiting parallel algorithms executing on general purpose SIMD machines. Our 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 the theoretical SIMD machine. Feasibility is demonstrated by implementation on a commercially available SIMD machine. Its performance is compared with that of the idealized machine.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7Z036JQ

Recommended Citation

Laine, Andrew F. and Roman, Gruia-Catalin, "A Parallel Algorithm for Incremental Stereo Matching on SIMD Machines" Report Number: WUCS-90-15 (1990). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/690