Efficient one dimensional real scaled matching

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

doi:10.1007/978-3-540-30213-1_1

Efficient one dimensional real scaled matching

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

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

3 Scopus citations

Abstract

Real Scaled Matching refers to 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 logm +√nm ^3/2√logm).

Original language	English
Pages (from-to)	1-9
Number of pages	9
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3246
DOIs	https://doi.org/10.1007/978-3-540-30213-1_1
State	Published - 1 Dec 2004
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-30213-1_1

Cite this

@article{a9890e20a2f34996ac0f9f7bf6268fcc,

title = "Efficient one dimensional real scaled matching",

abstract = "Real Scaled Matching refers to 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 logm +√nm 3/2√logm).",

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

year = "2004",

month = dec,

day = "1",

doi = "10.1007/978-3-540-30213-1\_1",

language = "English",

volume = "3246",

pages = "1--9",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

}

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 - 2004/12/1

Y1 - 2004/12/1

N2 - Real Scaled Matching refers to 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 logm +√nm 3/2√logm).

AB - Real Scaled Matching refers to 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 logm +√nm 3/2√logm).

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

U2 - 10.1007/978-3-540-30213-1_1

DO - 10.1007/978-3-540-30213-1_1

M3 - Article

AN - SCOPUS:84871103033

SN - 0302-9743

VL - 3246

SP - 1

EP - 9

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

Efficient one dimensional real scaled matching

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this