论文信息 - Efficient One Dimensional Real Scaled Matching

Efficient One Dimensional Real Scaled Matching

Real Scaled Matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scaled matching is an important problem that was originally inspired by Computer Vision.

Moshe Lewenstein | Ely Porat | Amihood Amir | Dekel Tsur | Ayelet Butman

[1] Esko Ukkonen,et al. A Rotation Invariant Filter for Two-Dimensional String Matching , 1998, CPM.

[2] Kamala Krithivasan,et al. Efficient two-dimensional pattern matching in the presence of errors , 1987, Inf. Sci..

[3] Gad M. Landau,et al. Efficient pattern matching with scaling , 1990, SODA '90.

[4] Gad M. Landau,et al. Two-Dimensional Pattern Matching with Rotations , 2003, CPM.

[5] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[6] Amihood Amir,et al. Faster Two Dimensional Pattern Matching with Rotations , 2004, CPM.

[7] Giorgio Satta,et al. Efficient text fingerprinting via Parikh mapping , 2003, J. Discrete Algorithms.

[8] Amihood Amir,et al. Alphabet Independent and Dictionary Scaled Matching , 1996, CPM.

[9] Gad M. Landau,et al. Pattern matching in a digitized image , 1992, SODA '92.

[10] Moshe Lewenstein,et al. Real Two Dimensional Scaled Matching , 2003, WADS.

[11] Moshe Lewenstein,et al. Real scaled matching , 2000, SODA '00.

[12] Gad M. Landau,et al. Fast Parallel and Serial Multidimensional Aproximate Array Matching , 1991, Theor. Comput. Sci..

[13] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.

[14] Amihood Amir,et al. Efficient 2-dimensional approximate matching of non-rectangular figures , 1991, SODA '91.