Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Articles
Efficient two-dimensional pattern matching in the presence of errors
Kamala Krithivasan
Published in
1987
DOI:
10.1016/0020-0255(87)90037-5
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.
Topics:
Pattern matching
(55)%
55% related to the paper
View more info for "
Efficient two-dimensional pattern matching in the presence of errors
"
Request full-text
Cite
Content may be subject to copyright.
References (4)
Related Papers (3)
Journal Details
Concepts (6)
Related Papers (3)
Articles
Implementing fast Fourier transforms using the Am29500 family
1987
Articles
Open Access
On finding the minimum bandwidth of interval graphs
1991
Articles
A unified approach to domination problems on interval graphs
1988
About the journal
Journal
Information Sciences
ISSN
00200255
Open Access
No
Concepts (6)
Computer programming - algorithms
Computational complexity
MATCHING ERRORS
Object recognition
TWO-DIMENSIONAL PATTERN MATCHING
Pattern recognition
Get all the updates for this publication
Follow