欢迎访问《图学学报》 分享到:

图学学报

• 图像与视频处理 • 上一篇    下一篇

一种改进的SAR 与可见光图像的快速配准算法

  

  1. 张皖南1,2, 杨学志1,2, 董张玉1,2
  • 出版日期:2018-04-30 发布日期:2018-04-30
  • 基金资助:
    国家自然科学基金项目(61371154,41601452);安徽省重点研究与开发计划项目(1704a0802124);中国博士后科学基金项目(2016M602005)

Registration Between SAR and Optical Images Based on an Improved Rapid Algorithm

  1. ZHANG Wannan1,2, YANG Xuezhi1,2, DONG Zhangyu1,2
  • Online:2018-04-30 Published:2018-04-30

摘要: 针对基于尺度不变特征变换(SIFT)的合成孔径雷达(SAR)与可见光图像配准存在耗
时长、精度不高的问题,提出了SIFT 与快速近似最近邻搜索(FLANN)相结合的配准算法。首
先,针对SAR 图像存在的相干斑噪声做双边滤波(BF),在去噪的同时能够保护图像的边缘避免
被高斯函数模糊。其次,在高斯差分尺度空间检测特征点并生成SIFT 特征描述向量,利用
FLANN 算法实现高维向量空间中的快速匹配。最后,采用改进的抽样一致算法(PROSAC)剔除
误匹配进一步提高匹配正确率。实验结果表明该算法在配准的精度和速度上都优于原始的SIFT
算法。

关键词: 合成孔径雷达图像, 可见光图像, 配准, 尺度不变特征变换, 快速近似最近邻搜索

Abstract: Registration between SAR and optical images is time-consuming and has poor accuracy
when based on the scale-invariant feature transform (SIFT) algorithm. In this letter we propose a
novel method to solve this problem. First, we smooth SAR image by using bilateral filter (BF). BF is
also good at preserving edges in the image as opposed to Gaussian smoothing, which is used in the
original SIFT. Then, keypoints are detected in the Difference-of-Gaussian (DOG) scale space and
SIFT descriptors are generated. Next, we adopt the fast library for approximate nearest neighbors
(FLANN) algorithm which can search matching points fast in high-dimensional space. Last,
progressive sample consensus (PROSAC) algorithm is utilized to exclude false matches. Experimental
results show that our approach is significantly more accurate and much faster than the original SIFT.

Key words: synthetic aperture radar image, optical image, registration, scale-invariant feature
transform,
fast library for approximate nearest neighbors