Search Results for author:
Found 1 papers, 0 papers with code
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
