摘要
模板匹配是数字图像处理中的重要内容，它的作用是在原图像中找到于模板图像最相近的部分。
本文对模板匹配进行学习和研究，主要介绍了一种快速的匹配算法——SSDA(Sequential Similarity Detection Algorithms)算法。SSDA算法是将模板在原图上平移比较，平移到最后找出相似度最大的一个部位，就是我们需要找的。在SSDA算法中用了三个不同形式的公式进行编程，通过对不同图像的处理，各个公式对图像处理的时间和精确度进行比较。
在Microsoft Windows XP平台上Visual C++ 6.0开发环境下，采用上述方法编制了模板匹配的软件。实验证明，该软件对于尺寸不大的清晰图片基本能够正确定位，并进行识别，典型耗时为0～3秒钟。
最后，本文探讨了SSDA算法的方法的优缺点，提出了进一步工作的方向。
关键字：图像匹配 序列相似性 SSDA算法 图像模板 VC++
Abstract
The template match is an important content in the digital picture processing; its function lies in finding the part which is closest to the template picture from the original map.
The template match has been studied and researched in this paper, and the emphasis has been put on the SSDA (Sequential Similarity Detection Algorithms) algorithm, which is one kind of fast match algorithm. The SSDA algorithm is to translate and compare the template in the original map, to finally discover the spot which has most greatly similar. Three different forms formulas in the SSDA algorithm have been carried on the programming, and each formula carried on the comparison to the picture processing time and the precision.
In the platform of Microsoft Windows XP and the development environment of Visual C++ 6.0, the software about the template match has been compiled using the above method. The experiment proved that, this software can correctly locate and recognize these kind of pictures which are not big in size but clear with the model time consuming at 0 ~3 seconds in usual.
Finally, the good and bad points of the SSDA algorithm method have been discussed, and the further direction of research has been proposed in this paper.
Key words: Picture match Similar of sequence SSDA algorithm Picture template VC++
