Sequential and indexed two-dimensional combinatorial template matching allowing rotations

Theoretical Computer Science

Volumn 347, Issue 1-2, 2005, Pages 239-275

  Fredriksson, Kimmo ^a   Navarro, Gonzalo ^b   Ukkonen, Esko ^c  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Combinatorial algorithms; Image processing; String matching; Template matching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATABASE SYSTEMS;

AVERAGE-CASE ALGORITHMS; SEQUENTIAL ALGORITHMS; TEMPLATE MATCHING;

COMPUTER SCIENCE;

EID: 27844459032     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.06.029     Document Type: Article

References (38)

1. A.V. Aho, and M.J. Corasick Efficient string matching: an aid to bibliographic search Comm. ACM 18 6 1975 333 340
2. A. Amir, Multidimensional pattern matching: a survey, Technical Report GIT-CC-92/29, Georgia Institute of Technology, College of Computing, 1992.
3. A. Amir, G. Benson, and M. Farach An alphabet independent approach to two-dimensional pattern matching SIAM J. Comput. 23 2 1994 313 323
4. A. Amir, A. Butman, M. Crochemore, G. Landau, M. Schaps, Two-dimensional pattern matching with rotations, in: Proc. of the 14th Annu. Sympo. on Combinatorial Pattern Matching (CPM 2003), Lecture Notes in Computer Science, Vol. 2676, Springer, Berlin, 2003, pp. 17-31.
5. A. Amir, A. Butman, M. Lewenstein, E. Porat, Real two-dimensional scaled matching, in: Proc. of the eigth Workshop on Algorithms and Data Structures (WADS 2003), Lecture Notes in Computer Science, Vol. 2748, Springer, Berlin, 2003, pp. 353-364.
6. A. Amir, G. Cǎlinescu, Alphabet independent and dictionary scaled matching, in: Proc. of the seventh Annu. Sympo. on Combinatorial Pattern Matching (CPM'96), Lecture Notes in Computer Science, Vol. 1075, Springer, Berlin, 1996, pp. 320-334.
7. A. Amir, O. Kapah, D. Tsur, Fast two-dimensional pattern matching with rotations, in: Proc. of the 15th Annu. Sympo. on Combinatorial Pattern Matching (CPM 2004), Lecture Notes in Computer Science, Vol. 3109, Springer, Berlin, 2004, pp. 409-419.
8. A. Apostolico, The myriad virtues of suffix trees, in: A. Apostolico, Z. Galil (Eds.), Combinatorial Algorithms on Words, NATO Advanced Science Institutes, Series F, Vol. 12, Springer, Berlin, 1985, pp. 85-96.
9. R. Baeza-Yates, and G. Navarro New models and algorithms for multidimensional approximate pattern matching J. Discrete Algorithms 1 1 2000 21 49 Special issue on Matching Patterns
10. R. Baeza-Yates, and M. Régnier Fast two-dimensional pattern matching Inform. Process. Lett. 45 1 1993 51 57
11. L. Brown A survey of image registration techniques ACM Comput. Surveys 24 4 1992 325 376
12. W. Chang, T. Marr, Approximate string matching with local similarity, in: Proc. of the fifth Annu. Sympo. on Combinatorial Pattern Matching (CPM'94), Lecture Notes in Computer Science, Vol. 807, Springer, Berlin, 1994, pp. 259-273.
13. M. Crochemore, A. Czumaj, L. Ga̧sieniec, T. Lecroq, W. Plandowski, and W. Rytter Fast practical multi-pattern matching Inform. Process. Lett. 71 3-4 1999 107 113
14. K. Fredriksson, Rotation invariant histogram filters for similarity and distance measures between digital images, in: Proc. of the seventh Internat. Sympo. on String Processing and Information Retrieval (SPIRE 2000), IEEE CS Press, Silver Spring, MD, 2000, pp. 105-115.
15. K. Fredriksson, V. Mäkinen, G. Navarro, Rotation and lighting invariant template matching, in: Proc. of the sixth Latin American Sympo. on Theoretical Informatics (LATIN 2004), Lecture Notes in Computer Science, Vol. 2976, Springer, Berlin, 2004, pp. 39-48.
16. K. Fredriksson, and G. Navarro Average-optimal single and multiple approximate string matching ACM J. Exp. Algorithmics 9 1.4 2004
17. K. Fredriksson, G. Navarro, E. Ukkonen, An index for two dimensional string matching allowing rotations, in: Proc. of the first IFIP Internat. Conf. on Theoretical Computer Science (IFIP TCS 2000), Lecture Notes in Computer Science, Vol. 1872, Springer, Berlin, 2000, pp. 59-75.
18. K. Fredriksson, G. Navarro, E. Ukkonen, Faster than FFT: Rotation Invariant Combinatorial Template Matching, Vol. II. Transworld Research Network, 2002, pp. 75-112.
19. K. Fredriksson, G. Navarro, E. Ukkonen, Optimal exact and fast approximate two dimensional pattern matching allowing rotations, in: Proc. of the 13th Annu. Sympo. on Combinatorial Pattern Matching (CPM 2002), Lecture Notes in Computer Science, Vol. 2373, Springer, Berlin, 2002, pp. 235-248.
20. K. Fredriksson, E. Ukkonen, A rotation invariant filter for two-dimensional string matching, in: Proc. of the ninth Annu. Sympo. on Combinatorial Pattern Matching (CPM'98), Lecture Notes in Computer Science, Vol. 1448, Springer, Berlin, 1998, pp. 118-125.
21. K. Fredriksson, E. Ukkonen, Algorithms for 2D Hamming distance under rotations, University of Helsinki, Manuscript, 1999.
22. K. Fredriksson, and E. Ukkonen Combinatorial methods for approximate image matching under translations and rotations Pattern Recognition Lett. 20 11-13 1999 1249 1258
23. K. Fredriksson, E. Ukkonen, Combinatorial methods for approximate pattern matching under rotations and translations in 3D arrays, in: Proc. of the seventh Internat. Sympo. on String Processing and Information Retrieval (SPIRE 2000), IEEE CS Press, Silver Springer, MD, 2000, pp. 96-104.
24. Z. Galil, K. Park, Truly alphabet-independent two-dimensional pattern matching, in: Proc. of the 33rd Annu. Sympo. on Foundations of Computer Science (FOCS'92), IEEE CS Press, Silver Springer, MD, 1992, pp. 247-257.
25. R. Giancarlo A generalization of the suffix tree to square matrices, with applications SIAM J. Comput. 24 3 1995 520 562
26. R. Giancarlo, and R. Grossi On the construction of classes of suffix trees for square matrices: algorithms and applications Information and Comput. 130 2 1996 151 182
27. G.H. Gonnet, Efficient searching of text and pictures, Report OED-88-02, University of Waterloo, 1988.
28. J. Kärkkäinen, and E. Ukkonen Two- and higher-dimensional pattern matching in optimal expected time SIAM J. Comput. 29 2 2000 571 589
29. G.M. Landau, and U. Vishkin Pattern matching in digitalized image Algorithmica 12 4/5 1994 375 408
30. V. Mäkinen, G. Navarro, E. Ukkonen, Transposition invariant string matching, J. Algorithms 56 (2) (2005) 124-153.
31. G. Navarro, and K. Fredriksson Average complexity of exact and approximate multiple string matching Theoret. Comput. Sci. 321 2-3 2004 283 290
32. G. Navarro, and M. Raffinot Flexible Pattern Matching in Strings - Practical on-line Search Algorithms for Texts and Biological Sequences 2002 Cambridge University Press Cambridge ISBN 0-521-81307-7
33. W. Szpankowski On the height of digital trees and related problems Algorithmica 6 1991 256 277
34. W. Szpankowski, Analysis of generalized suffix trees, in: Proc. of the third Annu. Sympo. on Combinatorial Pattern Matching (CPM'92), Lecture Notes in Computer Science, Vol. 664, Springer, Berlin, 1992, pp. 1-14.
35. T. Takaoka, Approximate pattern matching with grey scale values, in: M. Houle, P. Eades (Eds.), Proc. of the Conf. on Computing: The Australian Theory Sympo., Australian Computer Science Communications, 1996, pp. 196-203.
36. J. Tarhio A sublinear algorithm for two-dimensional string matching Pattern Recognition Lett. 17 1996 833 838
37. J. Wood Invariant pattern recognition: a review Pattern Recognition 29 1 1996 1 17
38. A.C. Yao The complexity of pattern matching for a random string SIAM J. Comput. 8 3 1979 368 387