Real Two Dimensional Scaled Matching
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. Scaled matching is an important problem that was originally inspired by Computer Vision.
Finding a combinatorial definition that captures the concept of real scaling in discrete images has been a challenge in the pattern matching field. No definition existed that captured the concept of real scaling in discrete images, without assuming an underlying continuous signal, as done in the image processing field. We present a combinatorial definition for real scaled matching that scales images in a pleasing natural manner. W e also present efficient algorithms for real scaled matching. The running time of our algorithm is as follows. If T is a two-dimensional n ×n text array and P is a m ×m pattern array, we find in T all occurrences of P scaled to any real value in time O(nm 3 + n 2 m log m).
Unable to display preview. Download preview PDF.
- 2.Amir, A., Calinescu, G.: Alphabet independent and dictionary scaled matching. In: Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM 1996), pp. 320–334 (1996)Google Scholar
- 10.Idury, R.M., Schäffer, A.A.: Multiple matching of rectangular Patterns. In: Proc. 25th ACM STOC, pp. 81–89 (1993) Google Scholar
- 15.Pentland, A.: Invited talk. NSF Institutional Infrastructure Workshop (1992)Google Scholar