This paper describes a class of algorithms enabling efficient and exhaustive matching of a template into an image based on the Zero mean Normalized Cross-Correlation function (ZNCC). The approach consists in checking at each image position two sufficient conditions obtained at a reduced computational cost. This allows to skip rapidly most of the expensive calculations required to evaluate the ZNCC at those image points that cannot improve the best correlation score found so far. The algorithms shown in this paper generalize and extend the concept of Bounded Partial Correlation (BPC), previously devised for a template matching process based on the Normalized Cross-Correlation function (NCC).
L. Di Stefano, S. Mattoccia, F. Tombari (2005). ZNCC-based Template Matching using Bounded Partial Correlation. PATTERN RECOGNITION LETTERS, VOl. 26, No. 14, 2129-2134 [10.1016/j.patrec.2005.03.022].
ZNCC-based Template Matching using Bounded Partial Correlation
DI STEFANO, LUIGI;MATTOCCIA, STEFANO;TOMBARI, FEDERICO
2005
Abstract
This paper describes a class of algorithms enabling efficient and exhaustive matching of a template into an image based on the Zero mean Normalized Cross-Correlation function (ZNCC). The approach consists in checking at each image position two sufficient conditions obtained at a reduced computational cost. This allows to skip rapidly most of the expensive calculations required to evaluate the ZNCC at those image points that cannot improve the best correlation score found so far. The algorithms shown in this paper generalize and extend the concept of Bounded Partial Correlation (BPC), previously devised for a template matching process based on the Normalized Cross-Correlation function (NCC).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.