Introduction - If you have any usage issues, please Google them yourself
Fast-Match is a fast algorithm for approximate tem-
plate matching under 2D affine transformations that min-
imizes the Sum-of-Absolute-Differences (SAD) error mea-
sure. 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 poten-
tial transformation, we approximate the SAD error using a
sublinear algorithm that randomly examines only a small
number of pixels.