Abstract
The problem of two-dimensional pattern matching invariant under a given class of admissible transformations \(\mathcal{F}\) is to find in text T matches of transformed versions f(P) of the pattern P, for all f in \(\mathcal{F}\). In this paper, pattern matching invariant under compositions of real scaling and rotation are investigated. We give a new discretization technique for this class of transformations and prove sharp lower and upper bounds on the number of different possibilities to transform a pattern in this way. Subsequently, we present the first efficient pattern matching algorithm invariant under compositions of scaling and rotation. The algorithm works in time O(m 2 n 6) for patterns of size m 2 and texts of size n 2. Our method can also be applied to the image matching problem, the well known issue in the image processing research.
Supported by DFG research grant RE 672/5-1.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bovik, A. (ed.): Handbook of Image and Video Processing. Academic Press, San Diego, California (2000)
Amir, A., Butman, A., Crochemore, M., Landau, G., Schaps, M.: Two-dimensional pattern matching with rotations. Theor. Comput. Sci. 314(1-2), 173–187 (2004)
Amir, A., Butman, A., Lewenstein, M.: Real scaled matching. Information Processing Letters 70(4), 185–190 (1999)
Amir, A., Butman, A., Lewenstein, M., Porat, E.: Real two-dimensional scaled matching. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 353–364. Springer, Heidelberg (2003)
Amir, A., Calinescu, G.: Alphabet independent and dictionary scaled matching. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 320–334. Springer, Heidelberg (1996)
Amir, A., Chencinski, E.: Faster two-dimensional scaled matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 200–210. Springer, Heidelberg (2006)
Amir, A., Kapah, O., Tsur, D.: Faster two-dimensional pattern matching with rotations. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 409–419. Springer, Heidelberg (2004)
Amir, A., Landau, G.M., Vishkin, U.: Efficient pattern matching with scaling. Journal of Algorithms 13(1), 2–32 (1992)
Brown, L.G.: A survey of image registration techniques. ACM Computing Surveys 24(4), 325–376 (1992)
Cox, I.J., Bloom, J.A., Miller, M.L.: Digital Watermarking, Principles and Practice. Morgan Kaufmann, San Francisco (2001)
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Berlin (1987)
Edelsbrunner, H., O’Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput. 15, 341–363 (1986)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Algorithms and Applications. Springer, Berlin (2000)
Fredriksson, K., Mäkinen, V., Navarro, G.: Rotation and lighting invariant template matching. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 39–48. Springer, Heidelberg (2004)
Fredriksson, K., Navarro, G., Ukkonen, E.: Optimal exact and fast approximate two-dimensional pattern matching allowing rotations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 235–248. Springer, Heidelberg (2002)
Fredriksson, K., Ukkonen, E.: A rotation invariant filter for two-dimensional string matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 118–125. Springer, Heidelberg (1998)
Hagedoorn, M.: Pattern matching using similarity measures, PhD thesis, Univ. Utrecht, ISBN 90-393-2460-3 (2000)
Hundt, C., Liśkiewicz, M.: On the complexity of affine image matching. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 284–295. Springer, Heidelberg (2007)
Indyk, P.: Algorithmic aspects of geometric embeddings. In: Proc. 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), pp. 10–33 (2001)
Indyk, P., Motwani, R., Venkatasubramanian, S.: Geometric matching under noise: Combinatorial bounds and algorithms. In: Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 354–360 (1999)
Kasturi, R., Jain, R.C.: Computer Vision: Principles. IEEE Computer Society Press, Los Alamitos (1991)
Kenyon, C., Rabani, Y., Sinclair, A.: Low distortion maps between point sets. In: Proc. 36th ACM Symposium on Theory of Computing (STOC 2004), pp. 272–280 (2004)
Kropatsch, W.G., Bischof, H. (eds.): Digital Image Analysis - Selected Techniques and Applications. Springer, Berlin (2001)
Landau, G.M., Vishkin, U.: Pattern matching in a digitized image. Algorithmica 12(3/4), 375–408 (1994)
Maintz, J.B.A., Viergever, M.A.: A survey of medical image registration. Medical Image Analysis 2(1), 1–36 (1998)
Papadimitriou, C., Safra, S.: The complexity of low-distortion embeddings between point sets. In: Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 112–118 (2005)
Shi, Y.Q., Sun, H.: Image and video Compression for multimedia engineering. CRC Press, Boca Raton (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hundt, C., Liśkiewicz, M. (2008). Two-Dimensional Pattern Matching with Combined Scaling and Rotation. In: Ferragina, P., Landau, G.M. (eds) Combinatorial Pattern Matching. CPM 2008. Lecture Notes in Computer Science, vol 5029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69068-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-69068-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69066-5
Online ISBN: 978-3-540-69068-9
eBook Packages: Computer ScienceComputer Science (R0)