基于贪婪-快速阈值迭代的SAR地面动目标稀疏表征算法 |
| |
引用本文: | 杨磊,李慧娟,李埔丞,方澄.基于贪婪-快速阈值迭代的SAR地面动目标稀疏表征算法[J].信号处理,2019,35(11):1844-1852. |
| |
作者姓名: | 杨磊 李慧娟 李埔丞 方澄 |
| |
作者单位: | 中国民航大学天津市智能信号与图像处理重点实验室 |
| |
基金项目: | 国家自然科学基金(61601470);天津市自然科学基金(16JCYBJC41200,20162898);中央高校基本科研业务费专项资金(3122018C005);中国民航大学科研启动基金项目资助(2017QD05S)
|
| |
摘 要: | 合成孔径雷达地面动目标成像(Synthetic Aperture Radar Ground Moving Target Imaging, SAR-GMTIm)技术通过在静止场景的SAR图像中检测运动目标响应,实现针对运动目标的重聚焦成像。通常情况下,地面运动目标回波响应相对于静止场景的回波(即杂波)具有较强的稀疏性,增强SAR-GMTIm成像结果的稀疏特征有利于目标分类和识别。现有的一阶算法如阈值迭代算法(Iterative Shrinkage-thresholding Algorithm,ISTA)及其改进方法,快速阈值迭代算法(Fast Iterative Shrinkage-thresholding Algorithm,FISTA)都可用于SAR-GMTIm稀疏特征增强,但都存在运算效率偏低,收敛速度较慢的问题。针对以上问题,本文提出了一种贪婪-快速阈值迭代算法(Greedy Fast Iterative Shrinkage-thresholding Algorithm,Greedy FISTA)用于SAR-GMTIm稀疏特征恢复。该算法基于重启动框架对FISTA进行改进,缩短了算法重启间隔和振荡周期,拥有比FISTA更快的收敛速度。本文利用Greedy FISTA针对SAR-GMTIm的仿真复数据以及美国空军实验室的Gotcha实测雷达数据进行成像实验,并对比Greedy FISTA和FISTA、ISTA在SAR动目标成像中达到同等精度所需的迭代次数,再结合相变热力图分析法对比三种算法的恢复性能。实验结果表明Greedy FISTA应用于SAR-GMTIm系统具有良好的成像效果, 且在收敛速度和稀疏信号恢复方面相较传统阈值迭代算法及快速阈值迭代算法有明显优势。
|
关 键 词: | 合成孔径雷达地面动目标成像 贪婪-快速阈值迭代算法 压缩感知 稀疏表征 |
收稿时间: | 2019-07-10 |
Sparse representation for SAR ground moving target imaging based on Greedy FISTA |
| |
Affiliation: | Tianjin Key Laboratory for Advanced Signal Processing, Civil Aviation University of China |
| |
Abstract: | Synthetic Aperture Radar Ground Moving Target Imaging (SAR-GMTIm) is capable of detecting moving target responses in the stationary clutter and forming focused images of the target. There is a widely accepted fact that the moving target response is inherently sparse with respect to the rich clutter. To achieve the recovery of the sparse response of the moving target, algorithms of the first-order are popular, where ISTA and FISTA are typical candidates that can be applied to image for sparse SAR moving target. However, there are some problems such as low computation efficiency and slow convergence. To address the problems, a Greedy Fast Iterative Shrinkage-thresholding Algorithm (Greedy FISTA) is proposed for the representation of the sparse features of SAR-GMTIm. This algorithm improves the FISTA based on the restart framework, and shortens the restart interval and oscillation period of the algorithm, so that a faster convergence rate can be ensured compared with the conventional FISTA. In this paper, both simulated complex SAR data and raw Gotcha data from US Air Force Laboratory are applied to examine the performance of the proposed Greedy FISTA algorithm. Comparisons with the conventional ISTA and FISTA in terms of the required number iteration are performed, and the performance of the sparse recovery are examined by using the phase transition diagram (PTD) analysis. Experimental results show that Greedy FISTA has good imaging performance when applied to the SAR-GMTIm data, and has obvious advantages over other threshold iterative algorithms in terms of convergence speed and sparse recovery accuracy. |
| |
Keywords: | |
|
| 点击此处可从《信号处理》浏览原始摘要信息 |
|
点击此处可从《信号处理》下载全文 |
|