Graph Sampling with and Without Input Priors
Sundeep Prabhakar Chepuri (TU Delft - Signal Processing Systems)
Yonina C. Eldar (Technion)
Geert Leus (TU Delft - Signal Processing Systems)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
In this paper the focus is on sampling and reconstruction of signals supported on nodes of arbitrary graphs or arbitrary signals that may be represented using graphs, where we extend concepts from generalized sampling theory to the graph setting. To recover such signals from a given set of samples, we develop algorithms that incorporate prior knowledge on the original signal when available such as smoothness or subspace priors related to the underlying graph. For reconstructing arbitrary signals, we constrain the reconstruction to the graph, and provide a consistent reconstruction method, in which both the reconstructed signal and the input yield exactly the same measurements. Given a set of graph frequency domain samples, the sampling and interpolation operations may be efficiently implemented using linear shift-invariant graph filters.