An index for two dimensional string matching allowing rotations

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

Volumn 1872 LNCS, Issue , 2000, Pages 59-75

  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

COMPUTER SCIENCE; COMPUTERS; ARTIFICIAL INTELLIGENCE;

ALPHABET SIZE; APPROXIMATE MATCHING; CONTENT-BASED INFORMATION RETRIEVAL; IMAGE DATABASE; MATCHING MODELS; STRING MATCHING; TWO-DIMENSIONAL PATTERNS; TWO-DIMENSIONAL TEXTS;

ARTIFICIAL INTELLIGENCE; IMAGE MATCHING;

EID: 84855994756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44929-9_5     Document Type: Conference Paper

References (16)

1. A. Amir, G. Benson, and M. Farach. Alphabet independent two dimensional matching. In N. Alon, editor, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 59-68, Victoria, B.C., Canada, May 1992. ACM Press.
2. A. Amir. Multidimensional pattern matching: A survey. Technical Report GITCC-92/29, Georgia Institute of Technology, College of Computing, 1992.
3. K. Fredriksson and E. Ukkonen. A rotation invariant lter for two-dimensional string matching. In Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching (CPM'98), LNCS 1448, pages 118-125, 1998.
4. K. Fredriksson and E. Ukkonen. Algorithms for 2-d hamming distance under rotations. Manuscript, 1999.
5. K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate image matching under translations and rotations. Pattern Recognition Letters, 20(11-13):1249-1258, 1999.
6. K. Fredriksson and E. Ukkonen. Combinatorial methods for approximate pattern matching under rotations and translations in 3D arrays. Submitted, 2000.
7. Z. Galil and K. Park. Truly alphabet-independent two-dimensional pattern matching. In IEEE, editor, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 247-257, Pittsburgh, PN, October 1992. IEEE Computer Society Press.
8. R. Giancarlo. A generalization of sufix trees to square matrices, with applications. SIAM J. on Computing, 24:520-562, 1995.
9. R. Giancarlo and R. Grossi. On the construction of classes of sufix trees for square matrices: Algorithms and applications. Information and Computation, 130:151-182, 1996.
10. G. H. Gonnet. Eficient searching of text and pictures. Report OED-88-02, University of Waterloo, 1988.
11. J. Kärkkäinen and E. Ukkonen. Two and higher dimensional pattern matching in optimal expected time. In Daniel D. Sleator, editor, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 715-723, Arlington, VA, January 1994. ACM Press.
12. G. M. Landau and U. Vishkin. Pattern matching in a digitized image. Algorithmica, 12(4/5):375-408, October 1994.
13. G. Navarro and R. Baeza-Yates. Fast multi-dimensional approximate string matching. In Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM'99), LNCS, pages 243-257, 1999.
14. T. Takaoka. Approximate pattern matching with grey scale values. In Michael E. Houle and Peter Eades, editors, Proceedings of Conference on Computing: The Australian Theory Symposium, pages 196-203, Townsville, January 29-30 1996. Australian Computer Science Communications.
15. J. Tarhio. A sublinear algorithm for two-dimensional string matching. PRL: Pattern Recognition Letters, 17, 1996.
16. J. Wood. Invariant pattern recognition: A review. Pattern Recognition, 29(1):1-17, 1996.