Rotation and lighting invariant template matching

Information and Computation

Volumn 205, Issue 7, 2007, Pages 1096-1113

  Fredriksson, Kimmo ^a   Mäkinen, Veli ^b   Navarro, Gonzalo ^c  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

^b UNIVERSITY OF HELSINKI   (Finland)

^c UNIVERSITY OF CHILE   (Chile)

Author keywords

2 Dimensional pattern matching; Approximate pattern matching; Lighting invariance; Rotation invariance; Transposition invariance

Indexed keywords

LIGHTING; PATTERN MATCHING; TEMPLATE MATCHING;

2-DIMENSIONAL PATTERN MATCHING; APPROXIMATE PATTERN MATCHING; LIGHTING INVARIANCES; ROTATION INVARIANCE; TRANSPOSITION INVARIANCE;

ROTATION;

EID: 84855196395     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.03.002     Document Type: Article

References (25)

1. L. G. Brown, A survey of image registration techniques, ACM Computing Surveys 24(4) (1992) 325-376.
2. K. Fredriksson, E. Ukkonen, A rotationinvariant filter for two-dimensional string matching, in: Proc. 9th Combinatorial Pattern Matching (CPM'98), LNCS 1448, 1998, pp. 118-125. (Pubitemid 128109065)
3. K. Fredriksson, E. Ukkonen, Combinatorial methods for approximate image matching under translations and rotations, Patt. Recog. Letters 20 (11-13) (1999) 1249-1258. (Pubitemid 32261903)
4. K. Fredriksson, E. Ukkonen, Combinatorial methods for approximate pattern matching under rotations and translations in 3d arrays, in: Proc. 7th String Processing and Information Retrieval (SPIRE 2000), IEEE CS Press, 2000, pp. 96-104.
5. K. Fredriksson, Rotation invariant histogram filters for similarity and distance measures between digital images, in: Proc. 7th String Processing and Information Retrieval (SPIRE 2000), IEEE CS Press, 2000, pp. 105-115.
6. K. Fredriksson, G. Navarro, E. Ukkonen, An index for two dimensional string matching allowing rotations, in: J. van Leeuwen, O. Watanabe, M. Hagiya, P. Mosses, T. Ito (Eds.), IFIP TCS2000, LNCS 1872, 2000, pp. 59-75.
7. K. Fredriksson, G. Navarro, E. Ukkonen, Optimal exact and fast approximate two dimensional pattern matching allowing rotations, in: Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), LNCS 2373, 2002, pp. 235-248.
8. K. Fredriksson, G. Navarro, E. Ukkonen, Faster than FFT: Rotation Invariant Combinatorial Template Matching, in: Transworld Research Network, Vol. 2, 2002, pp. 75-112.
9. K. Fredriksson, G. Navarro, E. Ukkonen, Sequential and indexed two-dimensional combinatorial template matching allowing rotations, Theoretical Computer Science A 347 (1-2) (2005) 239-275. (Pubitemid 41650218)
10. A. Amir, A. Butman, M. Crochemore, G. Landau, M. Schaps, Two-dimensional pattern matching with rotations, in: Proc. 14th Annual Symposium on Combinatorial Pattern Matching (CPM 2003), LNCS 2676, 2003, pp. 17-31.
11. T. Crawford, C. Iliopoulos, R. Raman, String matching techniques for musical similarity and melodic recognition, Computing in Musicology 11(1998) 71-100.
12. K. Lemström, J. Tarhio, Detecting monophonic patterns within polyphonic sources, in: Content-Based Multimedia Information Access Conference Proceedings (RIAO 2000), 2000, pp. 1261-1279.
13. V. Mäkinen, G. Navarro, E. Ukkonen, Transposition invariant string matching, Journal of Algorithms 56(2) (2005) 124-153. (Pubitemid 41085032)
14. K. Fredriksson, V. Mäkinen, G. Navarro, Flexible music retrieval in sublinear time, International Journalof Foundationsof Computer Science (IJFCS) 17(6) (2006) 1345-1364. (Pubitemid 44924924)
15. C. Russ, The Image Processing Handbook, fourth ed., CRC Press, 2002.
16. A. Amir, O. Kapah, D. Tsur, Fast two-dimensional pattern matching with rotations, in: Proc. 15th Annual Symposium on Combinatorial Pattern Matching (CPM 2004), LNCS v. 3109, 2004, pp. 409-419.
17. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer Verlag, 1984.
18. T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, second ed., The MIT Press, 2001.
19. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2nd Edition, Springer Verlag, 2000.
20. P. van Emde Boas, R. Kaas, E. Zijlstra, Design and implementation of an efficient priority queue, Mathematical Systems Theory 10(1977) 99-127.
21. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters 6(3) (1977) 80-82.
22. A. Andersson, M. Thorup, Tight (er) worst-case bounds on dynamic searching and priority queues, in: Proc. 32nd Annual ACM Symposium on Theory of Computing (STOC'00), 2000, pp. 335-342.
23. A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Sorting in linear time?, in: Proc. 27th Annual ACM Symposium on Theory of Computing (STOC'95), 1995, pp. 427-436.
24. G. Navarro, A guided tour to approximate string matching, ACM Computing Surveys 33(1) (2001) 31-88. (Pubitemid 33768480)
25. K. Fredriksson, G. Navarro, Average-optimal single and multiple approximate string matching, ACM Journal of Experimental Algorithmics 9 (1.4) (2004).