论文信息 - Real Two Dimensional Scaled Matching

Real Two Dimensional Scaled Matching

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. Scaled matching is an important problem that was originally inspired by Computer Vision.

Moshe Lewenstein | Ely Porat | Amihood Amir | Ayelet Butman

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

[2] Alejandro A. Schäffer,et al. Multiple matching of rectangular patterns , 1993, STOC '93.

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

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

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

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

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

[8] Gad M. Landau,et al. Efficient String Matching with k Mismatches , 2018, Theor. Comput. Sci..

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

[10] Roberto Grossi,et al. On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications , 1995, Inf. Comput..

[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] Amihood Amir,et al. Two-Dimensional Dictionary Matching , 1992, Inf. Process. Lett..

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