Abstract
We consider the problem of recovering a smooth graph signal from noisy samples taken at a small number of graph nodes. The recovery problem is formulated as a convex optimization problem which minimizes the total variation (accounting for the smoothness of the graph signal) while controlling the empirical error. We solve this total variation minimization problem efficiently by applying a recent algorithm proposed by Nesterov for non-smooth optimization problems. Furthermore , we develop a distributed implementation of our algorithm and verify the performance of our scheme on a large-scale real-world dataset.
Original language | English |
---|---|
Title of host publication | Conference Record of the 50th Asilomar Conference on Signals, Systems and Computers, ACSSC 2016 |
Publisher | IEEE |
Pages | 1839-1843 |
Number of pages | 5 |
ISBN (Electronic) | 9781538639542 |
DOIs | |
Publication status | Published - 1 Mar 2017 |
MoE publication type | A4 Conference publication |
Event | Asilomar Conference on Signals, Systems & Computers - Pasific Grove, United States Duration: 6 Nov 2016 → 9 Nov 2016 Conference number: 50 http://www.asilomarsscconf.org/ |
Publication series
Name | Conference Record of the Asilomar Conference on Signals Systems and Computers |
---|---|
ISSN (Print) | 1058-6393 |
Conference
Conference | Asilomar Conference on Signals, Systems & Computers |
---|---|
Abbreviated title | ASILOMAR |
Country/Territory | United States |
City | Pasific Grove |
Period | 06/11/2016 → 09/11/2016 |
Internet address |