Rotation Invariant Template Matching
Kimmo Fredriksson · Työväentutkimus Vuosikirja · 2001
In rotation invariant template matching one wants to find nding from the given input image the locations that are similar to the given pattern template, so that the pattern may have any orientation. Template matching is an old but important problem in computer vision and pattern recognition, and thus there have also been many attempts to solve it. Most of the most successful solutions so far come from the signal processing community, based on fast computation of cross correlation or correlation coefficient. The existing combinatorial approaches have ignored the template rotations. This thesis fills in this gap by presenting the rst rotation invariant combinatorial template matching algorithms. The thesis