Rotation and Lighting Invariant Template Matching
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.
KeywordsMedian Vote Pattern Cell Approximate Match Text Center Text Cell
Unable to display preview. Download preview PDF.
- 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
- 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), ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/lighting.ps.gz
- 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
- 11.Lemström, K., Tarhio, J.: Detecting monophonic patterns within polyphonic sources. In: Proc. RIAO 2000, pp. 1261–1279 (2000)Google Scholar