Hybrid correlation algorithms, a bridge between feature matching and image correlation
Expert InsightsPublished 1979
Up to the present time there have been two basic classes of map matching algorithms--those based on feature matching techniques and those based on image correlation. This paper describes a new class of hybrid correlation algorithms which incorporate features as an integral part of the matching process. These algorithms can be implemented such that it is not necessary to extract features from the sensed image. The paper concludes by showing the domains in which each class of matching algorithm (feature matching, image correlation, and hybrid algorithm) is most appropriate.
Document Details
- Copyright: RAND Corporation
- Availability: Web Only
- Year: 1979
- Pages: 20
- Document Number: P-6418
Citation
RAND Style Manual
Chicago Manual of Style
This publication is part of the RAND paper series. The paper series was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.