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
Y1 - 2004
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 - http://www.scopus.com/inward/record.url?scp=84871103033&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30213-1_1
DO - 10.1007/978-3-540-30213-1_1
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.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 -