Real Two Dimensional Scaled Matching

摘要: Scaled Matching refers to the problem of finding all locations in text where pattern, proportionally enlarged according an arbitrary real-sized scale, appears. matching is important that was originally inspired by Computer Vision. Finding a combinatorial definition captures concept real scaling discrete images has been challenge pattern field. No existed captured images, without assuming underlying continuous signal, as done image processing We present for scaled scales pleasing natural manner. also efficient algorithms matching. The running times our are follows. For T, two-dimensional n×n array, and P, m×m we find in T occurrences P any value time O(nm 3+n 2 mlog m).