Efficient one-dimensional real scaled matching

Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scaled matching is an important problem that was originally inspired by Computer Vision. In this paper, we present a new, more precise and realistic, definition for one-dimensional real scaled matching, and an efficient algorithm for solving this problem. For a text of length n and a pattern of length m, the algorithm runs in time O (n log m + sqrt(n) m3 / 2 sqrt(log m)).

Original languageEnglish
Pages (from-to)205-211
Number of pages7
JournalJournal of Discrete Algorithms
Issue number2 SPEC. ISS.
StatePublished - 1 Jan 2007


  • Combinatorial computer vision
  • Pattern matching
  • Real scales
  • Scaled matching

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Efficient one-dimensional real scaled matching'. Together they form a unique fingerprint.

Cite this