Downsampling of Signals on Graphs Via Maximum Spanning Trees

DOI10.1109/TSP.2014.2369013zbMath1394.94830OpenAlexW2011100624MaRDI QIDQ4579669

Ha Q. Nguyen, Minh N. do

Publication date: 22 August 2018

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

Full work available at URL: https://doi.org/10.1109/tsp.2014.2369013

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of graph theory to circuits and networks (94C15) Sampling theory in information and communication theory (94A20)

Related Items (5)

Extrapolation and sampling for processes on spatial graphs ⋮ Data Analytics on Graphs Part II: Signals on Graphs ⋮ Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST) ⋮ Random sampling of bandlimited signals on graphs ⋮ Intertwining wavelets or multiresolution analysis on graphs through random forests

This page was built for publication: Downsampling of Signals on Graphs Via Maximum Spanning Trees