Sparse With Fast MM Superresolution Algorithm for Radar Forward-Looking Imaging

IEEE Access

Yongchao Zhang¹  Yulin Huang¹  Wenchao Li¹  Jianyu Yang¹  Yin Zhang¹  Qiping Zhang¹ 

[1] School of Information and Communication Engineering, University of Electronic Science and Technology of China, Chengdu, China;

关键词: Superresolution;    radar imaging;    majorization-minimization;    vector extrapolation;   

DOI  :  10.1109/ACCESS.2019.2932612

来源: DOAJ

【 摘 要 】

The problem of low azimuth resolution has restricted the applicability for radar forward-looking imaging in practice. In this paper, a sparse with fast majorization-minimization (SFMM) superresolution algorithm was proposed to realize fast superresolution imaging of sparse targets in radar forward-looking area. First, we analyzed the azimuth signal of the radar forward-looking area and modeled the azimuth signal as a convolution of antenna pattern and targets distribution. Second, the superresolution problem was converted into an L₁ regularization issue by introducing the L₁ norm to represent the distribution of the targets under the regularization framework. Third, according to the principle of majorization-minimization (MM) algorithm, a simple L₂ regularization issue was obtained to replace the difficult L₁ one, and the real target distribution was obtained by solving the L₂ regularization problem (We named it sparse with MM (SMM) superresolution algorithm for convenience). Then, in order to improve the computational efficiency of the algorithm, we adopted the second-order vector extrapolation idea to accelerate the conventional MM algorithm and solve the L₂ regularization problem. The simulation and real data verified that the proposed SFMM algorithm not only improves the azimuth resolution in radar forward-looking imaging but also increases convergence speed on the basis of SMM superresolution algorithm.

【 授权许可】

Unknown