Cart (Loading....) | Create Account
Close category search window
 

An efficient algorithm for exhaustive template matching based on normalized cross correlation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Di Stefano, L. ; DEIS-ARCES, Bologna Univ., Italy ; Mattoccia, S. ; Mola, M.

This work proposes a novel technique aimed at improving the performance of exhaustive template matching based on the normalized cross correlation (NCC). An effective sufficient condition, capable of rapidly pruning those match candidates that could not provide a better cross correlation score with respect to the current best candidate, can be obtained exploiting an upper bound of the NCC function. This upper bound relies on partial evaluation of the crosscorrelation and can be computed efficiently, yielding a significant reduction of operations compared to the NCC function and allows for reducing the overall number of operations required to carry out exhaustive searches. However, the bounded partial correlation (BPC) algorithm turns out to be significantly data dependent. In this paper we propose a novel algorithm that improves the overall performance of BPC thanks to the deployment of a more selective sufficient condition which allows for rendering the algorithm significantly less data dependent. Experimental results with real images and actual CPU time are reported.

Published in:

Image Analysis and Processing, 2003.Proceedings. 12th International Conference on

Date of Conference:

17-19 Sept. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.