Summary: Multidimensional Pattern
Matching: A Survey
Amihood Amir \Lambda
GIT--CC--92/29
July 1992
Abstract
We review some recent algorithms motivated by computer vision.
The problem inspiring this research is that of searching an aerial photograph for all ap­
pearances of some object.
The issues we discuss are local errors, scaling, compression and dictionary matching.
We review deterministic serial techniques that are used for multidimensional pattern match­
ing and discuss their strengths and weaknesses.
College of Computing
Georgia Institute of Technology
Atlanta, Georgia 30332--0280
\Lambda Paritally supported by NSF grant IRI­9013055.

1 Motivation
String Matching is one of the most widely studied problems in computer science [Gal85]. Part of
its appeal is in its direct applicability to ``real world'' problems. The Knuth­Morris­Pratt [KMP77]

Source: Amir, Amihood - Computer Science Department, Bar Ilan University

Collections: Mathematics