Real scaled matching

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 + nm3/2 log m).

• Type: Conference
• Year: 2000
• Where: SODA
• Authors: Amihood Amir, Ayelet Butman, Moshe Lewenstein
• Keywords: Algorithms, Arbitrary Real-sized Scale, Important Problem, Real Scaled Matching, SODA 2000