Efficient Algorithms for Image Template and Dictionary Matching

Given a large text image and a small template image, the Template Matching Problem is that of finding every location within the text which looks like the pattern. This problem, which has received attention for low-level image processing, has been formalized by defining a distance metric between arrays of pixels and finding all subarrays of the large image which are within some threshold distance of the template. These so-called metric methods tends to be too slow for many applications, since evaluating the distance function can take too much time. We present a method for quickly eliminating most positions of the text from consideration as possible matches. The remaining candidate positions are then evaluated one by one against the template for a match. We are still guaranteed to find all matching positions, and our method gives significant speed-ups. Finally, we consider the problem of matching a dictionary of templates against a text. We present methods which are much faster than matching the templates individually against the input image.

[1]  Ramesh C. Jain,et al.  Similarity measures for image databases , 1995, Electronic Imaging.

[2]  R. C. Thomas,et al.  Computer Vision: A First Course , 1988 .

[3]  Robert Yut Wong.  Sequential pattern recognition as applied to scene matching. , 1977 .

[4]  Alan J. Broder.  Strategies for efficient incremental nearest neighbor search , 1990, Pattern Recognit..

[5]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.

[6]  Tzi-cker Chiueh,et al.  Content-Based Image Indexing , 1994, VLDB.

[7]  Belur V. Dasarathy,et al.  Nearest neighbor (NN) norms: NN pattern classification techniques , 1991 .

[8]  Heinrich Niemann,et al.  An efficient branch-and-bound nearest neighbour classifier , 1988, Pattern Recognition Letters.

[9]  Hampapuram K. Ramapriyan.  A Multilevel Approach to Sequential Detection of Pictorial Features , 1976, IEEE Transactions on Computers.

[10]  Dragutin Petkovic,et al.  Query by Image and Video Content: The QBIC System , 1995, Computer.

[11]  William K. Pratt,et al.  Correlation Techniques of Image Registration , 1974, IEEE Transactions on Aerospace and Electronic Systems.

[12]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[13]  András Faragó,et al.  Fast Nearest-Neighbor Search in Dissimilarity Spaces , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Wayne Niblack,et al.  An introduction to digital image processing , 1986 .

[15]  Song B. Park,et al.  A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Harvey F. Silverman,et al.  A Class of Algorithms for Fast Digital Image Registration , 1972, IEEE Transactions on Computers.