欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2011, Vol. 28 ›› Issue (3): 349-354.DOI: 10.7523/j.issn.2095-6134.2011.3.011

• 论文 • 上一篇    下一篇

一种干涉条纹快速滤波算法

陈立福1,2, 汪丙南1,2, 向茂生1   

  1. 1. 中国科学院电子学研究所, 北京 100190;
    2. 中国科学院研究生院, 北京 100039
  • 收稿日期:2010-06-07 修回日期:2010-08-10 发布日期:2011-05-15
  • 基金资助:

    973项目(2009CB724003)和863项目(2007AA120302)资助 

A fast filtering algorithm for interferometry fringe

CHEN Li-Fu1,2, WANG Bing-Nan1,2, XIANG Mao-Sheng1   

  1. 1. Institute of Electronics, Chinese Academy of Sciences, Beijing 100190, China;
    2. Graduate University, Chinese Academy of Sciences, Beijing 100049, China
  • Received:2010-06-07 Revised:2010-08-10 Published:2011-05-15

摘要:

提出了一种快速干涉滤波算法,解决了传统干涉滤波方法速度较慢的问题.首先对2天线的单视复图像共轭相乘产生干涉复数据,进而对该数据进行方位向多视处理,并对实部和虚部分别快速均值滤波产生干涉条纹,最后对干涉条纹进行快速准中值和均值滤波.在滤波过程中,充分利用了相邻像素滤波时的窗口信息来最大程度减少运算量进而提高滤波速度,保证了滤波质量.通过对实测数据滤波结果的分析比较,证明了该算法的有效性.

关键词: 干涉合成孔径雷达, 滤波, 干涉条纹, 多视处理

Abstract:

We present a fast filtering algorithm to solve the problem that traditional filtering algorithm filters the interferometry fringe very slowly. First the complex multiplication of the single-look-complex images of the two channels is implemented to generate InSAR complex data. Then azimuth multi-look processing and fast mean filter are done to the real and imaginary parts of the InSAR complex data, respectively, to produce the interferometry fringe. Finally, the fast median and mean filters are done to the interferometry fringe. During the filtering, the window information of the neighborhood pixels is adequately used to reduce the computation to a great extent and enhance the filtering speed with the filtering quality mainteined. Comparison with the real InSAR data filtered shows effectiveness of the algorith.

Key words: InSAR, filtering, interferometry fringe, multi-look processing

中图分类号: