Abstract
We consider the problem of recovering a graph signal, sparse in the graph spectral domain from a few number of samples. In contrast to most previous work on the sampling of graph signals, the setting is “spectrum-blind” where we are unaware of the graph d support of the signal. We propose a class of spectrum-blind graph signals and study two recovery strategies based on random and experimentally designed sampling inspired by the compressed sensing paradigm. We further show sampling bounds for graphs, including Erdős-Renyi random graphs. We show that experimentally designed sampling significantly outperforms random sampling for some irregular graph families.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
