Two-Dimensional Scaled Pattern Matching

Problem Definition Definition 1 Let T be a two-dimensional n×nn×n array over some alphabet Σ. 1. The unit pixels array for T (T1X) consists of n2 unit squares, called pixels in the real plane R2ℜ2. The corners of the pixel T[i,j]T[i,j] are (i−1,j−1),(i,j−1),(i−1,j),(i−1,j−1),(i,j−1),(i−1,j), and (i,j)(i,j). Hence the pixels of T form a regular n×nn×n array that covers the area between (0,0),(n,0),(0,n),(0,0),(n,0),(0,n), and (n,n)(n,n). Point (0,0)(0,0) is the origin of the unit pixel array. The center of each pixel is the geometric center point of its square location. Each pixel T[i,j]T[i,j] is identified with the value from Σ that the original array T had in that pos ...