Yu Zhang

Yu Zhang

Auto-generated profile, based on publicly available information

Yu Zhang

School of Mathematics and Statistics, Beijing Institute of Technology, Beijing, 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
5 December 2024 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
JCJian Yi Chen
Jian Yi Chen
YZYu Zhang
Yu Zhang
BLBing-Zhao Li
Bing-Zhao Li
This paper proposes a graph linear canonical transform (GLCT) by decomposing the linear canonical parameter matrix into fractional Fourier transform, scale transform, and chirp modulation for graph signal processing. The GLCT enables adjustable smoothing modes, enhancing alignment with graph signals. Leveraging traditional fractional domain time-frequency analysis, we investigate vertex-frequency analysis in the graph linear canonical domain, aiming to overcome limitations in capturing local information. Filter design methods, including optimal design and learning with stochastic gradient descent, are analyzed and applied to image classification tasks. The proposed GLCT and vertex-frequency analysis present innovative approaches to signal processing challenges, with potential applications in various fields.

13 February 2025 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
YZYu Zhang
Yu Zhang
BLBing-Zhao Li
Bing-Zhao Li
Graph signal processing (GSP) leverages the inherent signal structure within graphs to extract high-dimensional data without relying on translation invariance. It has emerged as a crucial tool across multiple fields, including learning and processing of various networks, data analysis, and image processing. In this paper, we introduce the graph fractional Fourier transform in Hilbert space (HGFRFT), which provides additional fractional analysis tools for generalized GSP by extending Hilbert space and vertex domain Fourier analysis to fractional order. First, we establish that the proposed HGFRFT extends traditional GSP, accommodates graphs on continuous domains, and facilitates joint time-vertex domain transform while adhering to critical properties such as additivity, commutativity, and invertibility. Second, to process generalized graph signals in the fractional domain, we explore the theory behind filtering and sampling of signals in the fractional domain. Finally, our simulations and numerical experiments substantiate the advantages and enhancements yielded by the HGFRFT.

1 June 2026 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
YZYu Zhang
Yu Zhang
Linyu PengLinyu Peng
Linyu Peng
BLBing-Zhao Li
Bing-Zhao Li
Graph signals are widely used to describe vertex attributes or features in graph-structured data, with applications spanning the internet, social media, transportation, sensor networks, and biomedicine. Graph signal processing (GSP) has emerged to facilitate the analysis, processing, and sampling of such signals. While kernel methods have been extensively studied for estimating graph signals from samples provided on a subset of vertices, their application to complex-valued graph signals remains largely unexplored. This paper introduces a novel framework for reconstructing graph signals using kernel methods on complex manifolds. By embedding graph vertices into a higher-dimensional complex ambient space that approximates a lower-dimensional manifold, the framework extends the reproducing kernel Hilbert space to complex manifolds. It leverages Hermitian metrics and geometric measures to characterize kernels and graph signals. Additionally, several metric-induced and graph fractional spectral kernels are proposed for reconstructing complex graph signals. Finally, experimental results on synthetic and real-world datasets demonstrate the effectiveness of this framework in accurately reconstructing complex graph signals, outperforming conventional kernel-based approaches. This work lays a foundational basis for integrating complex geometry and kernel methods in GSP.

14 March 2024
Verified
Conference Paper
Open access
YZYu Zhang
Yu Zhang
With the flourishing development of graph signal processing, an increasing number of classical signal processing methods are being incorporated into this field, and the graph linear canonical transform (GLCT) is one such example. In this paper, we address the problem of signal sampling set selection in the GLCT domain based on the proposed GLCT sampling theory. We present a novel fast sampling method. Furthermore, we discuss the relationship between the proposed method and existing sampling set selection methods based on the GLCT spectrum. It is demonstrated that the proposed method considers GLCT spectrum information without the need for the eigendecomposition of the variation operator. Finally, the performance of the proposed method was validated through the selection of vertices, comparing results in terms of reconstruction error and recovery time, which demonstrated its superior efficacy.

4 March 2025
Verified
Conference Paper
Open access
YZYu Zhang
Yu Zhang
BLBing-Zhao Li
Bing-Zhao Li
HXHongcai Xin
Hongcai Xin

1 January 2026 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
YZYu Zhang
Yu Zhang
BLBing-Zhao Li
Bing-Zhao Li