Optimal exact and fast approximate two dimensional pattern matching allowing rotations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2373, Issue , 2002, Pages 235-248

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

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATE MATCHING; EXACT MATCHING; FAST FILTERING ALGORITHM; K-MISMATCHES; MATCHING MODELS; SUM OF ABSOLUTE DIFFERENCES; TIME ALGORITHMS; TWO-DIMENSIONAL PATTERN MATCHING;

PATTERN MATCHING;

EID: 84937418528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_20     Document Type: Conference Paper

References (17)

1. A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Commun. ACM, 18(6):333–340, 1975.
2. A. Amir, G. Benson, and M. Farach. An alphabet independent approach to two-dimensional pattern matching. SIAM J. Comput., 23(2):313–323, 1994.
3. A. Amir, A. Butman, M. Crochemore, G.M. Landau, and M. Schaps. Two-dimensional pattern matching with rotations. Submitted for publication, 2002.
4. R. Baeza-Yates and G. Navarro. Newmodels and algorithms for multidimensional approximate pattern matching. J. Discret. Algorithms, 1(1):21–49, 2000
5. R. A. Baeza-Yates and M. Régnier. Fast two-dimensional pattern matching. Inf. Process. Lett., 45(1):51–57, 1993
6. L. G. Brown. A survey of image registration techniques. ACM Computing Surveys, 24(4):325–376, 1992
7. W.I. Chang and T. Marr. Approximate string matching with local similarity. In Proc. 5th Combinatorial Pattern Matching (CPM’94), LNCS 807, pages 259–273, 1994.
8. M. Crochemore, A. Czumaj, L. Gąsieniec, T. Lecroq, W. Plandowski, and W. Ryt-ter. Fast practical multi-pattern matching. Inf. Process. Lett., 71(3–4):107–113, 1999.
9. K. Fredriksson. Rotation invariant histogram filters for similarity and distance measures between digital images. In Proc. 7th String Processing and Information Retrieval (SPIRE’2000), pages 105–115. IEEE CS Press, 2000.
10. K. Fredriksson and E. Ukkonen. A rotation invariant filter for two-dimensional string matching. In Proc. 9th Combinatorial Pattern Matching (CPM’98), LNCS 1448, pages 118–125, 1998.
11. K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate image matching under translations and rotations. Patt. Recog. Letters, 20(11–13):1249–1258, 1999.
12. K. Fredriksson and 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), pages 96–104. IEEE CS Press, 2000.
13. G. Navarro, K. Fredriksson and E. Ukkonen. An index for two dimensional string matching allowing rotations. In J. van Leeuwen, O. Watanabe, M. Hagiya, P.D. Mosses, and T. Ito, editors, IFIP TCS2000, LNCS 1872, pages 59–75, 2000.
14. J. Kärkkäinen and E. Ukkonen. Two- and higher-dimensional pattern matching in optimal expected time. SIAM J. Comput., 29(2):571–589, 2000.
15. R. L. Rivest. Partial-match retrieval algorithms. SIAM J. Comput., 5(1):19–50, 1976.
16. S. Wu and U. Manber. Fast text searching allowing errors. Commun. ACM, 35(10):83–91, 1992
17. A. C. Yao. The complexity of pattern matching for a random string. SIAM J. Comput., 8(3):368–387, 1979.