Efficient variable size template matching using fast normalized cross correlation on multicore processors

  • Authors:

  • Durgaprasad Gangodkar;Sachin Gupta;Gurbinder Singh Gill;Padam Kumar;Ankush Mittal

  • Affiliations:

  • Dept. of Electronics and Computer Engg., Indian Institute of Technology Roorkee, Roorkee, India;Dept. of Electronics and Computer Engg., Indian Institute of Technology Roorkee, Roorkee, India;Dept. of Electronics and Computer Engg., Indian Institute of Technology Roorkee, Roorkee, India;Dept. of Electronics and Computer Engg., Indian Institute of Technology Roorkee, Roorkee, India;Dept. of Computer Science and Engg., Graphic Era University, Dehradun, India

  • Venue:
  • ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Normalized Cross Correlation (NCC) is an efficient and robust way for finding the location of a template in given image. However NCC is computationally expensive. Fast normalized cross correlation (FNCC) makes use of pre-computed sum-tables to improve the computational efficiency of NCC. In this paper we propose a strategy for parallel implementation of FNCC algorithm using NVIDIA's Compute Unified Device Architecture (CUDA) for real-time template matching. We also present an approach to make proposed method adaptable to variable size templates which is an important challenge to tackle. Efficient parallelization strategies, adopted for pre-computing sum-tables and extracting data parallelism by dividing the image into series of blocks, substantially reduce required computational time. We show that by optimal utilization of different memories available on multicore architecture and exploiting the asynchronous nature of CUDA kernel calls we can obtain speedup of the order 17X as compared to the sequential implementation.