基于削减搜索分支的快速模板匹配算法

提出了一种在完全搜索中寻找最优匹配点的模板匹配算法。它首先为图像建立一种类似金字塔的特殊层次结构。利用该结构的特点，削减匹配中无用的搜索分支，以达到提高处理效率的目的。通过该算法找到了完全搜索的最优匹配点，实验结果证明了它可以大大提高处理的效率。

A Fast Algorithm for Template Matching Based on Search Branches Pruning

This paper proposes a fast template matching algorithm. The exact best matching may be found by a full search. A particular image hierarchy like pyramid is constructed for template and search map. People can get a list of ascending lower bound of minimum matching error and cut the useless search branch to get higher efficiency by the list of lower bound. This algorithm ensures finding a best matching of full search. The results demonstrate the effectiveness of the method.