Graph signal processing (GSP) facilitates the analysis of high-dimensional data on non-Euclidean domains by utilizing graph signals defined on graph vertices. In addition to static data, each vertex can provide continuous time-series signals, transforming graph signals into time-series signals on each vertex. The joint time-vertex Fourier transform (JFT) framework offers spectral analysis capabilities to analyze these joint time-vertex signals. Analogous to the fractional Fourier transform (FRT) extending the ordinary Fourier transform (FT), we introduce the joint time-vertex fractional Fourier transform (JFRT) as a generalization of JFT. The JFRT enables fractional analysis for joint time-vertex processing by extending Fourier analysis to fractional orders in both temporal and vertex domains. We theoretically demonstrate that JFRT generalizes JFT and maintains properties such as index additivity, reversibility, reduction to identity, and unitarity for specific graph topologies. Additionally, we derive Tikhonov regularization-based denoising in the JFRT domain, ensuring robust and well-behaved solutions. Comprehensive numerical experiments on synthetic and real-world datasets highlight the effectiveness of JFRT in denoising and clustering tasks that outperform state-of-the-art approaches.
School of Mathematics and Statistics, Nanjing University of Information Science and Technology（南京信息工程大学数学与统计学院）；Hubei Key Laboratory of Applied Mathematics, Hubei University（湖北大学应用数学湖北省重点实验室）
Optimal Sampling and Reconstruction of Graph Signals in the Fractional Fourier Domain
Nanjing University of Information Science and Technology（南京信息工程大学）；Hubei University（湖北大学）；Shanghai Jiao Tong University（上海交通大学）；Nanjing Institute of Technology（南京工程学院）
A Unified Framework for 2D Nonseparable Fractional Fourier Transform: From Geometric Completeness to Applications
Nanjing University of Information Science and Technology（南京信息工程大学）；Hubei University（湖北大学）；Shanghai Jiao Tong University（上海交通大学）；Hainan Normal University（海南师范大学）
