Two equal length strings, or two equal sized two dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two dimensional parameterized matching is the task of finding all m × m substrings of an n × n text that p-match to an m × m pattern. This models, for example, searching for color images with changing of color maps. We present an algorithm that solves the two dimensional parameterized matching problem in O(n2 + m2.5 · polylog(m)) time. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Hazay, C., Lewenstein, M., & Tsur, D. (2005). Two dimensional parameterized matching. In Lecture Notes in Computer Science (Vol. 3537, pp. 266–279). Springer Verlag. https://doi.org/10.1007/11496656_23
Mendeley helps you to discover research relevant for your work.