模板匹配定位研究與實(shí)現(xiàn)

電子信息工程論文編號(hào):DZXX309  論文字?jǐn)?shù):8341,頁數(shù):15

目錄
摘要 ii
Abstract ii
目錄 iii
第一章 緒論 1
1.1、前言 1
1.2、課題背影 1
1.3、模板匹配的應(yīng)用 2
1.4、研究現(xiàn)狀 2
1.5、文本組織 3
第二章 系統(tǒng)開發(fā)工具簡介 4
2.1、Visual C++ 6.0簡介 4
2.2、Visual C++ 6.0的優(yōu)點(diǎn) 4
2.3、Visual C++ 6.0 MFC類庫 4
2.4、本章小節(jié) 5
第三章  模板匹配算法SSDA算法 6
3.1、SSDA的基本原理 6
3.2、SSDA的基本算法 6
3.3、SSDA的算法步驟與實(shí)現(xiàn) 6
3.4、SSDA三種算法 7
3.4.1、三種算法的共同優(yōu)點(diǎn) 7
3.4.2、三種算法的不同之處 7
3.4.3、結(jié)果分析 8
3.4.4、三種算法的缺點(diǎn) 9
3.5、本章小節(jié) 9
第四章  總結(jié)與展望 9
4.1、總結(jié) 9
4.1.1、全文總結(jié) 9
4.2、存在的不足 10
4.2.2、自身的不足 10
4.1.3、項(xiàng)目的不足 10
4.2、展望 10
第五章　致謝 10
第六章　參考文獻(xiàn) 12
附錄1 13

摘要
 模板匹配是數(shù)字圖像處理中的重要內(nèi)容，它的作用是在原圖像中找到于模板圖像最相近的部分。
 本文對(duì)模板匹配進(jìn)行學(xué)習(xí)和研究，主要介紹了一種快速的匹配算法——SSDA(Sequential Similarity Detection Algorithms)算法。SSDA算法是將模板在原圖上平移比較，平移到最后找出相似度最大的一個(gè)部位，就是我們需要找的。在SSDA算法中用了三個(gè)不同形式的公式進(jìn)行編程，通過對(duì)不同圖像的處理，各個(gè)公式對(duì)圖像處理的時(shí)間和精確度進(jìn)行比較。
 在Microsoft Windows XP平臺(tái)上Visual C++ 6.0開發(fā)環(huán)境下，采用上述方法編制了模板匹配的軟件。實(shí)驗(yàn)證明，該軟件對(duì)于尺寸不大的清晰圖片基本能夠正確定位，并進(jìn)行識(shí)別，典型耗時(shí)為0～3秒鐘。
 最后，本文探討了SSDA算法的方法的優(yōu)缺點(diǎn)，提出了進(jìn)一步工作的方向。

 關(guān)鍵字：圖像匹配  序列相似性  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++