Reconstruction of Time-varying Graph Signals via Sobolev Smoothness
arXiv:2207.06439 · doi:10.1109/TSIPN.2022.3156886
Abstract
Graph Signal Processing (GSP) is an emerging research field that extends the concepts of digital signal processing to graphs. GSP has numerous applications in different areas such as sensor networks, machine learning, and image processing. The sampling and reconstruction of static graph signals have played a central role in GSP. However, many real-world graph signals are inherently time-varying and the smoothness of the temporal differences of such graph signals may be used as a prior assumption. In the current work, we assume that the temporal differences of graph signals are smooth, and we introduce a novel algorithm based on the extension of a Sobolev smoothness function for the reconstruction of time-varying graph signals from discrete samples. We explore some theoretical aspects of the convergence rate of our Time-varying Graph signal Reconstruction via Sobolev Smoothness (GraphTRSS) algorithm by studying the condition number of the Hessian associated with our optimization problem. Our algorithm has the advantage of converging faster than other methods that are based on Laplacian operators without requiring expensive eigenvalue decomposition or matrix inversions. The proposed GraphTRSS is evaluated on several datasets including two COVID-19 datasets and it has outperformed many existing state-of-the-art methods for time-varying graph signal reconstruction. GraphTRSS has also shown excellent performance on two environmental datasets for the recovery of particulate matter and sea surface temperature signals.
References in corpus (20)
- 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
- Learning graphs from data: A signal representation perspective
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Signals on Graphs: Uncertainty Principle and Sampling
- Signal Recovery on Graphs: Variation Minimization
- Stationary signal processing on graphs
- Graph-based compression of dynamic 3D point cloud sequences
- Graph signal processing for machine learning: A review and new perspectives
- Graph Frequency Analysis of Brain Signals
- Kernel-based Reconstruction of Graph Signals
- Honeycombs and sums of Hermitian matrices
- Forecasting Time Series with VARMA Recursions on Graphs
- Adaptive Least Mean Squares Estimation of Graph Signals
- A Distributed Tracking Algorithm for Reconstruction of Graph Signals
- A Sampling Theory Perspective of Graph-based Semi-supervised Learning
- Sampling of graph signals via randomized local aggregations
- Kernel-based Graph Learning from Smooth Signals: A Functional Viewpoint