Efficient one-dimensional real scaled matching

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

doi:10.1016/j.jda.2006.03.017

Efficient one-dimensional real scaled matching

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

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

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) m^{3 / 2} sqrt(log m)).

Original language	English
Pages (from-to)	205-211
Number of pages	7
Journal	Journal of Discrete Algorithms
Volume	5
Issue number	2 SPEC. ISS.
DOIs	https://doi.org/10.1016/j.jda.2006.03.017
State	Published - 1 Jan 2007

Keywords

Combinatorial computer vision
Pattern matching
Real scales
Scaled matching

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/j.jda.2006.03.017

Cite this

@article{db788f6a12644f4f9118551cc4dad7eb,

title = "Efficient one-dimensional real scaled matching",

abstract = "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)).",

keywords = "Combinatorial computer vision, Pattern matching, Real scales, Scaled matching",

author = "Amihood Amir and Ayelet Butman and Moshe Lewenstein and Ely Porat and Dekel Tsur",

year = "2007",

month = jan,

day = "1",

doi = "10.1016/j.jda.2006.03.017",

language = "English",

volume = "5",

pages = "205--211",

journal = "Journal of Discrete Algorithms",

issn = "1570-8667",

publisher = "Elsevier",

number = "2 SPEC. ISS.",

}

TY - JOUR

T1 - Efficient one-dimensional real scaled matching

AU - Amir, Amihood

AU - Butman, Ayelet

AU - Lewenstein, Moshe

AU - Porat, Ely

AU - Tsur, Dekel

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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)).

AB - 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)).

KW - Combinatorial computer vision

KW - Pattern matching

KW - Real scales

KW - Scaled matching

UR - https://www.scopus.com/pages/publications/34247144438

U2 - 10.1016/j.jda.2006.03.017

DO - 10.1016/j.jda.2006.03.017

M3 - Article

AN - SCOPUS:34247144438

SN - 1570-8667

VL - 5

SP - 205

EP - 211

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

IS - 2 SPEC. ISS.

ER -

Efficient one-dimensional real scaled matching

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this