Header menu link for other important links
X
Efficient two-dimensional pattern matching in the presence of errors
Kamala Krithivasan
Published in
1987
Volume: 43
   
Issue: 3
Pages: 169 - 184
Abstract
We give an algorithm for two-dimensional pattern matching in the presence of errors. We find that the complexity of our algorithm is O(kn1n2 log n2 + n12n2 + kn1m1m2), where the pattern is an n1 × n2 array, the text is an m1 × m2 array and k is the number of mismatches allowed. © 1987.
About the journal
JournalInformation Sciences
ISSN00200255
Open AccessNo
Concepts (6)
  •  related image
    Computer programming - algorithms
  •  related image
    Computational complexity
  •  related image
    MATCHING ERRORS
  •  related image
    Object recognition
  •  related image
    TWO-DIMENSIONAL PATTERN MATCHING
  •  related image
    Pattern recognition