Sampling Theory of Jointly Bandlimited Time-vertex Graph Signals
arXiv:2508.21412 · doi:10.1016/j.sigpro.2024.109522
Abstract
Time-vertex graph signal (TVGS) models describe time-varying data with irregular structures. The bandlimitedness in the joint time-vertex Fourier spectral domain reflects smoothness in both temporal and graph topology. In this paper, we study the critical sampling of three types of TVGS including continuous-time signals, infinite-length sequences, and finite-length sequences in the time domain for each vertex on the graph. For a jointly bandlimited TVGS, we prove a lower bound on sampling density or sampling ratio, which depends on the measure of the spectral support in the joint time-vertex Fourier spectral domain. We also provide a lower bound on the sampling density or sampling ratio of each vertex on sampling sets for perfect recovery. To demonstrate that critical sampling is achievable, we propose the sampling and reconstruction procedures for the different types of TVGS. Finally, we show how the proposed sampling schemes can be applied to numerical as well as real datasets.
arXiv commentThis paper was published in Signal Processing, Elsevier
References in corpus (10)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Event-based Vision: A Survey
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Connecting the Dots: Identifying Network Structure via Graph Signal Processing
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Everything is Connected: Graph Neural Networks
- A Hilbert Space Theory of Generalized Graph Signal Processing
- DCT and DST Filtering with Sparse Graph Operators
- Node Copying: A Random Graph Model for Effective Graph Sampling