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