Abstract
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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Fredriksson, K., Mäkinen, V., & Navarro, G. (2004). Rotation and lighting invariant template matching. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2976, 39–48. https://doi.org/10.1007/978-3-540-24698-5_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
