Pattern matching is the area of computer science which deals with security and analysis of data. This work proposes two 2D pattern matching algorithms based on two different input domains. The first algorithm is for the case when the given pattern contains only two symbols, that is, binary symbols 0 and 1. The second algorithm is in the case when the given pattern contains decimal numbers, that is, the collection of symbols between 0 and 9. The algorithms proposed in this manuscript convert the given pattern into an equivalent binary or decimal number, correspondingly find the cofactors of the same dimension and convert these cofactors into numbers if a particular cofactor number matches indicate the matching of the pattern. Furthermore, the algorithm is enhanced for decimal numbers. In the case of decimal numbers, each row of the pattern is changed to its decimal equivalent, and then, modulo with a suitable prime number changes the decimal equivalent into a number less than the prime number. If the number mismatched pattern does not exist, the complexity of the proposed algorithm is very low as compared to other traditional algorithms.


    Access

    Download


    Export, share and cite



    Title :

    An Efficient Algorithm for 2-Dimensional Pattern Matching Problem


    Contributors:


    Publication date :

    2020




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    A cascaded genetic algorithm for efficient optimization and pattern matching

    Garai, G. / Chaudhuri, B. B. | British Library Online Contents | 2002


    A High-Speed Pattern Matching Algorithm

    Jelavic, M. | British Library Online Contents | 1990


    Pattern Matching

    Kwon, Kye‐Si ;Ready, Steven | Wiley | 2014


    Efficient block-matching motion estimation algorithm

    Guo, S.-M. / Hsu, C.-Y. | British Library Online Contents | 2013


    A Fast Pattern Matching Algorithm in Intrusion Detection System

    Jiang, Q. / Wu, N. / Liu, W. | British Library Online Contents | 2009