Signals on Graphs: Uncertainty Principle and Sampling

DOI10.1109/TSP.2016.2573748zbMath1414.94874DBLPjournals/tsp/TsitsveroBL16arXiv1507.08822OpenAlexW2215668387WikidataQ56806134 ScholiaQ56806134MaRDI QIDQ4620937

Mikhail Tsitsvero, Sergio Barbarossa, Paolo Di Lorenzo

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/1507.08822

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Related Items (14)

Approximation theorems on graphs ⋮ Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures ⋮ Graph signal sampling and interpolation based on clusters and averages ⋮ Spatio-spectral limiting on Boolean cubes ⋮ Graph signal interpolation with positive definite graph basis functions ⋮ Gabor-type frames for signal processing on graphs ⋮ Data Analytics on Graphs Part II: Signals on Graphs ⋮ Graphical designs and gale duality ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Codes, cubes, and graphical designs ⋮ Unnamed Item ⋮ Graph theoretic uncertainty and feasibility ⋮ Spatio-spectral limiting on discrete tori: adjacency invariant spaces ⋮ Spatio–Spectral Limiting on Redundant Cubes: A Case Study

This page was built for publication: Signals on Graphs: Uncertainty Principle and Sampling