The network nullspace property for compressed sensing over networks

Alexander Jung, Ayelet Heimowitz, Yonina C. Eldar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We study compressed sensing of graph signals defined over complex networks. In particular, we propose and analyze a convex optimization method for recovering smooth graph signals from a small number of samples. Assuming the true underlying graph signal to be constant over well connected subset of nodes (clusters), we derive a sufficient condition on the sampling set and network structure such that the proposed convex method is accurate. This condition, which we coin the network nullspace property, characterizes which nodes of the graph should be sampled in order to retain the full information about the underlying graph signal.

Original languageEnglish
Title of host publication2017 12th International Conference on Sampling Theory and Applications, SampTA 2017
EditorsGholamreza Anbarjafari, Andi Kivinukk, Gert Tamberg
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages644-648
Number of pages5
ISBN (Electronic)9781538615652
DOIs
StatePublished - 1 Sep 2017
Externally publishedYes
Event12th International Conference on Sampling Theory and Applications, SampTA 2017 - Tallinn, Estonia
Duration: 3 Jul 20177 Jul 2017

Publication series

Name2017 12th International Conference on Sampling Theory and Applications, SampTA 2017

Conference

Conference12th International Conference on Sampling Theory and Applications, SampTA 2017
Country/TerritoryEstonia
CityTallinn
Period3/07/177/07/17

Keywords

  • big data
  • complex networks
  • compressed sensing
  • convex optimzation
  • semisupervised learning

Fingerprint

Dive into the research topics of 'The network nullspace property for compressed sensing over networks'. Together they form a unique fingerprint.

Cite this