Fast-Match: Fast Affine Template Matching

Korman, S; Reichman, D; Tsur, G; Avidan, S

Korman, S (reprint author), Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90024 USA.; Korman, S (reprint author), Tel Aviv Univ, Tel Aviv, Israel.

INTERNATIONAL JOURNAL OF COMPUTER VISION, 2017; 121 (1): 111

Abstract

Fast-Match is a fast algorithm for approximate template matching under 2D affine transformations that minimizes the Sum-of-Absolute-Differences (SAD) ......

Full Text Link