Fast-Match: Fast Affine Template Matching

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 smoothn...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer vision Vol. 121; no. 1; pp. 111 - 125
Main Authors: Korman, Simon, Reichman, Daniel, Tsur, Gilad, Avidan, Shai
Format: Journal Article
Language:English
Published: New York Springer US 01.01.2017
Springer
Springer Nature B.V
Subjects:
Affine transformations
Algorithms
Analysis
Approximation
Artificial Intelligence
Computer Imaging
Computer Science
Computer vision
Errors
Experiments
Image Processing and Computer Vision
Image processing systems
Mathematical analysis
Pattern Recognition
Pattern Recognition and Graphics
Studies
Template matching
Transformations
Vision
Image matching
Template matching
Sublinear algorithms
Pattern matching
ISSN:0920-5691, 1573-1405
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 transformation, we approximate the SAD error using a sublinear algorithm that randomly examines only a small number of pixels. We further accelerate the algorithm using a branch-and-bound-like scheme. As images are known to be piecewise smooth, the result is a practical affine template matching algorithm with approximation guarantees, that takes a few seconds to run on a standard machine. We perform several experiments on three different datasets, and report very good results.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0920-5691
1573-1405
DOI:10.1007/s11263-016-0926-1