Fast text searching: allowing errors
Communications of the ACM
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
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
An Index for Two Dimensional String Matching Allowing Rotations
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Approximate String Matching and Local Similarity
CPM '94 Proceedings of the 5th 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)
Two-dimensional pattern matching with rotations
Theoretical Computer Science
Scaled and permuted string matching
Information Processing Letters
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Theoretical Computer Science
Faster two-dimensional pattern matching with rotations
Theoretical Computer Science
Rotation and lighting invariant template matching
Information and Computation
Two-Dimensional Pattern Matching with Combined Scaling and Rotation
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
New Complexity Bounds for Image Matching under Rotation and Scaling
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Scaled and permuted string matching
Information Processing Letters
Two-dimensional pattern matching with rotations
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
On the complexity of affine image matching
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Affine image matching is uniform TC0-complete
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
New complexity bounds for image matching under rotation and scaling
Journal of Discrete Algorithms
Searching patterns in digital image databases
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Approximate string matching with reduced alphabet
Algorithms and Applications
Pattern discovery in annotated dialogues using dynamic programming
International Journal of Intelligent Information and Database Systems
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
We give fast filtering algorithms to search for a 2- dimensional pattern in a 2-dimensional text allowing any rotation of the pattern. We consider the cases of exact and approximate matching under several matching models, improving the previous results. For a text of size n脳n characters and a pattern of size m脳m characters, the exact matching takes average time O(n2 log m/m2), which is optimal. If we allow k mismatches of characters, then our best algorithm achieves O(n2k log m/m2) average time, for reasonable k values. For large k, we obtain an O(n2k3/2驴log m/m) average time algorithm. We generalize the algorithms for the matching model where the sum of absolute differences between characters is at most k. Finally, we show how to make the algorithms optimal in the worst case, achieving the lower bound 驴(n2m3).