基于降维的鲁棒模板匹配算法

Q3 Computer Science
Y. Fouda
{"title":"基于降维的鲁棒模板匹配算法","authors":"Y. Fouda","doi":"10.4236/JSIP.2015.62011","DOIUrl":null,"url":null,"abstract":"Template matching is a fundamental problem \nin pattern recognition, which has wide applications, especially in industrial \ninspection. In this paper, we propose a 1-D template matching algorithm which \nis an alternative for 2-D full search block matching algorithms. Our approach \nconsists of three steps. In the first step the images are converted from 2-D \ninto 1-D by summing up the intensity values of the image in two directions \nhorizontal and vertical. In the second step, the template matching is performed \namong 1-D vectors using the similarity function sum of square difference. \nFinally, the decision will be taken based on the value of similarity function. \nTransformation template image and sub-images in the source image from 2-D grey \nlevel information into 1-D information vector reduce the dimensionality of the \ndata and accelerate the computations. Experimental results show that the \ncomputational time of the proposed approach is faster and performance is better \nthan three basic template matching methods. Moreover, our approach is robust to \ndetect the target object with changes of illumination in the template also when \nthe Gaussian noise added to the source image.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"8 1","pages":"109-122"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"A Robust Template Matching Algorithm Based on Reducing Dimensions\",\"authors\":\"Y. Fouda\",\"doi\":\"10.4236/JSIP.2015.62011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Template matching is a fundamental problem \\nin pattern recognition, which has wide applications, especially in industrial \\ninspection. In this paper, we propose a 1-D template matching algorithm which \\nis an alternative for 2-D full search block matching algorithms. Our approach \\nconsists of three steps. In the first step the images are converted from 2-D \\ninto 1-D by summing up the intensity values of the image in two directions \\nhorizontal and vertical. In the second step, the template matching is performed \\namong 1-D vectors using the similarity function sum of square difference. \\nFinally, the decision will be taken based on the value of similarity function. \\nTransformation template image and sub-images in the source image from 2-D grey \\nlevel information into 1-D information vector reduce the dimensionality of the \\ndata and accelerate the computations. Experimental results show that the \\ncomputational time of the proposed approach is faster and performance is better \\nthan three basic template matching methods. Moreover, our approach is robust to \\ndetect the target object with changes of illumination in the template also when \\nthe Gaussian noise added to the source image.\",\"PeriodicalId\":38474,\"journal\":{\"name\":\"Journal of Information Hiding and Multimedia Signal Processing\",\"volume\":\"8 1\",\"pages\":\"109-122\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Hiding and Multimedia Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4236/JSIP.2015.62011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Hiding and Multimedia Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4236/JSIP.2015.62011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 21

摘要

模板匹配是模式识别中的一个基本问题,在工业检测中有着广泛的应用。本文提出了一种一维模板匹配算法,作为二维全搜索块匹配算法的替代方案。我们的方法包括三个步骤。在第一步中,通过将图像在水平和垂直两个方向上的强度值相加,将二维图像转换为一维图像。第二步,利用相似函数差分平方和对1-D向量进行模板匹配。最后,根据相似度函数的值进行决策。将源图像中的模板图像和子图像从二维灰度信息转换为一维信息向量,降低了数据的维数,加快了计算速度。实验结果表明,该方法计算速度快,性能优于三种基本模板匹配方法。此外,当源图像中加入高斯噪声时,我们的方法对模板中光照变化的目标物体也具有鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Robust Template Matching Algorithm Based on Reducing Dimensions
Template matching is a fundamental problem in pattern recognition, which has wide applications, especially in industrial inspection. In this paper, we propose a 1-D template matching algorithm which is an alternative for 2-D full search block matching algorithms. Our approach consists of three steps. In the first step the images are converted from 2-D into 1-D by summing up the intensity values of the image in two directions horizontal and vertical. In the second step, the template matching is performed among 1-D vectors using the similarity function sum of square difference. Finally, the decision will be taken based on the value of similarity function. Transformation template image and sub-images in the source image from 2-D grey level information into 1-D information vector reduce the dimensionality of the data and accelerate the computations. Experimental results show that the computational time of the proposed approach is faster and performance is better than three basic template matching methods. Moreover, our approach is robust to detect the target object with changes of illumination in the template also when the Gaussian noise added to the source image.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.20
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信