Faster two dimensional scaled matching

Amihood Amir, Eran Chencinski

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variety of interesting problems in multidimensional pattern matching. One of the problems is that of scaled matching, finding all appearances of a pattern, proportionally enlarged according to an arbitrary real-sized scale, in a given text. The currently fastest known algorithm for this problem uses techniques from dictionary matching to solve the problem in O(nm 3+n 2 mlog∈m) time using O(nm 3+n 2) space, where T is a two-dimensional n×n text array and P is a two-dimensional m×m pattern array. We present a new approach for solving the scaled matching problem improving both the running time and the space requirements. Our algorithm runs in O(n 2 m) time and uses O(n 2) space.

Original languageEnglish
Pages (from-to)214-234
Number of pages21
JournalAlgorithmica
Volume56
Issue number2
DOIs
StatePublished - Feb 2010

Bibliographical note

Funding Information:
Research of A. Amir was partly supported by ISF grant 35/05.

Keywords

  • Multidimensional pattern matching
  • Scaled pattern matching
  • Theory of discrete image processing

Fingerprint

Dive into the research topics of 'Faster two dimensional scaled matching'. Together they form a unique fingerprint.

Cite this