Referenced Items are not available for this document.
An effort has been made to develop a robust high-speed stereo matcher by exploiting parallel algorithms executing on general-purpose SIMD machines. This 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. An ideal machine topology for executing this parallel algorithm is identified through complexity analysis. Feasibility is demonstrated by implementation on a commercially available SIMD machine, and its performance is compared with that of the idealized machine. Sample results are shown for real and synthetic stereo pairs
Published in:
Robotics and Automation, IEEE Transactions on
(Volume:7
,
Issue:
1
)
Date of Publication: Feb 1991
- Page(s):
- 123 - 134
- ISSN :
- 1042-296X
- INSPEC Accession Number:
- 3883251
- Digital Object Identifier :
- 10.1109/70.68076
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Feb 1991
- Sponsored by :
- IEEE Robotics and Automation Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
