Search

Multistatic airborne SAR (MuA-SAR) benefits from the ability to flexibly adjust the positions of multiple transmitters and receivers in space, which can shorten the synthetic aperture time to achieve the required resolution. To ensure both imaging efficiency and quality of different system spatial configurations and trajectories, the fast factorized back projection (FFBP) algorithm is proposed. However, if the FFBP algorithm based on polar coordinates is directly applied to the MuA-SAR system, the interpolation in the recursive fusion process will bring the problem of redundant calculations and error accumulation, leading to a sharp decrease in imaging efficiency and quality. In this paper, a unified Cartesian fast factorized back projection (UCFFBP) algorithm with a multi-level regional attention strategy is proposed for MuA-SAR fast imaging. First, a global Cartesian coordinate system (GCCS) is established. Through designing the rotation mapping matrix and phase compensation factor, data from different bistatic radar pairs can be processed coherently and efficiently. In addition, a multi-level regional attention strategy based on maximally stable extremal regions (MSER) is proposed. In the recursive fusion process, only the suspected target regions are paid more attention and segmented for coherent fusion at each fusion level, which further improves efficiency. The proposed UCFFBP algorithm ensures both the quality and efficiency of MuA-SAR imaging. Simulation experiments verified the effectiveness of the proposed algorithm.

In recent years, sparse direction-of-arrival (DOA) estimation for multiple-input multiple-output (MIMO) radar has attracted extensive attention and been extensively studied, especially the method based on the classic least absolute shrinkage and selection operator (LASSO) estimator. The alternating-direction method of multipliers (ADMM) is an effective method for solving this problem at the cost of introducing an additional user parameter. To avoid introducing an additional user parameter, this paper adopts an equivalent transformation in the form of the generalized SParse Iterative Covariance-based Estimation (qSPICE) cost function to obtain a mean squared minimized form of the cost function. Then, the problem is transformed into a sparse optimization problem in the form of a weighted LASSO. Next, this unconstrained optimization problem is decomposed into three subproblems, which are solved separately to reduce the dimension of each problem and thus reduce the overall computational complexity based on ADMM. Simulation results and measured data indicate that the proposed method significantly outperforms the traditional super-resolution DOA estimation method and ADMM-LASSO method and slightly outperforms qSPICE in terms of resolution and sidelobe suppression capability. In addition, the proposed method has a much lower computational complexity and substantially fewer iterations than qSPICE.

Convolutional neural networks (CNNs) have achieved high performance in synthetic aperture radar (SAR) automatic target recognition (ATR). However, the performance of CNNs depends heavily on a large amount of training data. The insufficiency of labeled training SAR images limits the recognition performance and even invalidates some ATR methods. Furthermore, under few labeled training data, many existing CNNs are even ineffective. To address these challenges, we propose a Semi-supervised SAR ATR Framework with transductive Auxiliary Segmentation (SFAS). The proposed framework focuses on exploiting the transductive generalization on available unlabeled samples with an auxiliary loss serving as a regularizer. Through auxiliary segmentation of unlabeled SAR samples and information residue loss (IRL) in training, the framework can employ the proposed training loop process and gradually exploit the information compilation of recognition and segmentation to construct a helpful inductive bias and achieve high performance. Experiments conducted on the MSTAR dataset have shown the effectiveness of our proposed SFAS for few-shot learning. The recognition performance of 94.18% can be achieved under 20 training samples in each class with simultaneous accurate segmentation results. Facing variances of EOCs, the recognition ratios are higher than 88.00% when 10 training samples each class.

The least absolute shrinkage and selection operator (LASSO) algorithm is a promising method for sparse source location in time–division multiplexing (TDM) multiple–input, multiple–output (MIMO) radar systems, with notable performance gains in regard to resolution enhancement and side lobe suppression. However, the current batch LASSO algorithm suffers from high–computational complexity when dealing with massive TDM–MIMO observations, due to high–dimensional matrix operations and the large number of iterations. In this paper, an online LASSO method is proposed for efficient direction–of–arrival (DOA) estimation of the TDM–MIMO radar based on the receiving features of the sub–aperture data blocks. This method recursively refines the location parameters for each receive (RX) block observation that becomes available sequentially in time. Compared with the conventional batch LASSO method, the proposed online DOA method makes full use of the TDM–MIMO reception time to improve the real–time performance. Additionally, it allows for much less iterations, avoiding high–dimensional matrix operations, allowing the computational complexity to be reduced from OK3 to OK2. Simulated and real–data results demonstrate the superiority and effectiveness of the proposed method.

The robust target detection ability of marine navigation radars is essential for safe shipping. However, time-varying river and sea surfaces will induce target scattering changes, known as fluctuating characteristics. Moreover, the targets exhibiting stronger fluctuation disappear in some frames of the radar images, which is known as flickering characteristics. This phenomenon causes a severe decline in the detection performance of traditional detection methods. A biological memory model-based dynamic programming multi-target joint detection method was proposed to address this issue in this paper. Firstly, a global detection operator is used to discretize the multi-target state into multiple single-target states, achieving the discretization of numerous targets. Meanwhile, updating the formula of the memory weight merit function can strengthen the joint frame correlation of the flickering characteristics target. The progressive loop integral is utilized to update the target states to optimize the candidate target set. Finally, a two-stage threshold criterion is utilized to detect the target at different amplitude levels accurately. Simulation and experimental results are given to validate the assertion that the detection performance of the proposed method is greatly improved under a low SCR of 3-8 dB for multiple flickering target detection.

Synthetic aperture radar (SAR) is an advanced microwave imaging system of great importance. The recognition of real-world targets from SAR images, i.e., automatic target recognition (ATR), is an attractive but challenging issue. The majority of existing SAR ATR methods are designed for single-view SAR images. However, multiview SAR images contain more abundant classification information than single-view SAR images, which benefits automatic target classification and recognition. This paper proposes an end-to-end deep feature extraction and fusion network (FEF-Net) that can effectively exploit recognition information from multiview SAR images and can boost the target recognition performance. The proposed FEF-Net is based on a multiple-input network structure with some distinct and useful learning modules, such as deformable convolution and squeeze-and-excitation (SE). Multiview recognition information can be effectively extracted and fused with these modules. Therefore, excellent multiview SAR target recognition performance can be achieved by the proposed FEF-Net. The superiority of the proposed FEF-Net was validated based on experiments with the moving and stationary target acquisition and recognition (MSTAR) dataset.

Scanning radar enables wide-range imaging through antenna scanning and is widely used for radar warning. The Rayleigh criterion indicates that narrow beams of radar are required to improve the azimuth resolution. However, a narrower beam means a larger antenna aperture. In practical applications, due to platform limitations, the antenna aperture is limited, resulting in a low azimuth resolution. The conventional sparse super-resolution method (SSM) has been proposed for improving the azimuth resolution of scanning radar imaging and achieving superior performance. This method uses the L1 norm to represent the sparse prior of the target and solves the L1 regularization problem to achieve super-resolution imaging under the regularization framework. The resolution of strong-point targets is improved efficiently. However, for some targets with typical shapes, the strong sparsity of the L1 norm treats them as strong-point targets, resulting in the loss of shape characteristics. Thus, we can only see the strong points in its processing results. However, in some applications that need to identify targets in detail, SSM can lead to false judgments. In this paper, a sparse denoising-based super-resolution method (SDBSM) is proposed to compensate for the deficiency of traditional SSM. The proposed SDBSM uses a sparse minimization scheme for denoising, which helps to reduce the influence of noise. Then, the super-resolution imaging is achieved by alternating iterative denoising and deconvolution. As the proposed SDBSM uses the L1 norm for denoising rather than deconvolution, the strong sparsity constraint of the L1 norm is reduced. Therefore, it can effectively preserve the shape of the target while improving the azimuth resolution. The performance of the proposed SDBSM was demonstrated via simulation and real data processing results.

Multiview synthetic aperture radar (SAR) images contain much richer information for automatic target recognition (ATR) than a single-view one. It is desirable to establish a reasonable multiview ATR scheme and design effective ATR algorithm to thoroughly learn and extract that classification information, so that superior SAR ATR performance can be achieved. Hence, a general processing framework applicable for a multiview SAR ATR pattern is first given in this paper, which can provide an effective approach to ATR system design. Then, a new ATR method using a multiview deep feature learning network is designed based on the proposed multiview ATR framework. The proposed neural network is with a multiple input parallel topology and some distinct deep feature learning modules, with which significant classification features, the intra-view and inter-view features existing in the input multiview SAR images, will be learned simultaneously and thoroughly. Therefore, the proposed multiview deep feature learning network can achieve an excellent SAR ATR performance. Experimental results have shown the superiorities of the proposed multiview SAR ATR method under various operating conditions.

Total variation (TV) is an effective super-resolution method to improve the azimuth resolution and preserve the contour information of the target in airborne radar imaging. However, the computational complexity is very high because of the matrix inversion, reaching O(N3). In this paper, a Gohberg–Semencul (GS) representation based fast TV (GSFTV) method is proposed to make up for the shortcoming. The proposed GSFTV method fist utilizes a one-dimensional TV norm as the regular term under regularization framework, which is conducive to achieve super-resolution while preserving the target contour. Then, aiming at the very high computational complexity caused by matrix inversion when minimizing the TV regularization problem, we use the low displacement rank feature of Toeplitz matrix to achieve fast inversion through GS representation. This reduces the computational complexity from O(N3) to O(N2), benefiting efficiency improvement for airborne radar imaging. Finally, the simulation and real data processing results demonstrate that the proposed GSFTV method can simultaneously improve the resolution and preserve the target contour. Moreover, the very high computational efficiency of the proposed GSFTV method is tested by hardware platform.

With the recent advances of deep learning, automatic target recognition (ATR) of synthetic aperture radar (SAR) has achieved superior performance. By not being limited to the target category, the SAR ATR system could benefit from the simultaneous extraction of multifarious target attributes. In this paper, we propose a new multi-task learning approach for SAR ATR, which could obtain the accurate category and precise shape of the targets simultaneously. By introducing deep learning theory into multi-task learning, we first propose a novel multi-task deep learning framework with two main structures: encoder and decoder. The encoder is constructed to extract sufficient image features in different scales for the decoder, while the decoder is a tasks-specific structure which employs these extracted features adaptively and optimally to meet the different feature demands of the recognition and segmentation. Therefore, the proposed framework has the ability to achieve superior recognition and segmentation performance. Based on the Moving and Stationary Target Acquisition and Recognition (MSTAR) dataset, experimental results show the superiority of the proposed framework in terms of recognition and segmentation.

The total variation (TV) method has been applied to realizing airborne scanning radar super-resolution imaging while maintaining the outline of the target. The iterative reweighted norm (IRN) approach is an algorithm for addressing the minimum Lp norm problem by solving a sequence of minimum weighted L2 norm problems, and has been applied to solving the TV norm. However, during the solving process, the IRN method is required to update the weight term and result term in each iteration, involving multiplications and the inversion of large matrices. Consequently, it suffers from a huge calculation load, which seriously restricts the application of the TV imaging method. In this work, by analyzing the structural characteristics of the matrix involved in iteration, an efficient method based on suitable matrix blocking is proposed. It transforms multiplications and the inversion of large matrices into the computation of multiple small matrices, thereby accelerating the algorithm. The proposed method, called IRN-FTV method, is more time economical than the IRN-TV method, especially for high dimensional observation scenarios. Numerical results illustrate that the proposed IRN-FTV method enjoys preferable computational efficiency without performance degradation.

Deconvolution methods can be used to improve the azimuth resolution in airborne radar imaging. Due to the sparsity of targets in airborne radar imaging, an L 1 regularization problem usually needs to be solved. Recently, the Split Bregman algorithm (SBA) has been widely used to solve L 1 regularization problems. However, due to the high computational complexity of matrix inversion, the efficiency of the traditional SBA is low, which seriously restricts its real-time performance in airborne radar imaging. To overcome this disadvantage, a fast split Bregman algorithm (FSBA) is proposed in this paper to achieve real-time imaging with an airborne radar. Firstly, under the regularization framework, the problem of azimuth resolution improvement can be converted into an L 1 regularization problem. Then, the L 1 regularization problem can be solved with the proposed FSBA. By utilizing the low displacement rank features of Toeplitz matrix, the proposed FSBA is able to realize fast matrix inversion by using a Gohberg–Semencul (GS) representation. Through simulated and real data processing experiments, we prove that the proposed FSBA significantly improves the resolution, compared with the Wiener filtering (WF), truncated singular value decomposition (TSVD), Tikhonov regularization (REGU), Richardson–Lucy (RL), iterative adaptive approach (IAA) algorithms. The computational advantage of FSBA increases with the increase of echo dimension. Its computational efficiency is 51 times and 77 times of the traditional SBA, respectively, for echoes with dimensions of 218 × 400 and 400 × 400 , optimizing both the image quality and computing time. In addition, for a specific hardware platform, the proposed FSBA can process echo of greater dimensions than traditional SBA. Furthermore, the proposed FSBA causes little performance degradation, when compared with the traditional SBA.

Bistatic Synthetic Aperture Radar (SAR) has attracted increasing attention in recent years due to its unique advantages, such as the ability of forward-looking imaging. In translational variant bistatic forward-looking SAR (TV-BFSAR), it is difficult to get a well focused image due to large range cell migration (RCM) and 2-D variation of both Doppler characteristics and RCM. In this paper, an extended azimuth nonlinear chirp scaling (NLCS) algorithm is proposed to deal with these problems. Firstly, Keystone Transform (KT) is introduced to remove the spatial-variant linear RCM, which is of great significance in TV-BFSAR. Secondly, a correction factor is multiplied to the signal in range frequency domain to compensate for the residual RCM. At last, a fourth-order filtering together with azimuth NLCS is performed in every range gate to equalize both the azimuth-variant Doppler centroid and frequency modulation rate based on the azimuth numerical fitting. The proposed method is verified by simulation and real data processing. Multiple targets are generated and focused by the method, of which the peak sidelobe ratio (PSLR) is around −13 dB and integrated sidelobe ratio (ISLR) is around −10 dB. The method is accurate and can achieve high-resolution focusing for TV-BFSAR data.