Sequential and indexed two-dimensional combinatorial template matching allowing rotations

Authors:
Kimmo Fredriksson;Gonzalo Navarro;Esko Ukkonen
Affiliations:
Department of Computer Science, University of Joensuu, Finland and University of Helsinki;Center for Web Research, Department of Computer Science, University of Chile, Chile;Department of Computer Science, University of Helsinki, Finland
Venue:
Theoretical Computer Science
Year:
2005

Citing 21
Cited 4

A survey of image registration techniques

ACM Computing Surveys (CSUR)
Fast two-dimensional pattern matching

Information Processing Letters
An Alphabet Independent Approach to Two-Dimensional Pattern Matching

SIAM Journal on Computing
A Generalization of the Suffix Tree to Square Matrices, with Applications

SIAM Journal on Computing
A sublinear algorithm for two-dimensional string matching

Pattern Recognition Letters
On the construction of classes of suffix trees for square matrices: algorithms and applications

Information and Computation
Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time

SIAM Journal on Computing
Combinatorial methods for approximate image matching under translations and rotations

Pattern Recognition Letters - Special issue on pattern recognition in practice VI
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences

Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Probabilistic Analysis of Generalized Suffix Trees (Extended Abstract)

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
Approximate String Matching and Local Similarity

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Alphabet Independent and Dictionary Scaled Matching

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
A Rotation Invariant Filter for Two-Dimensional String Matching

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Rotation Invariant Histogram Filters for Similarity and Distance Measures between Digital Images

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D arrays

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Average complexity of exact and approximate multiple string matching

Theoretical Computer Science
Average-optimal single and multiple approximate string matching

Journal of Experimental Algorithmics (JEA)
Transposition invariant string matching

Journal of Algorithms
Two-dimensional pattern matching with rotations

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching

Rotation and lighting invariant template matching

Information and Computation
Average-optimal string matching

Journal of Discrete Algorithms
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation

Theoretical Computer Science
Efficient two-dimensional pattern matching with scaling and rotation and higher-order interpolation

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	5.24

Visualization

Abstract

We present new and faster algorithms to search for a two-dimensional pattern in a two-dimensional text allowing any rotation of the pattern. This has applications such as image databases and computational biology. We consider the cases of exact and approximate matching under several matching models, using a combinatorial approach that generalizes string matching techniques. We focus on sequential algorithms, where only the pattern can be preprocessed, as well as on indexed algorithms, where the text is preprocessed and an index built on it. On sequential searching we derive average-case lower bounds and then obtain optimal average-case algorithms for all the matching models. At the same time, these algorithms are worst-case optimal. On indexed searching we obtain search time polylogarithmic on the text size, as well as sublinear time in general for approximate searching.