节点文献

适应不完整目标的快速模板匹配

Fast Template Matching for Incomplete Target

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 邓泽峰熊有伦黄小鹏

【Author】 DENG Ze-feng1,2,XIONG You-lun1,HUANG Xiao-peng2 ( 1. School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China; 2. Eastcompeace Smart Card Co, Ltd, Zhuhai 519060, Guangdong Province, China )

【机构】 华中科技大学机械科学与工程学院东信和平智能卡股份有限公司

【摘要】 针对不完整目标的查找,提出一种基于分块统计的快速模板匹配算法。将模板和待匹配图像区域划分成尺寸相同的若干方块,首先采用绝对距离度量分块中对应像素的像素匹配度,接着运用统计的方法依次确定块匹配度和目标匹配度。为加快算法运算速度,在图像遍历过程中构建金字塔结构进行分层搜索。实验结果表明,该算法可准确定位完整和不完整目标,运算时间保持在毫秒级,并具有很强的抗噪声能力。

【Abstract】 A novel fast template matching algorithm for incomplete target searching based on block statistics was presented. This algorithm divided the template and the candidate image into several blocks with the same size. Absolute distance was used to calculate the pixel matching degree between the corresponding pixels. Then, the block matching degree and the target matching degree were proposed by statistical method. In order to speed up the searching process, the pyramid of the multi-level images was built. Experimental results demonstrate that the proposed algorithm performs well on locating both the complete targets and non-complete ones. The execution time is limited to several milliseconds and the algorithm has strong noise immunity.

【基金】 国家自然科学基金重点项目“大型复杂曲面零件的数字化设计-加工-测量一体化理论与技术”(50835004)
  • 【文献出处】 光电工程 ,Opto-Electronic Engineering , 编辑部邮箱 ,2010年05期
  • 【分类号】TP391.41
  • 【被引频次】11
  • 【下载频次】211
节点文献中: 

本文链接的文献网络图示:

本文的引文网络