ZWZhixia Wu

Zhixia Wu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zhixia Wu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Improved Structured-Dictionary-Learning-Based Sparse SAR Imaging Algorithm

    by Jialu Lu, Zhiqi Gao, Pingping Huang, Weixian Tan, Wei Xu, Zhixia Wu

    Existing structured-dictionary-learning (SDL)-based sparse synthetic aperture radar (SAR) imaging methods suffer from insufficient artifact suppression, limited parameter adaptivity, and inadequate structure preservation during refined imaging under low-sampling-rate conditions. To address these limitations, an improved SDL-based sparse SAR imaging method is proposed, which integrates an iteratively reweighted ℓ1-norm (IRL1) constraint with a total-variation (TV) regularization safety mechanism. Within the framework of structured dictionary learning, sub-dictionary discrimination, and refined imaging, the proposed method focuses on improving the refined-imaging procedure. Specifically, an IRL1 sparsity constraint is introduced to enhance the representation of dominant scattering components; a regularization-parameter continuation strategy is adopted to improve early-stage optimization stability and late-stage detail recovery; an adaptive parameter-updating mechanism driven by the ratio between the measurement residual and the dictionary residual is designed to improve reconstruction adaptivity; and a TV-regularization safety mechanism with objective-function backtracking protection is incorporated to suppress background artifacts and local noise while preserving target structural edges. Experiments on structured simulation scenes and the real Moving and Stationary Target Acquisition and Recognition (MSTAR) SAR target dataset show that, compared with the K-singular value decomposition (K-SVD) method and the original SDL method, the proposed method achieves better imaging reconstruction performance at different sampling rates and provides stronger structure-preserving and artifact-suppression capabilities. These results demonstrate the effectiveness of the proposed method for low-sampling-rate SAR target imaging.

  • Open Access

    Robust Adaptive Beamforming Algorithm Based on Improved Generalized Linear Combination

    by Zhiqi Gao, Ruyu Zuo, Pingping Huang, Wei Xu, Weixian Tan, Zhixia Wu

    Conventional adaptive beamforming algorithms often suffer from significant performance degradation when steering vector mismatches and covariance matrix estimation errors occur. To address this problem, this paper proposes an adaptive robust beamforming algorithm based on an improved generalized linear combination (GLC) framework. The proposed method first applies singular spectrum analysis to the received signals to suppress noise components. A diagonal loading coefficient function related to the received signal snapshots is then constructed, and a generalized diagonally loaded covariance matrix is formed using the denoised data. Finally, by exploiting spatial integration and subspace projection within a predefined angular uncertainty set, the actual direction of arrival of the desired signal is accurately estimated, and the steering vector is corrected accordingly. Simulation results demonstrate that, compared with traditional SMI, LSMI, GLC and improved GLC algorithms, the proposed method achieves a 3–5 dB higher output signal-to-interference-plus-noise ratio (SINR) across the entire input signal-to-noise ratio (SNR) range under steering vector mismatch, and reaches an output SINR close to the optimal level with only 100 snapshots, exhibiting excellent robustness against steering vector mismatch and limited snapshot conditions.

  • Open Access

    Weighted STAP Algorithm Based on the Greedy Block Coordinate Descent Method

    by Zhiqi Gao, Na Yang, Zhixia Wu, Wei Xu, Weixian Tan

    Space–time adaptive processing (STAP) based on sparse recovery (SR-STAP) has demonstrated remarkable clutter suppression performance under insufficient sample conditions. However, the main aim of sparse recovery is to solve the norm minimization problem. To this end, this study proposes a weighted STAP algorithm based on a greedy block coordinate descent method to address the problems of slow convergence speed and insufficient estimation accuracy in the existing l2,1-norm minimization methods. First, the weights are estimated using the multiple signal classification (MUSIC) algorithm. Then, a greedy block selection rule that favors sparsity is used, prioritizing the update of the weighted block that has the greatest impact on sparsity. Although the proposed algorithm in this paper is greedy in nature, it is globally convergent. Finally, the accuracy of clutter covariance matrix estimation and the convergence speed of the SR-STAP algorithm are enhanced by reasonably estimating the noise power and selecting appropriate regularization parameters. The results of simulation experiments indicate that the proposed algorithm can effectively suppress clutter ridge expansion, achieving excellent clutter suppression and target detection performance compared with the existing methods, as well as satisfactory convergence properties.


  • Open Access

    A Robust Capon Beamforming Algorithm with Desired Signal Steering Vector Correction

    by Zhiqi Gao, Bowen Wu, Pingping Huang, Wei Xu, Weixian Tan, Zhixia Wu

    The conventional Capon beamforming algorithm can achieve a high gain in the direction of desired signals and zero-trapping in the direction of interfering signals, providing a high output signal-to-interference-plus-noise ratio (SINR). However, when the steering vector of the desired signal is mismatched, the performance of the Capon beamforming algorithm degrades. In addressing this challenge, the present research introduces a refined algorithm. The core of the proposed robust Capon beamforming technique lies in leveraging the orthogonality between the steering vector and the noise space, the estimated expected signal steering vector is corrected. Based on this feature, the proposed algorithm meticulously optimizes the predicted steering vector of the desired signal, which can mitigate the problem of performance degradation caused by the mismatch in the steering vector. Moreover, the covariance matrix is corrected using the desired signal elimination method, which can overcome the problem of signal self-cancelation. Furthermore, through the optimization process, the proposed algorithm can maintain high robustness in complex environments and under the condition of different input signals, its beam pattern performance is more excellent. The results of simulation experiments show that the proposed algorithm demonstrates greater robustness compared to the currently available algorithms, can achieve a higher output SINR, and is insensitive to steering vector mismatch.


  • Open Access

    An Efficient Sparse Synthetic Aperture Radar Imaging Method Based on L1-Norm and Total Variation Regularization

    by Zhiqi Gao, Huiying Ma, Pingping Huang, Wei Xu, Weixian Tan, Zhixia Wu

    The continuous progress of synthetic aperture radar (SAR) imaging has led to a growing emphasis on the challenges involved in data acquisition and processing. And the challenges in data acquisition and processing have become increasingly prominent. However, traditional SAR imaging models are limited by their large demand for data sampling and slow image reconstruction speeds, which is particularly prominent in large-scale scene applications. To overcome these limitations, this study proposes an innovative L1-Total Variation (TV) regularization sparse SAR imaging algorithm. The submitted algorithm constructs an imaging operator and an echo simulation operator to achieve decoupling in the azimuth and range dimensions, respectively, as well as to reduce the requirement for sampling data. In addition, a Newton acceleration iterative method is introduced to the optimization process, aiming to accelerate the speed of image reconstruction. Comparative analysis and experimental validation indicate that the proposed sparse SAR imaging algorithm outperforms conventional methods in resolution, target localization, and clutter suppression. The results suggest strong potential for rapid scene reconstruction and real-time monitoring in complex environments.

  • Open Access

    Self-Calibrating STAP Algorithm for Dictionary Dimensionality Reduction Based on Sparse Bayesian Learning

    by Zhiqi Gao, Na Yang, Pingping Huang, Wei Xu, Weixian Tan, Zhixia Wu

    Sparse recovery space–time adaptive processing (STAP) has an off-grid feature and high computational complexity. To address these shortcomings, this study proposes a self-calibrating STAP algorithm based on sparse Bayesian learning (SBL). The proposed algorithm constructs a dimensionality reduction dictionary by selecting the steering vectors corresponding to atoms with high power values. Then, a small-scale auxiliary dictionary is constructed with a stepwise search approach to calibrate the uniformly discretized dictionary. In this way, the atoms of the auxiliary dictionary can converge to the clutter ridge adaptively when off-grid occurs. The clutter plus noise covariance matrix is estimated via SBL combined with the updated dictionary. The experimental results demonstrate that the proposed algorithm can effectively suppress the clutter ridge expansion caused by the off-grid problem while reducing the computation burden significantly compared with the existing methods.