Downsampling of Signals on Graphs Via Maximum Spanning Trees

DOI10.1109/TSP.2014.2369013zbMATH Open1394.94830OpenAlexW2011100624MaRDI QIDQ4579669FDOQ4579669

Authors: 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)

Cited In (6)

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

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

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