Spectral Domain Sampling of Graph Signals

DOI10.1109/TSP.2018.2839620zbMATH Open1415.94247arXiv1706.05147MaRDI QIDQ4622263FDOQ4622263

Publication date: 12 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: Sampling methods for graph signals in the graph spectral domain are presented. Though conventional sampling of graph signals can be regarded as sampling in the graph vertex domain, it does not have the desired characteristics in regard to the graph spectral domain. With the proposed methods, the down- and upsampled graph signals inherit the frequency domain characteristics of the sampled signals defined in the time/spatial domain. The properties of the sampling effects were evaluated theoretically in comparison with those obtained with the conventional sampling method in the vertex domain. Various examples of signals on simple graphs enable precise understanding of the problem considered. Fractional sampling and Laplacian pyramid representation of graph signals are potential applications of these methods.

Full work available at URL: https://arxiv.org/abs/1706.05147

Mathematics Subject Classification ID

Applications of graph theory (05C90) Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Cited In (2)

This page was built for publication: Spectral Domain Sampling of Graph Signals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622263)