Template matching using fast normalized cross correlation

Kai Briechle; Uwe D. Hanebeck

doi:10.1117/12.421129

Translator Disclaimer

20 March 2001 Template matching using fast normalized cross correlation

Kai Briechle, Uwe D. Hanebeck

Author Affiliations +

Proceedings Volume 4387, Optical Pattern Recognition XII; (2001) https://doi.org/10.1117/12.421129
Event: Aerospace/Defense Sensing, Simulation, and Controls, 2001, Orlando, FL, United States

Abstract

In this paper, we present an algorithm for fast calculation of the normalized cross correlation and its application to the problem of template matching. Given a template t, whose position is to be determined in an image f, the basic idea of the algorithm is to represent the template, for which the normalized cross correlation is calculated, as a sum of rectangular basis functions. Then the correlation is calculated for each basis function instead of the whole template. The result of the correlation of the template t and the image f is obtained as the weighted sum of the correlation functions of the basis functions. Depending on the approximation, the algorithm can by far outperform Fourier-transform based implementations of the normalized cross correlation algorithm and it is especially suited to problems, where many different templates are to be found in the same image f.

Citation Download Citation

Kai Briechle and Uwe D. Hanebeck "Template matching using fast normalized cross correlation", Proc. SPIE 4387, Optical Pattern Recognition XII, (20 March 2001); https://doi.org/10.1117/12.421129

ACCESS THE FULL ARTICLE