Two-Dimensional Scaled Pattern Matching

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

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 ...
Original languageAmerican English
Title of host publicationEncyclopedia of Algorithms
EditorsMing-Yang Kao Professor of Computer Science
PublisherSpringer US
Pages982-985
ISBN (Print)978-0-387-30162-4
StatePublished - 2008

Fingerprint

Dive into the research topics of 'Two-Dimensional Scaled Pattern Matching'. Together they form a unique fingerprint.

Cite this