Talk:Template matching

	This article is within the scope of WikiProject Computer graphics, a collaborative effort to improve the coverage of computer graphics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer graphicsWikipedia:WikiProject Computer graphicsTemplate:WikiProject Computer graphicscomputer graphics articles
Low	This article has been rated as Low-importance on the project's importance scale.

"We then simply move the center (or the origin) of the template T(x t, y t) over each (x, y) point in the search image and calculate the sum of products between the coefficients in S(x, y) and T(xt, yt) over the whole area spanned by the template."

How is this different from cross-correlation? or what Wikipedia calls Phase correlation?

"Other methods which are similar include 'Stereo matching,' 'Image registration' and 'Scale-invariant feature transform.'"

Isn't this a form of image registration? Not a "similar method".

Issue: The section "Template-based matching and convolution" points to convolution in (the mathematical definition) but the elaborated example -algorithm and formulas- are not related to convolution at all! — Preceding unsigned comment added by Carlosayam (talk • contribs) 07:45, 1 August 2013 (UTC)[reply]

Difference to Block-matching algorithms

Template matching seems to be synonymous to block matching. If so, shouldn't the articles be merged? Otherwise the difference should be made clearer. Does anyone know whether there is a difference? — Preceding unsigned comment added by 89.13.27.200 (talk) 16:20, 25 June 2017 (UTC)[reply]