Template Matching

The inputs to the image template matching problem are an N×N image matrix I[0..N − 1, 0..N − 1] and an M×M template T[O..M − 1, 0..M − 1]. The output is an N×N matrix C 2D where $$ C2D\left[ {i,j} \right] = \sum\limits_{u = 0}^{M - 1} {\sum\limits_{v = 0}^{M - 1} {I[(i + u)mod} } N,(j + v)modN]*T[u,v],0 \le i,j < N $$C 2D is called the two dimensional convolution of I and T. Template matching, i.e., computing C 2D, is a fundamental operation in computer vision and image processing. It is often used for edge and object detection; filtering; and image registration (Rosenfeld and Kak 1982, and Ballard and Brown 1985).