A Fast Template Matching Algorithm with Adaptive Skipping Using Inner-Subtemplates' Distances

Authors:
Takahito Kawanishi;Takayuki Kurozumi;Kunio Kashino;Shigeru Takagi
Affiliations:
NTT Corporation, Japan;NTT Corporation, Japan;NTT Corporation, Japan;NTT Corporation, Japan
Venue:
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Year:
2004

Citing 0
Cited 5

Object detection by color histogram-based fuzzy classifier with support vector learning

Neurocomputing
1-D fast normalized cross-correlation using additions

Digital Signal Processing
Fast crack detection method for large-size concrete surface images using percolation-based image processing

Machine Vision and Applications - Integrated Imaging and Vision Techniques for Industrial Inspection
Exploiting transitivity of correlation for fast template matching

IEEE Transactions on Image Processing
Cooperative template mechanism for cooperative design

CSCWD'05 Proceedings of the 9th international conference on Computer Supported Cooperative Work in Design II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new fast template matching algorithm that skips comparison between a template and search windows neighboring an already compared dissimilar sub-window. Comparison skipping is executed when a lower bound of distance between the template and a window exceeds a threshold. The lower bound of distance between the template and the window is determined by the triangular inequality in distances: the distance between a subtemplate and a subwindow and that between inter-subtemplates. Experimental results demonstrate that the proposed method is up to five times faster than the conventional fast exhaustive search method (Sequential Similarity Detection Algorithm), strictly guaranteeing the same accuracy.