Affiliation:
1. Bar-Ilan University and Georgia Tech, Department of Computer Science, 52900 Ramat-Gan, Israel
Abstract
We review some pattern matching algorithms and techniques motivated by the discrete theory of image processing. The problem inspiring this research is that of searching an aerial photograph for all appearances of some object. The issues we discuss are digitization, local errors, rotation and scaling. We review deterministic serial techniques that were used for multidimensional pattern matching and discuss their strengths and weaknesses. We introduce the new geometric model that has been recently found to be extremely suitable for the theory of discrete image processing. We introduce some of the new algorithms developed in the geometric model and show their capability of efficiently solving hitherto open problems.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Multidimensional String Matching;Encyclopedia of Algorithms;2016
2. Multidimensional String Matching;Encyclopedia of Algorithms;2015
3. Multidimensional String Matching;Encyclopedia of Algorithms;2008