Wanyuan Cai

Wanyuan Cai

Auto-generated profile, based on publicly available information

Wanyuan Cai

Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
27 September 2021 in IEEE Geoscience and Remote Sensing Letters
Verified
Journal Article
Closed access
WCWanyuan Cai
Wanyuan Cai
JJJunzheng Jiang
Junzheng Jiang
SOShan Ouyang
Shan Ouyang
Hyperspectral image (HSI) is often corrupted by various kinds of noises. This letter proposes an innovative HSI denoising approach by leveraging the graph signal processing (GSP) theory and the low-rank (LR) matrix recovery model. With GSP, the piecewise smoothness (PWS) property of the HSI can be efficiently characterized, leading to a new regularization for HSI denoising, termed the adaptive weight graph total variation (AWGTV) regularization. Then, the denoising problem is formulated into a constrained optimization problem that incorporates the AWGTV and the LR property of the HSI. An augmented Lagrange multiplier method is adopted to solve the problem. Numerical experiments conducted on synthetic and real-world datasets and comparisons with existing methods demonstrate the effectiveness of the proposed denoising algorithm.

6 February 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
WCWanyuan Cai
Wanyuan Cai
JJJunzheng Jiang
Junzheng Jiang
JQJiang Qian
Jiang Qian
Hyperspectral image (HSI) is often disturbed by various kinds of noise, which brings great challenges to subsequent applications. Many of the existing restoration algorithms do not scale well for HSI with large size. This paper proposes a novel mixed-noise removal method for HSI with large size, by leveraging the superpixel segmentation-based technology and distributed algorithm based on graph signal processing. First, the underlying structure of the HSI is modeled by a two-layer architecture graph. The upper layer, called skeleton graph, is a rough graph constructed by using the modified k -nearest-neighborhood algorithm and its nodes correspond to a series of superpixels formed by HSI segmentation. The skeleton graph can efficiently characterize the inter-correlations between superpixels, while preserving the boundary information and reducing the computational complexity. The lower layer, called detailed graph consisting of a series of local graphs which are constructed to model the similarities between pixels. Second, based on the two-layer graph architecture, the HSI restoration problem is formulated as a series of optimization problems each of which resides on a subgraph. In each optimization problem, a graph Laplacian regularization is defined and incorporated into a low-rank-based model. Third, a novel distributed algorithm is tailored for the restoration problem, by using the information interaction between the nodes of skeleton graph and subgraphs. Numerical experiments conducted on both synthetic and real-world datasets demonstrate the effectiveness of the proposed restoration algorithm compared with existing methods.

14 March 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
WCWanyuan Cai
Wanyuan Cai
YLYouming Li
Youming Li
YWYonghong Wu
Yonghong Wu
MSMenglei Sheng
Menglei Sheng
QQQinke Qi
Qinke Qi
QGQiang Guo
Qiang Guo
Severe Doppler shift and the obstruction of the Line-of-Sight (LoS) path significantly decrease the communication performance. This article considers a downlink channel estimation problem for reconfigurable intelligent surface (RIS)-aided millimeter-wave (mmWave) multiple-input-multiple-output nonorthogonal multiple access (MIMO-NOMA) system in Internet of Vehicles (IoV) with high-mobility scenarios. By introducing the concept of aggregated slot and half slot, a 5G subframe partitioning scheme without changing the standard 5G frame structure is first proposed to facilitate the formulation of the received signal. Then, the received signal is modeled as a quadrilinear tensor, meeting with a canonical polyadic decomposition (CPD) form, which separates Angle of Arrival (AoA), Angle of Departure (AoD), time delay, and Doppler shift into four corresponding factor matrices and avoids parameters coupling. Subsequently, by leveraging the Vandermonde structure of the factor matrix and the low-rank property of the mmWave channel, we design a four-dimension (4-D) structured tensor decomposition-based method to decompose the tensor into four factor matrices in a closed-form solution, which can avoid initialization and iteration. Accordingly, the channel parameters can be extracted by a simple correlation-based estimator. After obtaining the channel parameters, we construct a least squares problem to obtain the channel path gain, which can avoid solving the scaling matrix. Finally, numerical experiments are conducted to confirm the effectiveness of the proposed algorithm, in which the Cramér-Rao bound (CRB) results for channel parameters are derived as the benchmark.

2 December 2024 in IEEE Communications Letters
Verified
Journal Article
Closed access
MSMenglei Sheng
Menglei Sheng
YLYouming Li
Youming Li
WCWanyuan Cai
Wanyuan Cai
QQQinke Qi
Qinke Qi
ZWZhenqian Wu
Zhenqian Wu
YWYonghong Wu
Yonghong Wu
We discuss the user localization problem assisted by reconfigurable intelligent surfaces (RIS) in millimeter-wave (mmWave) multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. By exploring the inherent sparse scattering characteristics of mmWave channels, we propose a tensor decomposition based method to obtain the channel parameters (i.e. angle, delay) required for user localization. Specifically, the received signal is modeled as a low-rank third-order tensor fitting a typical polyhedral model which contains a factor matrix of channel parameters. Then, we design a structured tensor decomposition method to estimate the channel parameters by using the Vandermonde property of factor matrices. Finally, based on the least squares criterion, the location of user are obtained from the estimated channel parameters. Simulation results show that the proposed estimation scheme can achieve a centimeter-level resolution of user localization.

8 May 2024 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
WCWanyuan Cai
Wanyuan Cai
YLYouming Li
Youming Li
XZXiaolong Zhang
Xiaolong Zhang
TJTao Jiang
Tao Jiang
QQQinke Qi
Qinke Qi
This letter proposes a method for impulsive noise (IN) suppression in non-orthogonal multiple access (NOMA) downlink system by leveraging the graph signal processing (GSP) and ℓq-norm-based sparse signal recovery theories. Within GSP framework, we propose a graph-based representation to characterize the underlying structure of the sub-carriers. Accordingly, the graph Laplacian regularization (GLR) is defined to capture the similarities between sub-carriers. Then, the IN suppression problem is formulated as a constraint optimization problem, incorporating the ℓq-norm and GLR, which can efficiently characterize the sparsity of IN and the underlying structure of the sub-carriers. Finally, an augment Lagrange multiplier (ALM) framework is introduced to solve the optimization problem. Numerical experiment results illustrate the effectiveness of the proposed method in comparison with existing methods.

9 April 2025 in Signal Processing
Verified
Journal Article
Closed access
WLWenjuan Li
Wenjuan Li
MJMing Jin
Ming Jin
JJJunzheng Jiang
Junzheng Jiang
QGQinghua Guo
Qinghua Guo
WCWanyuan Cai
Wanyuan Cai