Key point reduction in SIFT descriptor used by subtractive clustering

Reza Javanmard Alitappeh, Kossar Jeddi Saravi, F. Mahmoudi
{"title":"Key point reduction in SIFT descriptor used by subtractive clustering","authors":"Reza Javanmard Alitappeh, Kossar Jeddi Saravi, F. Mahmoudi","doi":"10.1109/ISSPA.2012.6310683","DOIUrl":null,"url":null,"abstract":"The SIFT descriptor is one of the most widely used descriptors and is very stable in regard to changes in rotation, scale, affine, illumination, etc. This method is based on key points extracted from the image. If there are many such points, a lot of time will be needed in the matching and recognition phases. For this reason, we have tried in this article to use the clustering technique in order to reduce the number of key points by omitting similar points. In other words, subtractive clustering is used to select key points which are more distinct from and less similar to other points. In the section on conclusions, a successful implementation of this method is presented. The efficiencies of the proposed algorithm and of the base SIFT algorithm on the data set ALOI were investigated and it was observed that by adding this method to the base SIFT descriptor the rate of recognition increases by two percent and the time complexity decreases by 1.035728 seconds.","PeriodicalId":248763,"journal":{"name":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.2012.6310683","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The SIFT descriptor is one of the most widely used descriptors and is very stable in regard to changes in rotation, scale, affine, illumination, etc. This method is based on key points extracted from the image. If there are many such points, a lot of time will be needed in the matching and recognition phases. For this reason, we have tried in this article to use the clustering technique in order to reduce the number of key points by omitting similar points. In other words, subtractive clustering is used to select key points which are more distinct from and less similar to other points. In the section on conclusions, a successful implementation of this method is presented. The efficiencies of the proposed algorithm and of the base SIFT algorithm on the data set ALOI were investigated and it was observed that by adding this method to the base SIFT descriptor the rate of recognition increases by two percent and the time complexity decreases by 1.035728 seconds.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用减法聚类方法减少SIFT描述符中的关键点
SIFT描述子是应用最广泛的描述子之一,在旋转、尺度、仿射、光照等变化方面都非常稳定。该方法基于从图像中提取的关键点。如果有很多这样的点,在匹配和识别阶段将需要大量的时间。出于这个原因,我们在本文中尝试使用聚类技术,通过省略相似的点来减少关键点的数量。换句话说,使用减法聚类来选择与其他点区别更大,相似度更低的关键点。在结论部分,介绍了该方法的成功实施。研究了该算法和基本SIFT算法在ALOI数据集上的效率,发现将该方法加入到基本SIFT描述符中,识别率提高了2%,时间复杂度降低了1.035728秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Online mvbf adaptation under diffuse noise environments with mimo based noise pre-filtering Hierarchical scheme for Arabic text recognition Precoder selection and rank adaptation in MIMO-OFDM Head detection using Kinect camera and its application to fall detection Wavelength and code division multiplexing toward diffuse optical imaging
×
引用
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