{"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}
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.