When tracking maneuvering targets, recurrent neural networks (RNNs), especially long short-term memory (LSTM) networks, are widely applied to sequentially capture the motion states of targets from observations. However, LSTMs can only extract features of trajectories stepwise; thus, their modeling of maneuvering motion lacks globality. Meanwhile, trajectory datasets are often generated within a large, but fixed distance range. Therefore, the uncertainty of the initial position of targets increases the complexity of network training, and the fixed distance range reduces the generalization of the network to trajectories outside the dataset. In this study, we propose a transformer-based network (TBN) that consists of an encoder part (transformer layers) and a decoder part (one-dimensional convolutional layers), to track maneuvering targets. Assisted by the attention mechanism of the transformer network, the TBN can capture the long short-term dependencies of target states from a global perspective. Moreover, we propose a center–max normalization to reduce the complexity of TBN training and improve its generalization. The experimental results show that our proposed methods outperform the LSTM-based tracking network.

Synthetic aperture radar (SAR) typically faces both large-scale data and speckle noise problems, which, respectively, induce enormous strains on transmission and storage and interfere with the analysis and interpretation of SAR images. To tackle these, we present a real-time processing deep network, called SPB-Net, to implement imaging and speckle suppression simultaneously. First, a novel imaging-despeckling observation model with the nonlogarithmic additive speckle noise is established. Subsequently, guided by the statistical properties of noise and sparse and detail-preserved requirements in SAR imaging and despeckling, we formulate an $L_{2}$ along with two $L_{1}$ regularizations as the fidelity, sparse, and image detail-preserved constraints, respectively. Convolution layers are employed to improve the feature representation capability in the latter $L_{1}$ term as well. Based on this, we construct a corresponding convex optimization problem. Then, the complex-valued split Bregman method, focusing on the complex-variable convex problem, is unfolded into a parameter-learnable and architecture-fixed SPB-Net to solve the proposed problem effectively and efficiently. Experimental results with the downsampled Radarsat-1 raw data demonstrate the validity in imaging and speckle suppression and the real-time processing capability of the proposed SPB-Net.

Within the long-time coherent integration (CI) in radar detection, the range walk effect inevitably impacts high-speed targets, which makes coherent detection methods invalid. To address this problem, a coherent detection method, a modified Radon inverse Fourier transform (MRIFT), was developed in this study. The MRIFT can estimate velocity via single parameter searching and achieve the target's CI in the two-dimensional frequency domain using the inverse Fourier transform. Compared with the traditional coherent detection methods, the MRIFT achieved great detection performance and range and velocity estimation performance and averted the blind speed side lobe effect at a lower computational cost. Simulations demonstrate the effectiveness and efficiency of the proposed MRIFT.

The Split Bregman method (SBM), a popular and universal CS reconstruction algorithm for inverse problems with both l₁-norm and TV-norm regularization, has been extensively applied in complex domains through the complex-to-real transforming technique, e.g., MRI imaging and radar. However, SBM still has great potential in complex applications due to the following two points; Bregman Iteration (BI), employed in SBM, may not make good use of the phase information for complex variables. In addition, the converting technique may consume more time. To address that, this paper presents the complex-valued Split Bregman method (CV-SBM), which theoretically generalizes the original SBM into the complex domain. The complex-valued Bregman distance (CV-BD) is first defined by replacing the corresponding regularization in the inverse problem. Then, we propose the complex-valued Bregman Iteration (CV-BI) to solve this new problem. How well-defined and the convergence of CV-BI are analyzed in detail according to the complex-valued calculation rules and optimization theory. These properties prove that CV-BI is able to solve inverse problems if the regularization is convex. Nevertheless, CV-BI needs the help of other algorithms for various kinds of regularization. To avoid the dependence on extra algorithms and simplify the iteration process simultaneously, we adopt the variable separation technique and propose CV-SBM for resolving convex inverse problems. Simulation results on complex-valued l₁-norm problems illustrate the effectiveness of the proposed CV-SBM. CV-SBM exhibits remarkable superiority compared with SBM in the complex-to-real transforming technique. Specifically, in the case of large signal scale n = 512, CV-SBM yields 18.2%, 17.6%, and 26.7% lower mean square error (MSE) as well as takes 28.8%, 25.6%, and 23.6% less time cost than the original SBM in 10 dB, 15 dB, and 20 dB SNR situations, respectively.

Images obtained in an unfavorable environment may be affected by haze or fog, leading to fuzzy image details, low contrast, and loss of important information. Recently, significant progress has been achieved in the realm of image dehazing, largely due to the adoption of deep learning techniques. Owing to the lack of modules specifically designed to learn the unique characteristics of haze, existing deep neural network-based methods are impractical for processing images containing haze. In addition, most networks primarily focus on learning clear image information while disregarding potential features in hazy images. To address these limitations, we propose an innovative method called contrastive multiscale transformer for image dehazing (CMT-Net). This method uses the multiscale transformer to enable the network to learn global hazy features at multiple scales. Furthermore, we introduce feature combination attention and a haze-aware module to enhance the network’s ability to handle varying concentrations of haze by assigning more weight to regions containing haze. Finally, we design a multistage contrastive learning loss incorporating different positive and negative samples at various stages to guide the network’s learning process to restore real and non-hazy images. The experimental findings demonstrate that CMT-Net provides exceptional performance on established datasets and exhibits superior visual outcomes.