Efficient one-dimensional real scaled matching

Journal of Discrete Algorithms

Volumn 5, Issue 2 SPEC. ISS., 2007, Pages 205-211

  Amir, Amihood ^a   Butman, Ayelet ^b   Lewenstein, Moshe ^a   Porat, Ely ^a   Tsur, Dekel ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b HOLON INSTITUTE OF TECHNOLOGY   (Israel)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Combinatorial computer vision; Pattern matching; Real scales; Scaled matching

Indexed keywords

ALGORITHMS; COMPUTER VISION; ONE DIMENSIONAL; PROBLEM SOLVING;

COMBINATORIAL COMPUTER VISION; REAL SCALED MATCHING; SCALED MATCHING;

PATTERN MATCHING;

EID: 34247144438     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.03.017     Document Type: Article

References (16)

1. Amir A., Apostolico A., Landau G.M., and Satta G. Efficient text fingerprinting via Parikh mapping. Journal of Discrete Algorithms 1 5-6 (2003) 409-421
2. Amir A., Butman A., Crochemore M., Landau G.M., and Schaps M. Two-dimensional pattern matching with rotations. Theoretical Computer Science 314 1-2 (2004) 173-187
3. Amir A., Butman A., and Lewenstein M. Real scaled matching. Information Processing Letters 70 4 (1999) 185-190
4. A. Amir, A. Butman, M. Lewenstein, E. Porat, Real two-dimensional scaled matching, in: Proc. 8th Workshop on Algorithms and Data Structures (WADS '03), 2003, pp. 353-364
5. Amir A., and Calinescu G. Alphabet independent and dictionary scaled matching. Journal of Algorithms 36 (2000) 34-62
6. Amir A., and Farach M. Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation 118 1 (1995) 1-11
7. Amir A., and Landau G. Fast parallel and serial multidimensional approximate array matching. Theoretical Computer Science 81 (1991) 97-115
8. Amir A., Landau G.M., and Vishkin U. Efficient pattern matching with scaling. Journal of Algorithms 13 1 (1992) 2-32
9. A. Amir, D. Tsur, O. Kapah, Faster two-dimensional pattern matching with rotations, in: Proc. 15th Annual Symposium on Combinatorial Pattern Matching (CPM '04), 2004, pp. 409-419
10. Boyer R.S., and Moore J.S. A fast string searching algorithm. Communications of the ACM 20 (1977) 762-772
11. G. Didier, T. Schmidt, J. Stoye, D. Tsur, Character sets of strings, Journal of Discrete Algorithms, in press, doi:10.1016/j.jda.2006.03.021
12. Fredriksson K., and Ukkonen E. A rotation invariant filter for two-dimensional string matching. Proc. 9th Annual Symposium on Combinatorial Pattern Matching (CPM '98). Lecture Notes in Computer Science vol. 1448 (1998), Springer 118-125
13. Karp R., Miller R., and Rosenberg A. Rapid identification of repeated patterns in strings, arrays and trees. Symposium on the Theory of Computing 4 (1972) 125-136
14. Knuth D.E., Morris J.H., and Pratt V.R. Fast pattern matching in strings. SIAM Journal on Computing 6 (1977) 323-350
15. Krithivansan K., and Sitalakshmi R. Efficient two-dimensional pattern matching in the presence of errors. Information Sciences 13 (1987) 169-184
16. Landau G.M., and Vishkin U. Pattern matching in a digitized image. Algorithmica 12 3/4 (1994) 375-408