Zao Wang

Zao Wang

Auto-generated profile, based on publicly available information

Zao Wang

School of information and Engineering, Nanchang University (NCU), Nanchang, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 May 2025 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
ZWZao Wang
Zao Wang
Song ZhouSong Zhou
Song Zhou
YWYuhao Wang
Yuhao Wang
LYLei Yang
Lei Yang
Mengdao  XingMengdao Xing
Mengdao Xing
PWPin Wen
Pin Wen
By equipping the synthetic aperture radar (SAR) sensors on multiple unmanned aerial vehicles (UAVs) to form a UAV swarm (UAVS) and operate collaboratively, UAVS-SAR presents the significant advantages of rapid echoes acquisition, high imaging frame rate as well as high system survivability for advanced SAR applications. However, due to the flexible trajectories as well as the distributed configuration, the problem of the spectrum blurring in the UAVS-SAR is more complicated than that of the conventional monostatic/bistatic SAR configurations, which makes the current fast time domain algorithms (FTDAs) difficult to achieve high imaging performance. In this paper, a novel fast time domain algorithm (FTDA) is developed for UAVS-SAR imaging with both high efficiency and promising accuracy. By developing the hierarchical framework based on the designed spectrum alignment function, the imaging procedures can be realized recursively where back projection (BP) operations are reduced dramatically, and then, the total computational burden are decreased consequently. Moreover, the trajectory difference of the UAVS formation is particularly considered for practical applications, which will inevitably degrade the coherence among the sub-images from different UAV platforms. To address this problem, a correction procedure is designed according to the distributed geometrical configuration. As the coherence between the sub-images is adequately maintained, the data-driven motion compensation (MOCO) is readily developed to remove the residual phase errors to achieve desirable imaging performance. Simulations and raw data experiments are presented to validate the advantages of the proposed algorithm.

20 January 2025 in IEEE Transactions on Antennas and Propagation
Verified
Journal Article
Closed access
Song ZhouSong Zhou
Song Zhou
MSMing Shi
Ming Shi
min baomin bao
min bao
ZWZao Wang
Zao Wang
Mengdao  XingMengdao Xing
Mengdao Xing
PWPin Wen
Pin Wen
Due to the complex detection environment of ground penetrating radar (GPR), time-domain algorithm (TDA) can accurately accommodate the wave path variations in layered medium, which presents significant potentials to achieve high focusing quality for GPR-synthetic aperture radar (GPR-SAR) imaging. However, the current TDAs will involve huge interpolation operations and bring redundant computational burden in the processing, which will inevitably degrade the algorithm performance. In this paper, a fast subsurface Cartesian factorized back-projection (SCFBP) algorithm is proposed for GPR-SAR imaging, where the sub-image spectrum properties of the layered medium are investigated particularly and a two-step spectrum compression is developed according to the permittivity. As the sub-image spectrums are effectively aligned and compressed, only a very low Nyquist sampling rate (NSR) is required for the non-interpolated sub-image merging process, which will dramatically decrease the computational burden to achieve high performance both in efficiency and accuracy. Moreover, the inaccurate permittivity of the underground medium is particularly considered in GPR-SAR applications. By establishing the mapping relationship between the inaccurate permittivity of the underground medium and the introduced phase error in the imaging process, a fast echo-based compensation is developed with SCFBP, which can effectively eliminate the effects of the inaccurate permittivity on the imaging quality and accurately invert the permittivity of the underground medium for subsequent medium classification and identification. Promising results from both simulation and raw data experiments are presented and analyzed to validate the performance advantages of the proposed algorithm.

24 December 2024 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
Song ZhouSong Zhou
Song Zhou
JCJing Chen
Jing Chen
ZWZao Wang
Zao Wang
YWYuhao Wang
Yuhao Wang
PWPin Wen
Pin Wen
Deep learning has been successfully applied to solve the synthetic aperture radar (SAR) imaging problem which shows superior imaging performance to compressive sensing (CS)-based methods under sparse sampling conditions. However, due to the computation of the large-scale matrix, the optimal searching in an iterative manner will involve tremendous computational complexity with slow convergence, which will prevent deep learning algorithms from being efficiently applied for SAR imaging. To address this problem, an efficient network is proposed for SAR imaging under sparse sampling conditions, which can be designed by an improved conjugate gradient (CG) optimization strategy. First, the large-scale matrix in the CG algorithm can be approximately decomposed by introducing a matched filtering (MF)-based operator, which will facilitate the gradient computation with high efficiency during the optimization process. Second, the strategy utilizes the advantages of CG optimization to precisely eliminate the error component with conjugate searching in each iteration to achieve fast convergence. By incorporating the improved CG into the convolutional neural network (CNN), the network can be developed to automatically learn the prior information and parameters from the training data, based on which the efficiency of the designed network can be increased dramatically to achieve high imaging performance for SAR applications, especially in the cases of wide-scene and high-resolution imaging. Experimental results show that the proposed network exhibits excellent imaging performance and high computational efficiency in SAR imaging of point targets, surface targets, and different types of real scenes.

20 May 2026 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
Song ZhouSong Zhou
Song Zhou
BYBaolian Yu
Baolian Yu
ZWZao Wang
Zao Wang
CLChunquan Li
Chunquan Li
PWPin Wen
Pin Wen
Mengdao  XingMengdao Xing
Mengdao Xing
By equipping video synthetic aperture radar (ViSAR), flexible-trajectory maneuvering platforms (MPs) can significantly enhance their remote sensing capability in complex environments. The fast time-domain algorithms (FTDAs) are independent of the azimuth-invariant assumption and can effectively adapt to flexible curved trajectories in maneuvering platform (MP) applications. However, when MPViSAR operates in high-frame-rate (HFR) mode through high aperture overlapping, the data volume increases tremendously, which brings significant difficulties in achieving fast imaging. In this paper, a new FTDA based on spectrum first-in-first-out (SFIFO) update strategy is proposed for MPViSAR by elaborately exploring the correlative properties of consecutive frame images. Initially, a tractable time-frequency relationship is established by applying tilted spectrum correction and alignment, which facilitates the efficient separation of obsolete spectrum fragments and the fusion of newly acquired ones directly in the spectrum domain. Based on this strategy, only a very small data segment needs to be processed for each frame update, enabling fast frame-by-frame image generation with the computational burden dramatically reduced compared to full-aperture processing. Furthermore, coherent motion compensation is also performed based on the proposed SFIFO update strategy, which significantly decreases the computational burdens of error compensation and effectively achieves high focusing quality of MPViSAR images. Promising results from both simulation and raw data experiments are provided and analyzed to validate the high performance of the proposed algorithm.