FasT-Match: Fast Affine Template Matching
International Journal of Computer Vision, Volume 121, Issue 1, 2017, Pages 111-125.
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 tra...More
PPT (Upload PPT)