Computer Engineering and Applications ›› 2015, Vol. 51 ›› Issue (13): 149-152.

Previous Articles     Next Articles

Improved of SIFT matching algorithm based on main gradient of direction

LEI Junfeng, ZHU Yueling, XIAO Jinsheng, GUO Yong, ZHANG Cun   

  1. School of Electronic Information, Wuhan University, Wuhan 430072, China
  • Online:2015-07-01 Published:2015-06-30


雷俊锋,朱月苓,肖进胜,郭  勇,张  存   

  1. 武汉大学 电子信息学院,武汉 430072

Abstract: In matching image with many similar regions, the original image matching algorithm(KDtree-BBF) based on SIFT(Scale Invariant Feature Transform) is complex, time-consuming, it is difficult to meet the real-time requirement. To overcome the shortcomings above, an improved algorithm is proposed. The method identifies the main gradient of direction of neighbor feature points as one of the features, which is combined with the distance similarity matching for matching. Experimental results show that the proposed algorithm not only is simple but also has a good robustness on the conditions of image rotating, zooming and lighting transformation. Compared with the original OpenSIFT algorithm, the improved algorithm speedup ratio is in the range of 1.046~9.065.

Key words: image matching, Scale Invariant Feature Transform(SIFT), main gradient of direction, robustness

摘要: 在相似区域较多的图像匹配时,SIFT(Scale Invariant Feature Transform)算法的匹配计算(KDtree-BBF)较复杂,耗时长,很难满足实时性要求。提出一种改进的匹配算法,将特征点的周围邻域的主方向梯度作为特征之一,采用主方向梯度和欧式距离相结合的计算方法进行特征点的匹配。实验结果表明:改进的算法不仅简单易行,且对图像的旋转、缩放、光照变换均具有良好的鲁棒性,比较原OpenSIFT算法还发现,改进算法的加速比范围为1.046~9.065。

关键词: 图像匹配, SIFT算子, 主方向梯度, 鲁棒性