Joint Time-Vertex Fractional Fourier Transform
arXiv:2203.07655 · doi:10.1016/j.sigpro.2025.109944
Abstract
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.
References in corpus (26)
- Emergence of scaling in random networks
- A Comprehensive Survey on Graph Neural Networks
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Geometric deep learning: going beyond Euclidean data
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Perfect Reconstruction Two-Channel Wavelet Filter-Banks for Graph Structured Data
- GSPBOX: A toolbox for signal processing on graphs
- Autoregressive Moving Average Graph Filtering
- Stationary signal processing on graphs
- Stationary Graph Processes and Spectral Estimation
- Graph signal processing for machine learning: A review and new perspectives
- Robust Spatial Filtering with Graph Convolutional Neural Networks
- Forecasting Time Series with VARMA Recursions on Graphs
- Fast Robust PCA on Graphs
- Graph Unrolling Networks: Interpretable Neural Networks for Graph Signal Denoising
- Approximate fast graph Fourier transforms via multi-layer sparse approximations
- Graph Signal Processing and Deep Learning: Convolution, Pooling, and Topology
- Reconstruction of Time-varying Graph Signals via Sobolev Smoothness
- A Directed Graph Fourier Transform with Spread Frequency Components
- Graph Fourier Transform: A Stable Approximation
- Fast Graph Fourier Transforms Based on Graph Symmetry and Bipartition
- Bayesian Estimation of Graph Signals
- Graph Signal Processing: Vertex Multiplication
- Sampling Theory of Jointly Bandlimited Time-vertex Graph Signals
- Infection Analysis on Irregular Networks through Graph Signal Processing