Weighted sampling and weighted interpolation on combinatorial graphs
arXiv:1905.02603
Abstract
For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are suggested. The first two of them are using language of dual Hilbert frames and the so-called frame algorithm respectively. The third one is using the so-called weighted variational interpolating splines which are constructed in the setting of combinatorial graphs. This development requires a new set of Poincaré-type inequalities which we prove for functions on combinatorial graphs.
arXiv commentarXiv admin note: text overlap with arXiv:1901.08726
References in corpus (5)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs: Sampling Theory
- Signals on Graphs: Uncertainty Principle and Sampling
- Local-set-based Graph Signal Reconstruction
- Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI