Efficient two-dimensional pattern matching in the presence of errors
Information Sciences: an International Journal
Two-dimensional pattern matching with k mismatches
Pattern Recognition
Fast parallel and serial multidimensional approximate array matching
Theoretical Computer Science
Efficient 2-dimensional approximate matching of non-rectangular figures
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Computational strategies for object recognition
ACM Computing Surveys (CSUR)
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Text algorithms
A Generalization of the Suffix Tree to Square Matrices, with Applications
SIAM Journal on Computing
Two and higher dimensional pattern matching in optimal expected time
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Fast Two-Dimensional Approximate Pattern Matching
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Analysis of Two-Dimensional Approximate Pattern Matching Algorithms
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Fast Multi-dimensional Approximate Pattern Matching
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
A largest common d-dimensional subsequence of two d-dimensional strings
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Pattern discovery in annotated dialogues using dynamic programming
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
In this paper we discuss how to compute the edit distance (or similarity) between two images. We present new similarity measures and how to compute them. They can be used to perform more general two-dimensional approximate pattern matching. Previous work on two-dimensional approximate string matching either work with only substitutions or a restricted edit distance that allows only some type of errors.