TL;DR
This paper introduces GraphTRSS, a novel algorithm for reconstructing time-varying graph signals using Sobolev smoothness, which converges faster and outperforms existing methods on various datasets.
Contribution
The paper proposes a new Sobolev smoothness-based algorithm for time-varying graph signal reconstruction, with theoretical convergence analysis and improved performance.
Findings
Faster convergence than Laplacian-based methods.
Outperforms state-of-the-art methods on COVID-19 datasets.
Effective in environmental signal recovery.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
