Translator Disclaimer
20 March 2001 Template matching using fast normalized cross correlation
Kai Briechle, Uwe D. Hanebeck
Author Affiliations +
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.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kai Briechle and Uwe D. Hanebeck "Template matching using fast normalized cross correlation", Proc. SPIE 4387, Optical Pattern Recognition XII, (20 March 2001);

Cited by 397 scholarly publications.

Full-Frame Image Registration By Address Modification
Proceedings of SPIE (September 04 1979)
SAR processing using SHARC signal processing systems
Proceedings of SPIE (September 18 1998)
Real-time vision-based automatic push button system
Proceedings of SPIE (April 03 1997)
Real-time development system for image processing engines
Proceedings of SPIE (February 04 2009)
Real Time Movement Detection An Algorithm For The...
Proceedings of SPIE (November 01 1989)

Back to Top