Faster two-dimensional pattern matching with rotations

被引:13
|
作者
Amir, Amihood [1 ]
Kapah, Oren
Tsur, Dekel
机构
[1] Bar Ilan Univ, Dept Comp Sci, IL-52900 Ramat Gan, Israel
[2] Bar Ilan Univ, Dept Comp Sci, IL-52900 Ramat Gan, Israel
[3] Ben Gurion Univ Negev, Dept Comp Sci, IL-84105 Beer Sheva, Israel
基金
以色列科学基金会; 美国国家科学基金会;
关键词
design and analysis of algorithms; two-dimensional pattern matching; rotation;
D O I
10.1016/j.tcs.2006.09.012
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The most efficient currently known algorithms for two-dimensional pattern matching with rotations have a worst case time complexity of O(n(2)m(3)), where the size of the text is n x n and the size of the pattern is m x m. In this paper we present a new algorithm for the problem whose running time is 0(n(2),m(2)). (c) 2006 Published by Elsevier B.V.
引用
收藏
页码:196 / 204
页数:9
相关论文
共 50 条
  • [1] Faster two dimensional pattern matching with rotations
    Amir, A
    Kapah, O
    Tsur, D
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2004, 3109 : 409 - 419
  • [2] Two-dimensional pattern matching with rotations
    Amir, A
    Butman, A
    Crochemore, M
    Landau, GM
    Schaps, M
    THEORETICAL COMPUTER SCIENCE, 2004, 314 (1-2) : 173 - 187
  • [3] Two-dimensional pattern matching with rotations
    Amir, A
    Butman, A
    Crochemore, M
    Landau, GM
    Schaps, M
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2003, 2676 : 17 - 31
  • [4] Two-dimensional pattern matching by two-dimensional online tessellation automata
    Polcar, T
    Melichar, B
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 327 - 328
  • [5] Fast two-dimensional approximate pattern matching
    BaezaYates, R
    Navarro, G
    LATIN '98: THEORETICAL INFORMATICS, 1998, 1380 : 341 - 351
  • [6] A TECHNIQUE FOR TWO-DIMENSIONAL PATTERN-MATCHING
    ZHU, RF
    TAKAOKA, T
    COMMUNICATIONS OF THE ACM, 1989, 32 (09) : 1110 - 1120
  • [7] On two-dimensional pattern matching by finite automata
    Zdárek, J
    Melichar, B
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 329 - 340
  • [8] TWO-DIMENSIONAL PATTERN-MATCHING BY TWO-DIMENSIONAL ONLINE TESSELLATION ACCEPTORS
    TODA, M
    INOUE, K
    TAKANAMI, I
    THEORETICAL COMPUTER SCIENCE, 1983, 24 (02) : 179 - 194
  • [9] Sequential and indexed two-dimensional combinatorial template matching allowing rotations
    Fredriksson, K
    Navarro, G
    Ukkonen, E
    THEORETICAL COMPUTER SCIENCE, 2005, 347 (1-2) : 239 - 275
  • [10] A structural matching for two-dimensional visual pattern inspection
    Koo, JH
    Yoo, SI
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 4429 - 4434