基于SURF特征的图像匹配算法研究

2012 International Conference on Computer Science and Information Processing (CSIP) Pub Date : 2012-09-24 DOI:10.1109/CSIP.2012.6309059

Dong Hui, H. Yuan

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

引用次数: 26

摘要

以往的图像匹配采用基于SIFT的算法，计算量大，时间效率低。本文采用SURF算法对兴趣点进行检测和描述，并采用高效率的kd树最近邻搜索方法对兴趣点进行匹配。实验结果表明，该方法具有良好的时间效率和鲁棒性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 International Conference on Computer Science and Information Processing (CSIP)

自引率

0.00%

发文量