{"title":"基于SURF特征的图像匹配算法研究","authors":"Dong Hui, H. Yuan","doi":"10.1109/CSIP.2012.6309059","DOIUrl":null,"url":null,"abstract":"Previous images matching uses algorithm based on SIFT which has lots of calculating works and low time-efficiency. In this paper, we use SURF algorithm to detect and descript the interest points, and match the interest points by using high time-efficient KD-tree nearest neighbor searching method. The experimental result shows that it has good time efficiency and excellent robustness.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"Research of image matching algorithm based on SURF features\",\"authors\":\"Dong Hui, H. Yuan\",\"doi\":\"10.1109/CSIP.2012.6309059\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Previous images matching uses algorithm based on SIFT which has lots of calculating works and low time-efficiency. In this paper, we use SURF algorithm to detect and descript the interest points, and match the interest points by using high time-efficient KD-tree nearest neighbor searching method. The experimental result shows that it has good time efficiency and excellent robustness.\",\"PeriodicalId\":193335,\"journal\":{\"name\":\"2012 International Conference on Computer Science and Information Processing (CSIP)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Computer Science and Information Processing (CSIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSIP.2012.6309059\",\"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 International Conference on Computer Science and Information Processing (CSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSIP.2012.6309059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research of image matching algorithm based on SURF features
Previous images matching uses algorithm based on SIFT which has lots of calculating works and low time-efficiency. In this paper, we use SURF algorithm to detect and descript the interest points, and match the interest points by using high time-efficient KD-tree nearest neighbor searching method. The experimental result shows that it has good time efficiency and excellent robustness.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
