title: Fast full-search equivalent template matching by enhanced bounded correlation.
abstract: We propose a novel algorithm, referred to as enhanced bounded correlation (EBC), that significantly reduces the number of computations required to carry out template matching based on normalized cross correlation (NCC) and yields exactly the same result as the full search algorithm. The algorithm relies on the concept of bounding the matching function: finding an efficiently computable upper bound of the NCC rapidly prunes those candidates that cannot provide a better NCC score with respect to the current best match. In this framework, we apply a succession of increasingly tighter upper bounding functions based on Cauchy-Schwarz inequality. Moreover, by including an online parameter prediction step into EBC, we obtain a parameter free algorithm that, in most cases, affords computational advantages very similar to those attainable by optimal offline parameter tuning. Experimental results show that the proposed algorithm can significantly accelerate a full-search equivalent template matching process and outperforms state-of-the-art methods.
authors.affiliation: Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, Bologna, Italy. steffano.mattoccia@unibo.it
authors.forename: S
authors.initials: S
authors.lastname: Mattoccia
authors.forename: F
authors.initials: F
authors.lastname: Tombari
authors.forename: L
authors.initials: L
authors.lastname: Di Stefano
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D012815:Signal Processing, Computer-Assisted; D013223:Statistics as Topic; D013382:Subtraction Technique