Two-dimensional pattern matching with rotations

Authors:
Amihood Amir;Ayelet Butman;Maxime Crochemore;Gad M. Landau;Malka Schaps
Affiliations:
Bar-Ilan University and Georgia Tech and Department of Computer Science, Ramat-Gan, Israel;Bar-Ilan University and Department of Computer Science, Ramat-Gan, Israel;University of Marne-La-Vallée and King's College London and Institut Gaspard-Monge;University of Haifa and Polytechnic University and Department of Computer Science, Haifa, Israel and Department of Computer and Information, Six MetroTech Center, Brooklyn, NY;Bar-Ilan University and Department of Mathematics, Ramat-Gan, Israel
Venue:
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Year:
2003

Citing 14
Cited 7

Generalized string matching

SIAM Journal on Computing
Fast parallel and serial multidimensional approximate array matching

Theoretical Computer Science
Two-dimensional dictionary matching

Information Processing Letters
Text algorithms

Text algorithms
On the construction of classes of suffix trees for square matrices: algorithms and applications

Information and Computation
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Pattern matching algorithms

Pattern matching algorithms
Geometric matching under noise: combinatorial bounds and algorithms

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Real scaled matching

Information Processing Letters
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations

CPM '02 Proceedings of the 13th 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
Pattern Matching for Spatial Point Sets

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An Image Similarity Measure Based on Graph Matching

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)

Sequential and indexed two-dimensional combinatorial template matching allowing rotations

Theoretical Computer Science
Rotation and lighting invariant template matching

Information and Computation
New Complexity Bounds for Image Matching under Rotation and Scaling

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Affine image matching is uniform TC0-complete

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Finding Patterns In Given Intervals

Fundamenta Informaticae
A fast algorithm for template matching

ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part II
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	0.00

Visualization

Abstract

The problem of pattern matching with rotation is that of finding all occurrences of a two-dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such different possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some finite alphabet Σ, we present a new method yielding an O(n2m3) time algorithm for this problem.