Efficient Image Reconstruction Methods Based on Structured Sparsity for Short-Range Radar
Shaoqiu Song, Yongpeng Dai, Shilong Sun, Tian Jin
Abstract
The radar imaging method, based on matched filtering (MF), generates high gratings and sidelobes in sparse aperture data, resulting in artifacts in the radar image. The theory of compressive sensing (CS) has brought a breaking change to radar imaging, and imaging enhancement can be realized by exploiting the sparsity of the target image. However, traditional sparse imaging methods ignore the correlation between scatterers. This leads to difficulties in accurately extracting the target’s shape contour and structural features. Thus, in this paper, a convolutional reweighted model based on structured sparsity features is proposed. Specifically, a dynamically relaxing threshold is achieved through the convolutional reweighted <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> norm, promoting the sparsity of clustered structures in radar images. Furthermore, to avoid large-scale matrix inversion, the issue is respectively addressed through the alternating direction method of multipliers (ADMM) joint gradient descent framework and linearization approximation approach. In addition, the priori information of MF is utilized to adaptively update the imaging support set during the iteration process, aiming to reduce the data storage pressure. Finally, a large number of simulation and experimental results confirm the generality of the proposed algorithms for radar data in different frequency bands, as well as their superiority in terms of computational efficiency and image quality.