雀巢:通过嵌套圈提取兴趣点

Erhan Gundogdu, Aydin Alatan
{"title":"雀巢:通过嵌套圈提取兴趣点","authors":"Erhan Gundogdu, Aydin Alatan","doi":"10.1109/SIU.2012.6204540","DOIUrl":null,"url":null,"abstract":"A novel low complexity feature extraction algorithm, only performing by a single comparison per pixel on the average during detection is proposed. While single-scale version of the algorithm remains quite efficient compared against the complexity of the state-of-the-art algorithms, a multi-scale version is also proposed to handle blur and scale changes. The performance tests on the repeatability of these keypoints signify the promising performance of the proposed algorithm to be used in many resource limited computer vision applications due to its efficiency and competitive repeatability performance.","PeriodicalId":256154,"journal":{"name":"2012 20th Signal Processing and Communications Applications Conference (SIU)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nestle: Interest point extraction via nested circles\",\"authors\":\"Erhan Gundogdu, Aydin Alatan\",\"doi\":\"10.1109/SIU.2012.6204540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel low complexity feature extraction algorithm, only performing by a single comparison per pixel on the average during detection is proposed. While single-scale version of the algorithm remains quite efficient compared against the complexity of the state-of-the-art algorithms, a multi-scale version is also proposed to handle blur and scale changes. The performance tests on the repeatability of these keypoints signify the promising performance of the proposed algorithm to be used in many resource limited computer vision applications due to its efficiency and competitive repeatability performance.\",\"PeriodicalId\":256154,\"journal\":{\"name\":\"2012 20th Signal Processing and Communications Applications Conference (SIU)\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 20th Signal Processing and Communications Applications Conference (SIU)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIU.2012.6204540\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 20th Signal Processing and Communications Applications Conference (SIU)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2012.6204540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种新的低复杂度特征提取算法,在检测过程中平均每像素只进行一次比较。虽然与最先进的算法的复杂性相比,该算法的单尺度版本仍然相当有效,但还提出了一个多尺度版本来处理模糊和尺度变化。对这些关键点可重复性的性能测试表明,该算法由于其效率和具有竞争力的可重复性性能,在许多资源有限的计算机视觉应用中具有良好的应用前景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nestle: Interest point extraction via nested circles
A novel low complexity feature extraction algorithm, only performing by a single comparison per pixel on the average during detection is proposed. While single-scale version of the algorithm remains quite efficient compared against the complexity of the state-of-the-art algorithms, a multi-scale version is also proposed to handle blur and scale changes. The performance tests on the repeatability of these keypoints signify the promising performance of the proposed algorithm to be used in many resource limited computer vision applications due to its efficiency and competitive repeatability performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信