Two Dimensional Parameterized Matching

  • Carmit Hazay
  • Moshe Lewenstein
  • Dekel Tsur
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3537)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Carmit Hazay
    • 1
  • Moshe Lewenstein
    • 1
  • Dekel Tsur
    • 2
  1. 1.Bar-Ilan University 
  2. 2.University of CaliforniaSan Diego

Personalised recommendations