Abstract
We consider the problem of finding the occurrences of two-dimensional pattern P[1..m, 1..m] in two-dimensional text T[1..n, 1..n] when also rotations of P are allowed. A fast filtration-type algorithm is developed that finds in T the locations where a rotated P can occur. The, corresponding rotations are also found. The algorithm first reads from P a linear string of length m in all θ(m 2) orientations that are relevant. We also show that the number of different orientations which P can have is θ(m 3). The text T is scanned with Aho-Corasick string matching automaton to find the occurrences of any of these θ(m 2) linear strings of length m. Each such occurrence indicates a potential set of occurrences of whole P which are then checked. Some preliminary running times of a prototype implementation of the method are reported.
A work supported by the Academy of Finland under grant 8745.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alfred V. Aho and Margaret J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333–340, June 1975.
A. Amir, G. Benson, and M. Farach. Alphabet independent two dimensional matching. In N. Alon, editor, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 59–68, Victoria, B.C., Canada, May 1992. ACM Press.
Ricardo Baeza-Pates and Mireille Regnier. Fast two-dimensional pattern matching. Information Processing Letters, 45(1):51–57, January 1993.
Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762–772, October 1977.
T. M. Caelli and Z. Q. Liu. On the minimum number of templates required for shift, rotation and size invariant pattern recognition. Pattern Recognition, 21:205–216, 1988.
Z. Galil and K. Park. Truly alphabet-independent two-dimensional pattern matching. In IEEE, editor, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 247–257, Pittsburgh, PN, October 1992. IEEE Computer Society Press.
Juha Kärkkäinen and Esko Ukkonen. Two and higher dimensional pattern matching in optimal expected time. In Daniel D. Sleator, editor, Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 715–723, Arlington, VA, January 1994. ACM Press.
Marek Karpinski and Wojciech Rytter. Alphabet-independent optimal parallel search for three-dimensional patterns. Technical Report 85101-CS, University of Bonn, Department of Computer Science, November 1993.
Yehezkel Lamdan and Haim J. Wolfson. Geometric hashing: A general and efficient model-based recognition scheme. In Second International Conference on Computer Vision: December 5–8, 1988, Innesbrook Resort, Tampa, Florida, USA, pages 238–249. IEEE Computer Society Press, 1988.
G. M. Landau and U. Vishkin. Pattern matching in a digitized image. Algorithmica, 12(4/5):375–408, October 1994.
S. Ranka and T. Heywood. Two-dimensional pattern matching with k mismatches. Pattern Recognition, 24:31–40, 1991.
J. Tarhio. A sublinear algorithm for two-dimensional string matching. PRL: Pattern Recognition Letters, 17, 1996.
Rui Feng Zhu and Tadao Takaoka. A technique for two-dimensional pattern matching. Communications of the ACM, 32(9):1110–1120, September 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fredriksson, K., Ukkonen, E. (1998). A rotation invariant filter for two-dimensional string matching. In: Farach-Colton, M. (eds) Combinatorial Pattern Matching. CPM 1998. Lecture Notes in Computer Science, vol 1448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030785
Download citation
DOI: https://doi.org/10.1007/BFb0030785
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64739-3
Online ISBN: 978-3-540-69054-2
eBook Packages: Springer Book Archive