Machine Vision and Applications

, Volume 13, Issue 4, pp 213–221 | Cite as

Fast template matching using bounded partial correlation

  • Luigi Di Stefano
  • Stefano Mattoccia
Original paper

Abstract.

This paper describes a novel, fast template-matching technique, referred to as bounded partial correlation (BPC), based on the normalised cross-correlation (NCC) function. The technique consists in checking at each search position a suitable elimination condition relying on the evaluation of an upper-bound for the NCC function. The check allows for rapidly skipping the positions that cannot provide a better degree of match with respect to the current best-matching one. The upper-bounding function incorporates partial information from the actual cross-correlation function and can be calculated very efficiently using a recursive scheme. We show also a simple improvement to the basic BPC formulation that provides additional computational benefits and renders the technique more robust with respect to the parameters choice.

Key words: Template matching – Pattern matching – Normalised cross-correlation – SEA – PDE 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Luigi Di Stefano
    • 1
  • Stefano Mattoccia
    • 1
  1. 1.DEIS-ARCES, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy (e-mail: {ldistefano,smattoccia}@deis.unibo.it) IT

Personalised recommendations