Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Microcomputer Information》 2007-24
Add to Favorite Get Latest Update

Fast Image Matching Algorithm based on Differential Ordinal Array

SHA SHA LIU JINFENG (School of Information Science and Engineering Central University,ChangSha 410083,China)  
To improve the traditional algorithm,a fast image matching method is presented. First,sort the template and differential transform to be function F1(),image which under the template transform to F2() by recurrence sum f(x,y). Second,select the max production of F1() and F2(). Pixels in template are the same in a large number,after sorting and differencing,there are a lot of 0 and 1,so reduce lots of operation about multiplication and addition in template matching algorithm,at the time,using the relativity of the neighbor window to reduce the repeat operation in the process of template moving,compared with the traditional algorithm,it’ s make a big reduce in computational complexity.
【Fund】: 国家自然科学基金资助项目(60573079)
【CateGory Index】: TP391.41
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved