This paper proposes an algorithm for efficient and exhaustive template matching based on the Zero mean Normalized Cross Correlation (ZNCC) function. The algorithm consists in checking at each position a sufficient condition capable of rapidly skipping most of the expensive calculations involved in the evaluation of ZNCC scores at those points that cannot improve the best score found so far. The sufficient condition devised in this paper extends the concept of Bounded Partial Correlation (BPC) from Normalized Cross Correlation (NCC) to the more robust ZNCC function. Experimental results show that the proposed technique is effective in speeding up the standard procedure and that the behavior, in term of computational savings, follows that obtained by the BPC technique in the NCC case.

L. Di Stefano, S. Mattoccia, F. Tombari (2004). An Algorithm for Efficient and Exhaustive Template Matching. BERLIN : SPRINGER [10.1007/978-3-540-30125-7_51].

An Algorithm for Efficient and Exhaustive Template Matching

DI STEFANO, LUIGI;MATTOCCIA, STEFANO;TOMBARI, FEDERICO
2004

Abstract

This paper proposes an algorithm for efficient and exhaustive template matching based on the Zero mean Normalized Cross Correlation (ZNCC) function. The algorithm consists in checking at each position a sufficient condition capable of rapidly skipping most of the expensive calculations involved in the evaluation of ZNCC scores at those points that cannot improve the best score found so far. The sufficient condition devised in this paper extends the concept of Bounded Partial Correlation (BPC) from Normalized Cross Correlation (NCC) to the more robust ZNCC function. Experimental results show that the proposed technique is effective in speeding up the standard procedure and that the behavior, in term of computational savings, follows that obtained by the BPC technique in the NCC case.
2004
Image Analysis and Recognition. International Conference, ICIAR 2004, Proceedings, Part II.
408
415
L. Di Stefano, S. Mattoccia, F. Tombari (2004). An Algorithm for Efficient and Exhaustive Template Matching. BERLIN : SPRINGER [10.1007/978-3-540-30125-7_51].
L. Di Stefano; S. Mattoccia; F. Tombari
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/6083
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 8
social impact