基于改进SIFT的多光谱图像匹配算法  

Multispectral Image Matching Algorithm Based on Improved SIFT

作　　者：孙雪强 黄旻[1] 张桂峰[1] 赵宝玮[1] 丛麟骁[1,2] SUN Xue-qiang;HUANG Min;ZHANG Gui-feng;ZHAO Bao-wei;ONG Lin-xiao(Key Laboratory of Computation Optical Imaging Technology,Academy of Opto-Electronics,Chinese Academy of Sciences,Beijing 100094,China;College of Materials Science and Optoelectronic Technology,University of Chinese Academy of Sciences,Beijing 100049,China)

机构地区：[1]中国科学院光电研究院计算光学成像技术重点实验室,北京100094 [2]中国科学院大学材料科学与光电技术学院,北京100049

出　　处：《计算机科学》2019年第4期280-284,共5页Computer Science

基　　金：国家自然科学基金(61405203;61405204);中国科学院光电研究院创新项目(Y70B02A11Y)资助

摘　　要：针对多光谱图像在各谱段匹配时需要兼顾速度与精度的问题,文中从以下几个方面对SIFT算法进行了改进。针对SIFT算法中特征描述子的维数过高而导致的匹配速度过慢、匹配率低等问题,通过改进特征描述子的结构来实现对描述子的降维。在SIFT特征匹配方面,根据Hessian矩阵的迹的正负确定特征点是极大值点还是极小值点,为后续特征向量匹配缩小搜索范围;然后根据特征点的位置信息剔除部分匹配点对。实验结果表明,改进算法不仅保留了SIFT算法对旋转和亮度等不变性的优势,而且能够有效减少运行时间,并在一定程度上提高了匹配率。In order to solve the problem that the speed and accuracy need to be taken into account simultaneously when conducting multispectral image matching,this paper improved the SIFT algorithm from the following several aspects.Aiming at the problems such as the slow matching speed and low matching rate caused by high dimension of feature descriptors,this paper improved the structure of feature descriptors to reduce the dimensions of descriptors.In the aspect of SIFT feature matching,firstly,the feature point is determined as the maximum point or minimum point according to the trace of Hessian matrix,which can narrow subsequent search range for the feature vector matching.Then,the partial matching point pairs are eliminated based on the position information of feature points.The experimental results show that the improved algorithm not only preserves the invariance advantages of the traditional algorithm,such as rotation and brightness,but also can effectively reduce the running time,and improve the matching rate on a certain extent.

关 键 词：多光谱图像 SIFT 特征描述子 特征向量匹配 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]