Rotation and Lighting Invariant Template Matching
Kimmo Fredriksson, Veli Mäkinen and Gonzalo Navarro
We address the problem of searching for a two-dimensional pattern in a two-dimensional
text (or image), such that the pattern can be found even if it appear rotated and brighter or
darker than its occurrence. Furthermore, we condider approximate matching under several tolerance models.
We obtain algorithms that are almost worst-case optimal. The complexities we obtain are very close to the
best current results for the case where only rotations, but not lighting invariance, are supported.
These are the first results for this problem under a combinatorial approach.