Real two dimensional scaled matching

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

Volumn 2748, Issue , 2003, Pages 353-364

  Amir, Amihood ^a   Butman, Ayelet ^a   Lewenstein, Moshe ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER VISION; IMAGE PROCESSING; PATTERN MATCHING;

DISCRETE IMAGES; REAL VALUES; RUNNING TIME;

IMAGE MATCHING;

EID: 35248885683     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_31     Document Type: Article

References (15)

1. A. Amir, A. Butman, and M. Lewenstein. Real scaled matching. Information Processing Letters, 70 (4) : 185-190, 1999.
2. A. Amir and G. Calinescu. Alphabet independent and dictionary scaled matching. Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM 96), pages 320-334, 1996.
3. A. Amir and M. Farach. Two dimensional dictionary matching. Information Processing Letters, 44: 233-239, 1992.
4. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation, 118(1):1-11, April 1995.
5. A. Amir and G. Landau. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science, 81:97-115, 1991.
6. A. Amir, G.M. Landau, and U. Vishkin. Efficient Pattern matching with scaling. Journal of Algorithms, 13(1):2-32, 1992.
7. R.S. Boyer and J.S. Moore. A fast string searching algorithm. Comm. ACM, 20:762-772, 1977.
8. K. Fredriksson and E. Ukkonen. A rotation invariant filter for two-dimensional string matching. In Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM 98), pages 118-125. Springer, LNCS 1448, 1998.
9. R. Giancarlo and R. Grossi. On the construction of classes of suffix trees for Square matrices: Algorithms and applications. Information and Computation, 130(2):151-182, 1996.
10. R.M. Idury and A.A Schäffer. Multiple matching of rectangular Patterns. Proc. 25th ACM STOC, pages 81-89, 1993.
11. D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast Pattern matching in strings. SIAM J. Comp., 6:323-350, 1977.
12. K. Krithivansan and R. Sitalakshmi. Efficient two dimensional Pattern matching in the presence of errors. Information Sciences, 13:169-184, 1987.
13. G. M. Landau and U. Vishkin. Efficient string matching with k mismatches. Theoretical Computer Science, 43:239-249, 1986.
14. G. M. Landau and U. Vishkin. Pattern matching in a digitized image. Algorithmica, 12 (3/4):375-408, 1994.
15. A. Pentland. Invited talk. NSF Institutional Infrastructure Workshop, 1992.