In this paper we propose an efficient normalized cross correlation (NCC) algorithm for partem 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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Wei, S. D., & Lai, S. H. (2007). Efficient normalized cross correlation based on adaptive multilevel successive elimination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4843 LNCS, pp. 638–646). Springer Verlag. https://doi.org/10.1007/978-3-540-76386-4_60
Mendeley helps you to discover research relevant for your work.