模板匹配的快速替代方法:ObjectCode方法

Yiping Shen, Shuxiao Li, Chenxu Wang, Hongxing Chang
{"title":"模板匹配的快速替代方法:ObjectCode方法","authors":"Yiping Shen, Shuxiao Li, Chenxu Wang, Hongxing Chang","doi":"10.1109/ACPR.2013.80","DOIUrl":null,"url":null,"abstract":"In this paper an ObjectCode method is presented for fast template matching. Firstly, Local Binary Patterns are adopted to get the patterns for the template and the search image, respectively. Then, a selection strategy is proposed to choose a small portion of pixels (on average 1.87%) from the template, whose patterns are concatenated to form an ObjectCode representing the characteristics of the interested target region. For the candidates in the search image, we get the candidate codes using the selected pixels from the template accordingly. Finally, the similarities between the ObjectCode and the candidate codes are calculated efficiently by a new distance measure based on Hamming distance. Extensive experiments demonstrated that our method is 13.7 times faster than FFT-based template matching and 1.1 times faster than Two-stage Partial Correlation Elimination (TPCE) with similar performances, thus is a fast alternative for current template matching methods.","PeriodicalId":365633,"journal":{"name":"2013 2nd IAPR Asian Conference on Pattern Recognition","volume":"85 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Fast Alternative for Template Matching: An ObjectCode Method\",\"authors\":\"Yiping Shen, Shuxiao Li, Chenxu Wang, Hongxing Chang\",\"doi\":\"10.1109/ACPR.2013.80\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper an ObjectCode method is presented for fast template matching. Firstly, Local Binary Patterns are adopted to get the patterns for the template and the search image, respectively. Then, a selection strategy is proposed to choose a small portion of pixels (on average 1.87%) from the template, whose patterns are concatenated to form an ObjectCode representing the characteristics of the interested target region. For the candidates in the search image, we get the candidate codes using the selected pixels from the template accordingly. Finally, the similarities between the ObjectCode and the candidate codes are calculated efficiently by a new distance measure based on Hamming distance. Extensive experiments demonstrated that our method is 13.7 times faster than FFT-based template matching and 1.1 times faster than Two-stage Partial Correlation Elimination (TPCE) with similar performances, thus is a fast alternative for current template matching methods.\",\"PeriodicalId\":365633,\"journal\":{\"name\":\"2013 2nd IAPR Asian Conference on Pattern Recognition\",\"volume\":\"85 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 2nd IAPR Asian Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACPR.2013.80\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 2nd IAPR Asian Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACPR.2013.80","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种用于快速模板匹配的ObjectCode方法。首先,采用局部二值模式分别得到模板和搜索图像的模式;然后,提出了一种选择策略,从模板中选择一小部分像素(平均1.87%),将这些像素的模式拼接成一个ObjectCode,该ObjectCode表示感兴趣的目标区域的特征。对于搜索图像中的候选图像,我们使用从模板中选择的像素相应地获得候选代码。最后,通过一种基于汉明距离的距离度量,有效地计算出目标码与候选码之间的相似度。大量实验表明,该方法比基于fft的模板匹配快13.7倍,比两阶段偏相关消除(TPCE)方法快1.1倍,性能相似,是当前模板匹配方法的快速替代方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Fast Alternative for Template Matching: An ObjectCode Method
In this paper an ObjectCode method is presented for fast template matching. Firstly, Local Binary Patterns are adopted to get the patterns for the template and the search image, respectively. Then, a selection strategy is proposed to choose a small portion of pixels (on average 1.87%) from the template, whose patterns are concatenated to form an ObjectCode representing the characteristics of the interested target region. For the candidates in the search image, we get the candidate codes using the selected pixels from the template accordingly. Finally, the similarities between the ObjectCode and the candidate codes are calculated efficiently by a new distance measure based on Hamming distance. Extensive experiments demonstrated that our method is 13.7 times faster than FFT-based template matching and 1.1 times faster than Two-stage Partial Correlation Elimination (TPCE) with similar performances, thus is a fast alternative for current template matching methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic Compensation of Radial Distortion by Minimizing Entropy of Histogram of Oriented Gradients A Robust and Efficient Minutia-Based Fingerprint Matching Algorithm Sclera Recognition - A Survey A Non-local Sparse Model for Intrinsic Images Classification Based on Boolean Algebra and Its Application to the Prediction of Recurrence of Liver Cancer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1