.png){kind=icon}
Return
ZNCC-based template matching using bounded partial correlation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2005.03.022.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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). (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
template matching
bounded partial correlation
normalized cross-correlation
NCQ
ZNCC
BPC
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSaveShareSaveDifferences in park characteristic preferences for visitation and physical activity among adolescents: A latent class analysis.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSave
View more