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/6
Y1 - 2007/6
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 - http://www.scopus.com/inward/record.url?scp=34247144438&partnerID=8YFLogxK
U2 - 10.1016/j.jda.2006.03.017
DO - 10.1016/j.jda.2006.03.017
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.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 -