Rotation and Lighting Invariant Template Matching

  • Kimmo Fredriksson
  • Veli Mäkinen
  • Gonzalo Navarro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2976)


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 appears rotated and brighter or darker than its occurrence. Furthermore, we consider 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.


Median Vote Pattern Cell Approximate Match Text Center Text Cell 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amir, A., Butman, A., Crochemore, M., Landau, G.M., Schaps, M.: Two-dimensional pattern matching with rotations. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 17–31. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Brown, L.G.: A survey of image registration techniques. ACM Computing Surveys 24(4), 325–376 (1992)CrossRefGoogle Scholar
  3. 3.
    Crawford, T., Iliopoulos, C., Raman, R.: String matching techniques for musical similarity and melodic recognition. Computing in Musicology 11, 71–100 (1998)Google Scholar
  4. 4.
    de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd rev. edn. Springer, Heidelberg (2000)zbMATHGoogle Scholar
  5. 5.
    Fredriksson, K., Mäkinen, V., Navarro, G.: Rotation and lighting invariant template matching. Technical Report TR/DCC-2003-3, Dept. of Comp.Sci., Univ. of Chile (2003),
  6. 6.
    Fredriksson, K., Navarro, G., Ukkonen, E.: Faster than FFT: Rotation Invariant Combinatorial Template Matching, vol. II, pp. 75–112. Trans.Res.Net (2002)Google Scholar
  7. 7.
    Fredriksson, K., Navarro, G., Ukkonen, E.: Optimal exact and fast approximate two dimensional pattern matching allowing rotations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 235–248. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Fredriksson, K., Ukkonen, E.: A rotation invariant filter for two-dimensional string matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 118–125. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. 9.
    Fredriksson, K., Ukkonen, E.: Combinatorial methods for approximate image matching under translations and rotations. Patt. Rec. Lett. 20(11-13), 1249–1258 (1999)CrossRefGoogle Scholar
  10. 10.
    Fredriksson, K., Navarro, G., Ukkonen, E.: An index for two dimensional string matching allowing rotations. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 59–75. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  11. 11.
    Lemström, K., Tarhio, J.: Detecting monophonic patterns within polyphonic sources. In: Proc. RIAO 2000, pp. 1261–1279 (2000)Google Scholar
  12. 12.
    Mäkinen, V., Navarro, G., Ukkonen, E.: Algorithms for transposition invariant string matching. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 191–202. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Kimmo Fredriksson
    • 1
  • Veli Mäkinen
    • 2
  • Gonzalo Navarro
    • 3
  1. 1.Department of Computer ScienceUniversity of Joensuu 
  2. 2.Department of Computer ScienceUniversity of Helsinki 
  3. 3.Center for Web Research, Department of Computer ScienceUniversity of Chile 

Personalised recommendations