Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
From MaRDI portal
Publication:4622066
DOI10.1109/TSP.2016.2546233zbMath1414.94853arXiv1510.00297MaRDI QIDQ4622066
Aamir Anis, Antonio Ortega, Akshay Gadde
Publication date: 8 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.00297
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Related Items (11)
Approximation theorems on graphs ⋮ Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures ⋮ Extrapolation and sampling for processes on spatial graphs ⋮ Data Analytics on Graphs Part II: Signals on Graphs ⋮ Random sampling of bandlimited signals on graphs ⋮ Graphical designs and gale duality ⋮ A low discrepancy sequence on graphs ⋮ Codes, cubes, and graphical designs ⋮ Invertibility of graph translation and support of Laplacian Fiedler vectors ⋮ Unnamed Item ⋮ Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
This page was built for publication: Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies