XLXuesong Liu

Xuesong Liu

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Xuesong Liu has a total of 38 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Expansion of Field of View for Near-Field Fast Beamforming in 3-D Acoustic Imaging Based on the Optimized Subregion Approach

    by Fei Wang, Xuesong Liu, Chenyi Lin, Xiang Gao, Boxuan Gu, Fan Zhou, Yaowu Chen

    Real-time underwater 3-D acoustic imaging employs various fast-beamforming methods that significantly reduce the computational cost. However, in the near-field region, these methods rely on a popular model based on the Fresnel approximation, which has a narrow field of view (FOV) boundary of approximately $26^\circ$ . The FOV of the near-field region is very limited compared with that of the far-field region. Therefore, in this study, an optimized subregion approach is proposed to eliminate the FOV limitation for fast beamforming to improve the FOV of the near-field region. First, the FOV is divided into subregions, and within each subregion, a linear approximation is adopted to simplify the time-delay expression, with the approximation error limited to a reasonable threshold. Furthermore, the least-squares method and coordinate rotation techniques are employed, and the FOV for each subregion is reshaped to an ideal shape. Subsequently, a nested nonuniform fast Fourier transform is proposed to implement fast beamforming, and subregions can be computed in parallel. The results demonstrate that the proposed approach overcomes the limited FOV that exists for near-field fast beamforming in 3-D acoustic imaging and has a computational complexity comparable with those of existing algorithms. In addition, this approach supports an irregular planar array and maintains a satisfactory performance.

  • Open Access

    URRL-IMVC: Unified and Robust Representation Learning for Incomplete Multi-View Clustering

    by Ge Teng, Ting Mao, Chen Shen, Xiang Tian, Xuesong Liu, Yaowu Chen, Jieping Ye

    Incomplete multi-view clustering (IMVC) aims to cluster multi-view data that are only partially available. This poses two main challenges: effectively leveraging multi-view information and mitigating the impact of missing views. Prevailing solutions employ cross-view contrastive learning and missing view recovery techniques. However, they either neglect valuable complementary information by focusing only on consensus between views or provide unreliable recovered views due to the absence of supervision. To address these limitations, we propose a novel Unified and Robust Representation Learning for Incomplete Multi-View Clustering (URRL-IMVC). URRL-IMVC directly learns a unified embedding that is robust to view missing conditions by integrating information from multiple views and neighboring samples. Firstly, to overcome the limitations of cross-view contrastive learning, URRL-IMVC incorporates an attention-based auto-encoder framework to fuse multi-view information and generate unified embeddings. Secondly, URRL-IMVC directly enhances the robustness of the unified embedding against view-missing conditions through KNN imputation and data augmentation techniques, eliminating the need for explicit missing view recovery. Finally, incremental improvements are introduced to further enhance the overall performance, such as the Clustering Module and the customization of the Encoder. We extensively evaluate the proposed URRL-IMVC framework on various benchmark datasets, demonstrating its state-of-the-art performance. Furthermore, comprehensive ablation studies are performed to validate the effectiveness of our design.


  • Probability-Based Complex-Valued Fast Iterative Shrinkage-Thresholding Algorithm for Deconvolution Beamforming

    by Shiyao Jiang, Rongxin Jiang, Xuesong Liu, Boxuan Gu, Yaowu Chen

    Conventional beamforming is widely used in sonars and radars owing to its robustness and low complexity; however, it suffers from low beam resolution and high-intensity sidelobes. Various imaging deblurring methods have been used in deconvolution beamforming to improve the beam resolution. A considerable limitation of these intensity-based methods is that the real-valued model mismatches the signals in practice and ignores the coherent information of the received signals. This study proposes a probability-based complex-valued fast iterative shrinkage-thresholding algorithm (CFISTA) to extend deconvolution beamforming to the complex domain. In this novel algorithm, the complex gradient descent and complex probability mapping are combined. Fast Fourier transform acceleration and clustering prior constraints are used on the targets to improve the efficiency and accuracy of the model. Simulation results of planar arrays show that the proposed method has superior beam resolution, sidelobe suppression, running time, and noise immunity compared with those of intensity-based methods.


  • Open Access

    Extreme Sparse-Array Synthesis via Iterative Convex Optimization and Simulated-Annealing Expanded Array

    by Boxuan Gu, Rongxin Jiang, Xuesong Liu, Yaowu Chen

    Sparse-array synthesis can considerably reduce the number of sensor elements while optimizing the beam-pattern response performance. The sparsity of an array is related to the degrees of freedom of the array elements. A sparse-array method based on iterative convex optimization and a simulated-annealing expanded array is proposed in this paper. This method transforms the sparse-array problem into a minimum l1 norm problem and obtains the sparse array by solving the convex optimization problem using the primal-dual algorithm. Meanwhile, to improve the degree of freedom, array elements are expanded using stochastic perturbation. According to the simulated-annealing algorithm, the closed array elements are reopened with a specific probability, which is iteratively thinned and expanded. The results show that the proposed method can obtain an extremely sparse array, which is better than that obtained using the existing methods.


  • An Efficient Near-Field Model Gain-Phase Self-Calibration Method for Uniform Rectangular Arrays

    by Fei Wang, Rongxin Jiang, Xiang Tian, Xuesong Liu, Shiyao Jiang, Boxuan Gu, Yaowu Chen

    Large uniform rectangular arrays (URAs) are widely used in 3-D underwater imaging systems to obtain high-quality images; however, the gain and phase errors of these arrays can distort the results. To restore the image quality, many calibration methods have been proposed, most of which adopt a far-field model. This model requires the calibrator source to be far away, which reduces the signal-to-noise ratio and adversely affects the calibration accuracy. An effective means of alleviating this contradiction is to adopt the near-field signal model. However, the source location estimation in the near-field model typically uses spectral peak searches, which is a significant computational burden, particularly for large URAs. A fast and efficient near-field model self-calibration method for large URAs is proposed to obtain improved calibration results. First, a convenient preprocessing and two extended three-step iterative algorithms are used instead of spectral peak searches to estimate the source location efficiently. The array is then calibrated using a spatial matched filter and maximum a posteriori approach. Numerical results proved that the proposed method almost reaches the Cramér–Rao bound. Compared with existing near-field model calibration methods using spectral peak searches, the computational complexity of the proposed method is reduced by more than three orders of magnitude when the array size reaches 60 $\times $ 60 or more. By virtue of the near-field model, the phase calibration accuracy for large URAs at a close range is more than 10 times that of far-field model calibration methods.


  • Combination Complex-Valued Bayesian Compressive Sensing Method for Sparsity Constrained Deconvolution Beamforming

    by Fei Wang, Xiang Tian, Xuesong Liu, Boxuan Gu, Fan Zhou, Yaowu Chen

    Several deconvolution methods have been proposed to reduce the mainlobe width and sidelobe intensity of conventional beamforming results without increasing the array aperture; however, most of them cannot perform well in the face of coherent targets. Therefore, it is discerning to deconvolve the complex-valued beamforming result rather than the beamforming intensity. However, conventional deconvolution methods focus on the beam intensity, and only a few studies have investigated complex-valued deconvolution beamforming (CDB). Considering the sparse property of the targets in practice, the CDB can be converted to a complex-valued inverse compressive sensing problem and put into the Bayesian framework. To solve it efficiently, a complex-valued relevance-vector-machine (RVM) tool is used to build the complex-valued Bayesian compressive sensing (C-BCS) method that has excellent performance in terms of recovery accuracy and operating speed. However, the C-BCS method is not stable for the CDB because the point spread function is a rank deficiency matrix. To overcome this problem, we propose the combination C-BCS method that combines the block-sparse and C-BCS methods to improve the performance of solving the CDB. The simulation results proved that the proposed method performed better than intensity-based deconvolution methods for the beamforming results generated by the coherent targets. A beamforming image of a pool scene captured by a narrowband forward-looking sonar system was adopted to test various deconvolution methods, and the proposed method exhibited superiority in sidelobe suppression.


  • A Bayesian Compressive Sensing-Based Planar Array Diagnosis Approach From Near-Field Measurements

    by Zhenwei Lin, Yaowu Chen, Xuesong Liu, Rongxin Jiang, Binjian Shen

    Array diagnosis is an important tool for detecting and correcting array antennas failures. In this letter, a high-precision planar array diagnosis method based on the Bayesian compressive sensing theory is proposed. The model of a near-field signal with a spherical wavefront is used to acquire the measured data. Then, the difference between the beam pattern of the reference array and the array under test is obtained. The array diagnosis problem involves finding the difference between the weights of the reference and of the array under test with known differences between patterns. This problem is reformulated in a Bayesian compressive sensing framework and can be efficiently solved using a fast relevance vector machine. Numerical results confirm the superiority of the proposed method in terms of diagnostic accuracy and computational efficiency than those in previous studies.


  • Design of Low-Complexity 3-D Underwater Imaging System With Sparse Planar Arrays

    by Dongdong Zhao, Fan Zhou, Rongxin Jiang, Xuesong Liu, Yaowu Chen

    The development of a real-time 3-D underwater imaging system with a planar array is restricted by the huge hardware cost and computational burden associated with the large number of elements required. In this paper, a new design of low-complexity 3-D underwater imaging system is proposed, involving two key parts: a special sparse array with low hardware cost and an efficient beamforming with low computational burden. Especially, the simulated annealing algorithm is optimized based on distributed and parallel subarray (DPS) beamforming and results in fewer active elements than existing methods. To improve the computational efficiency especially for sparse arrays, an optimized DPS beamforming is presented with the pruning fast Fourier transform technology. To test the validity of the design, a real system based on the proposed methods was devised and employed in the lake and sea trials. The experiment results demonstrate that the low-complexity 3-D underwater imaging system can provide a satisfactory imaging quality.