In this paper we propose an efficient normalized cross correlation (NCC) algorithm for pattern matching based on adaptive multilevel successive elimination. This successive elimination scheme is applied in conjunction with an upper bound for the cross correlation derived from Cauchy-Schwarz inequality. To apply the successive elimination, we partition the summation of cross correlation into different levels with the partition order determined by the gradient energies of the partitioned regions in the template. Thus, this adaptive multi-level successive elimination scheme can be employed to early reject most candidates to reduce the computational cost. Experimental results show the proposed algorithm is very efficient for pattern matching under different lighting conditions.
Efficient Normalized Cross Correlation Based on Adaptive Multilevel Successive Elimination
Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007
2007-01-01
9 pages
Article/Chapter (Book)
Electronic Resource
English
Pattern matching , normalized cross correlation , successive eliminat-ion , multi-level successive elimination , fast algorithms Computer Science , Image Processing and Computer Vision , Computer Imaging, Vision, Pattern Recognition and Graphics , Pattern Recognition , Artificial Intelligence , Biometrics , Algorithm Analysis and Problem Complexity
An Efficient Algorithm for Exhaustive Template Matching Based on Normalized Cross Correlation
British Library Conference Proceedings | 2003
|Normalized cross correlation computation for geometry image features
British Library Online Contents | 2008
|Computer-based integrated imaging using normalized cross-correlation for resolution enhancement
British Library Online Contents | 2007
|