Fast-Match: Fast Affine Template Matching
Fast-Match: Fast Affine Template Matching
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
Fast-Match is a fast algorithm for approximate template matching under 2D affine transformations that minimizes the Sum-of-Absolute-Differences (SAD) error measure. There is a huge number of transformations to consider but we prove that they can be sampled using a density that depends on the smoothness of the image. For each potential transformatio...
Alternative Titles
Full title
Fast-Match: Fast Affine Template Matching
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1879987093
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1879987093
Other Identifiers
ISSN
0920-5691
E-ISSN
1573-1405
DOI
10.1007/s11263-016-0926-1
