Fast template matching with polynomials

Shinichiro Omachi

doi:10.1109/TIP.2007.901243

Return

Fast template matching with polynomials

2007-08-01

PRE

Shinichiro Omachi *

Masako Omachi

DOI：10.1109/TIP.2007.901243

Original

Original request for help

Save

Abstract

En 中文

Template matching is widely used for many applications in image and signal processing. This paper proposes a novel template matching algorithm, called algebraic template matching. Given a template and an input image, algebraic template matching efficiently calculates similarities between the template and the partial images of the input image, for various widths and heights. The partial image most similar to the template image is detected from the input image for any location, width, and height. In the proposed algorithm, a polynomial that approximates the template image is used to match the input image instead of the template image. The proposed algorithm is effective especially when the width and height of the template image differ from the partial image to be matched. An algorithm using the Legendre polynomial is proposed for efficient approximation of the template image. This algorithm not only reduces computational costs, but also improves the quality of the approximated image. It is shown theoretically and experimentally that the computational cost of the proposed algorithm is much smaller than the existing methods.

Keywords:

algebraic template matching

image processing

object detection

polynomial

template matching

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.