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