期刊文献+

A Sequence Image Matching Method Based on Improved High-Dimensional Combined Features 被引量:2

A Sequence Image Matching Method Based on Improved High-Dimensional Combined Features
下载PDF
导出
摘要 Image matching technology is theoretically significant and practically promising in the field of autonomous navigation.Addressing shortcomings of existing image matching navigation technologies,the concept of high-dimensional combined feature is presented based on sequence image matching navigation.To balance between the distribution of high-dimensional combined features and the shortcomings of the only use of geometric relations,we propose a method based on Delaunay triangulation to improve the feature,and add the regional characteristics of the features together with their geometric characteristics.Finally,k-nearest neighbor(KNN)algorithm is adopted to optimize searching process.Simulation results show that the matching can be realized at the rotation angle of-8°to 8°and the scale factor of 0.9 to 1.1,and when the image size is 160 pixel×160 pixel,the matching time is less than 0.5 s.Therefore,the proposed algorithm can substantially reduce computational complexity,improve the matching speed,and exhibit robustness to the rotation and scale changes. Image matching technology is theoretically significant and practically promising in the field of autonomous navigation.Addressing shortcomings of existing image matching navigation technologies,the concept of high-dimensional combined feature is presented based on sequence image matching navigation.To balance between the distribution of high-dimensional combined features and the shortcomings of the only use of geometric relations,we propose a method based on Delaunay triangulation to improve the feature,and add the regional characteristics of the features together with their geometric characteristics.Finally,k-nearest neighbor(KNN)algorithm is adopted to optimize searching process.Simulation results show that the matching can be realized at the rotation angle of-8°to 8°and the scale factor of 0.9 to 1.1,and when the image size is 160 pixel×160 pixel,the matching time is less than 0.5 s.Therefore,the proposed algorithm can substantially reduce computational complexity,improve the matching speed,and exhibit robustness to the rotation and scale changes.
出处 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2018年第5期820-828,共9页 南京航空航天大学学报(英文版)
基金 supported by the National Natural Science Foundations of China(Nos.51205193,51475221)
关键词 SEQUENCE image MATCHING navigation DELAUNAY TRIANGULATION HIGH-DIMENSIONAL combined feature k-nearest NEIGHBOR sequence image matching navigation Delaunay triangulation high-dimensional combined feature k-nearest neighbor
  • 相关文献

参考文献3

二级参考文献99

共引文献27

同被引文献7

引证文献2

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部