Clutter Suppression for Radar via Deep Joint Sparse Recovery Network
Shiyuan Zhang, Xingyu Lu, Jin-Tao Yu, Zheng Dai, Weimin Su, Hong Gu
Abstract
In radar detection, small and slow targets are easily overwhelmed by strong clutter. Traditional methods, such as singular value decomposition (SVD) and robust principal component analysis (RPCA), can suppress clutter and recover targets by using low-rank and sparse models. However, these methods rely on fixed prior information, which lacks adaptivity and suffers from unfavorable extensive manual hyperparameter tuning. To address these issues, a data-driven deep network model combined with an iterative algorithm called unfolding joint sparse recovery network (UFJSR-Net) is proposed to achieve the improved target detection performance. First, a joint sparse recovery (JSR) model is established and the fast iterative shrinkage/thresholding algorithm (FISTA) is derived to solve this model. Then, one iteration consisting of a linear operation and a nonlinear one can be recast into a single network layer and the stacking and combination of all layers will form the UFSJR-Net. Finally, the properties of the target and clutter can be learned by paired inputs and outputs training data to optimize the hyperparameters in the iterative algorithm to obtain the JSR model. Experiments on simulation data and measured radar data demonstrate that the proposed method exhibits advantages in detection performance over traditional decomposition methods under strong clutter with different intensities.