• DocumentCode
    1653834
  • Title

    Fast two-dimensional template matching with fixed aspect ratio based on polynomial approximation

  • Author

    Omachi, Masako ; Omachi, Shinichiro

  • Author_Institution
    Fac. of Sci. & Technol., Tohoku Bunka Gakuen Univ., Sendai
  • fYear
    2008
  • Firstpage
    757
  • Lastpage
    760
  • Abstract
    Template matching is one of the fundamental techniques for signal and image processing. It has many applications such as detection, recognition, registration, retrieval, etc. One of the drawbacks of the template matching is the high computational complexity. In this paper, we focus on the two-dimensional image template matching with fixed aspect ratio and propose a method for speeding up the calculation. In the proposed method, a template is approximated by a polynomial in advance. Given an input image, the normalized cross correlations of the template and the regions of the input image are calculated efficiently with the polynomial. Experimental results using various sizes of images show the effectiveness of the proposed method.
  • Keywords
    computational complexity; image matching; polynomial approximation; computational complexity; fast two-dimensional image template matching; fixed aspect ratio; image processing; polynomial approximation; signal processing; Computational complexity; Computational efficiency; Image processing; Polynomials; Quantization; Signal processing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing, 2008. ICSP 2008. 9th International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-2178-7
  • Electronic_ISBN
    978-1-4244-2179-4
  • Type

    conf

  • DOI
    10.1109/ICOSP.2008.4697240
  • Filename
    4697240