系统工程与电子技术

• 软件、算法与仿真 • 上一篇    下一篇

利用双树复小波变换和SURF的图像配准算法

吴一全1,2,3,陶飞翔1,曹照清1   

  1. 1. 南京航空航天大学电子信息工程学院, 江苏 南京 210016;
    2. 农业部农业信息技术重点实验室, 北京 100081;
    3. 江西省数字国土重点实验室, 江西 南昌 330013
  • 出版日期:2014-05-22 发布日期:2010-01-03

Image registration algorithm based on dual tree complex wavelet transform and SURF

WU Yi-quan1,2,3,TAO Fei-xiang1,CAO Zhao-qing1   

  1. 1. College of Electronic and Information Engineering, Nanjing University of 
    Aeronautics and Astronautics, Nanjing 210016, China;
    2. Key Laboratory of Agricultural Information Technology, Ministry of Agriculture, Beijing 100081, China;3. Jiangxi Province Key Laboratory for Digital Land, East China Institute of Technology, Nanchang 330013, China
  • Online:2014-05-22 Published:2010-01-03

摘要:

为了进一步提高图像配准的运算效率、匹配正确率及配准精度,提出了一种利用双树复小波变换和加速鲁棒特征(speeded up robust features, SURF)的图像配准算法。首先利用双树复小波变换将参考图像和待配准图像分解为低频部分和高频部分,选取其对应的低频部分作为SURF算法的输入图像,得到两者的粗匹配结果;然后通过随机抽样一致(random sample consensus, RANSAC)算法对粗匹配点对进行提纯,剔除误匹配点对,解决了SURF算法存在较多错误匹配点对的问题,同时计算出最佳匹配的变换模型参数;最后根据该变换模型参数对待配准图像进行几何变换,经双线性插值确定灰度,完成图像的配准。大量实验结果表明,与尺度不变特征变换(scale invariant feature transform, SIFT)算法和SURF算法相比,所提算法的运算速度更快,匹配正确率和配准精度更高,同时在抗噪声、抗旋转及抗亮度变化性能方面更加优越。

Abstract:

To further improve the operation efficiency, correct matching rate and registration accuracy of image registration, an image registration algorithm based on dual tree complex wavelet transform and speeded up robust features (SURF) is proposed. Firstly, the standard image and the image to be registered are decomposed into the low and high frequency parts by dual tree complex wavelet transform. The selected corresponding low frequency parts serve as the input image of the SURF algorithm, to obtain the coarse matching results. Then the coarse matching point pairs are purified and the mismatching point pairs are eliminated by the random sample consensus (RANSAC) algorithm. Thus the problem of more mismatching point pairs caused by the SURF algorithm is solved. Meanwhile, the transform model parameters of the optimal matching are calculated. Finally, the geometric transformation of the image to be registered is performed according to the transform model parameters, the gray level is determined by bilinear interpolation, and the image registration is completed. A large number of experimental results show that the proposed algorithm has a higher calculation speed, correct matching rate and registration accuracy than the scale invariant feature transform (SIFT) algorithm and the SURF algorithm. It also performs better in resisting noise, rotation and brightness change.