Sparse aperture radar imaging is generally achieved by methods of compressive sensing (CS), or, sparse signal recovery(SSR). However, most of the traditional SSR methods cannot produce focused image stably, which limits their applications. l1 regularization and alternating direction method of multipliers(ADMM) are generally applied to the SSR problem, but its performance is sensitive to the selection of model parameters. This paper proposes a complex-valued ADMM-Net(CV-ADMMN) method to improve the stability of ADMM, and utilize it to achieve sparse aperture ISAR imaging and autofocusing. Firstly, the iterative procedure of ADMM is unrolled to be a deep network structure. Then, the parameters of the model are learned from a training dataset by utilizing an l1 regularized loss function. Finally, an autofocusing module based on entropy-minimization is plugged into the trained model to compensate the phase error. Experimental results based on both simulated and measured data validate the superiority of the proposed method over ADMM.

Learning based approaches have witnessed great successes in blind single image super-resolution (SISR) tasks, however, handcrafted kernel priors and learning based kernel priors are typically required. In this paper, we propose a meta-learning and Markov Chain Monte Carlo (MCMC) based SISR approach to learn kernel priors from organized randomness. In concrete, a lightweight network is adopted as kernel generator, and is optimized via learning from the MCMC simulation on random Gaussian distributions. This procedure provides an approximation for the rational blur kernel, and introduces a network-level Langevin dynamics into SISR optimization processes, which contributes to preventing bad local optimal solutions for kernel estimation. Meanwhile, a meta-learning based alternating optimization procedure is proposed to optimize the kernel generator and image restorer, respectively. In contrast to the conventional alternating minimization strategy, a meta-learning based framework is applied to learn an adaptive optimization strategy, which is less-greedy and results in better convergence performance. These two procedures are iteratively processed in a plug-and-play fashion, for the first time, realizing a learning-based but plug-and-play blind SISR solution in unsupervised inference. Extensive simulations demonstrate the superior performance and generalization ability of the proposed approach when compared with the Start-of-the-Art solutions on synthesis and real-world datasets.

Inverse synthetic aperture radar (ISAR) imaging for the target with micro-motion parts is influenced by the micro-Doppler (m-D) effects. In this case, the radar echo is generally decomposed into the components from the main body and micro-motion parts of target, respectively, to remove the m-D effects and derive a focused ISAR image of the main body. For the sparse aperture data, however, the radar echo is intentionally or occasionally under-sampled, which defocuses the ISAR image by introducing considerable interference, and deteriorates the performance of signal decomposition for the removal of m-D effects. To address this issue, this paper proposes a novel m-D effects removed sparse aperture ISAR (SA-ISAR) imaging algorithm. Note that during a short interval of ISAR imaging, the range profiles of the main body of target from different pulses are similar, resulting in a low-rank matrix of range profile sequence of main body. For the range profiles of the micro-motion parts, they either spread in different range cells or glint in a single range cell, which results in a sparse matrix of range profile sequence. From this perspective, the low-rank and sparse properties are utilized to decompose the range profiles of the main body and micro-motion parts, respectively. Moreover, the sparsity of ISAR image is also utilized as a constraint to eliminate the interference caused by sparse aperture. Hence, SA-ISAR imaging with the removal of m-D effects is modeled as a triply constrained underdetermined optimization problem. The alternating direction method of multipliers (ADMM) and linearized ADMM (L-ADMM) are further utilized to solve the problem with high efficiency. Experimental results based on both simulated and measured data validate the effectiveness of the proposed algorithm.

For sparse aperture (SA) radar echoes, the coherence between the undersampled pulses is destroyed, which challenges the effectiveness of the traditional autofocusing and scaling in inverse synthetic aperture radar (ISAR) imaging. A novel Bayesian ISAR autofocusing and scaling algorithm for sparse aperture is proposed, which utilizes Laplacian scale mixture, as the sparse prior of ISAR image, and variational Bayesian inference based on the Laplacian approximation to derive its posterior. In addition, it learns the phase error, rotational velocity, and center of target from radar echo automatically during the reconstruction of ISAR image, so as to achieve ISAR autofocusing and scaling for SA. Because the parameters learning is not easy to converge with the undersampled data, a modified Newton method based on joint constraint of entropy and sparsity is proposed to guarantee fast convergence in a right direction. Experimental results based on both simulated and measured data validate the robustness of the proposed ISAR imaging algorithm against SA and noise.

In the case of sparse aperture, the coherence between pulses of radar echo is destroyed, which challenges inverse synthetic aperture radar (ISAR) autofocusing and imaging. Mathematically, reconstructing the ISAR image from the sparse aperture radar echo is a linear underdetermined inverse problem, which, by nature, can be solved by the fast developed compressive sensing (CS) or sparse signal recovery theory. However, the CS-based sparse aperture ISAR imaging algorithms are generally computationally heavy, which becomes the bottleneck of preventing their applications to the real-time ISAR imaging system. In this article, we propose a novel and computationally efficient ISAR autofocusing and imaging algorithm for sparse aperture. We first consider a generalized CS model for ISAR imaging and autofocusing with sparse and entropy-minimization regularizations, and then utilize the alternating direction method of multipliers (ADMM) algorithm to optimize the model. To improve computational efficiency, the matrix inversion is translated to an elementwise division with the usage of a partial Fourier dictionary, and the 2-D ISAR image is updated as a whole instead of range cellwise. To achieve autofocusing for sparse aperture, the phase error is estimated by minimizing the entropy of the ISAR image reconstructed in each iterative loop. Experiments based on both simulated and measured data validate that the proposed algorithm can achieve well-focused ISAR images within a few seconds, which is ten times faster than the reported sparse aperture ISAR imaging algorithms.

A novel radar high-resolution range profile (HRRP) target recognition method based on a stacked autoencoder (SAE) and extreme learning machine (ELM) is presented in this paper. As a key component of deep structure, the SAE does not only learn features by making use of data, it also obtains feature expressions at different levels of data. However, with the deep structure, it is hard to achieve good generalization performance with a fast learning speed. ELM, as a new learning algorithm for single hidden layer feedforward neural networks (SLFNs), has attracted great interest from various fields for its fast learning speed and good generalization performance. However, ELM needs more hidden nodes than conventional tuning-based learning algorithms due to the random set of input weights and hidden biases. In addition, the existing ELM methods cannot utilize the class information of targets well. To solve this problem, a regularized ELM method based on the class information of the target is proposed. In this paper, SAE and the regularized ELM are combined to make full use of their advantages and make up for each of their shortcomings. The effectiveness of the proposed method is demonstrated by experiments with measured radar HRRP data. The experimental results show that the proposed method can achieve good performance in the two aspects of real-time and accuracy, especially when only a few training samples are available.