Summary: Multidimensional Pattern
Matching: A Survey
Amihood Amir \Lambda
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 IRI9013055.
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 KnuthMorrisPratt [KMP77]