Distributed Compressed Sensing for Static and Time-Varying Networks

  title={Distributed Compressed Sensing for Static and Time-Varying Networks},
  author={Stacy Patterson and Yonina C. Eldar and Idit Keidar},
  journal={IEEE Transactions on Signal Processing},
We consider the problem of in-network compressed sensing from distributed measurements. Every agent has a set of measurements of a signal x, and the objective is for the agents to recover x from their collective measurements using only communication with neighbors in the network. Our distributed approach to this problem is based on the centralized Iterative Hard Thresholding algorithm (IHT). We first present a distributed IHT algorithm for static networks that leverages standard tools from… 

Tables from this paper

Distributed compressed sensing in dynamic networks
This work shows how centralized IHT can be extended to include inexact computations while still providing the same recovery guarantees, and then leverages these new theoretical results to develop a distributed version of IHT for dynamic networks.
Low-power distributed sparse recovery testbed on wireless sensor networks
This paper describes a successful implementation of a class of randomized, distributed algorithms on a real low-power wireless sensor network test bed with very scarce computational capabilities and considers a distributed compressed sensing problem and shows how to cope with the issues.
Distributed sparse signal recovery in networked systems
It is proved that state evolution (SE), a fundamental property of AMP that in high dimensionality limit, the output data are asymptotically Gaussian regardless of the distribution of input data, also holds for DiAMP, and the universality of SE can be extended to far more general sensing matrices.
Design and Analysis of a Greedy Pursuit for Distributed Compressed Sensing
This paper develops a distributed parallel pursuit (dipp) algorithm based on exchange of information about estimated support-sets at sensors, which converges to a performance level that depends on a scaled additive measurement noise power (convergence in theory) where the scaling coefficient is a function of RIP parameters and information processing quality parameters.
Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks
It is shown that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings, and the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.
Energy-saving gossip algorithm for compressed sensing in multi-agent systems
  • C. Ravazzi, S. Fosson, E. Magli
  • Computer Science
    2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
  • 2014
An iterative distributed algorithm to address innetwork compressed sensing from measurements acquired in multi-agent systems, featuring pairwise gossip communications and updates is proposed.
Distributed approximate message passing for sparse signal recovery
An efficient distributed approximate message passing (AMP) algorithm, named distributed AMP (DAMP), is developed for compressed sensing (CS) signal recovery in sensor networks with the sparsity K unknown, and demonstrates that the GCAMP based DAMP outperforms the Modified TA based Damp, and reduces the communication cost significantly.
Locally Convex Sparse Learning over Networks
A distributed learning setup where a sparse signal is estimated over a network uses a convex optimization based algorithm that provides a locally optimum solution for that node, and restricted-isometry-property (RIP)-based theoretical analysis on estimation quality is provided.
Decentralized adaptive search using the noisy 20 questions framework in time-varying networks


Distributed sparse signal recovery for sensor networks
A distributed algorithm for sparse signal recovery in sensor networks based on Iterative Hard Thresholding (IHT) is proposed, which can dramatically reduce this communication cost by leveraging solutions to the distributed top-K problem in the database literature.
D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
D-ADMM is proven to converge when the network is bipartite or when all the functions are strongly convex, although in practice, convergence is observed even when these conditions are not met.
Distributed soft thresholding for sparse signal recovery
A new class of distributed algorithms to solve Lasso regression problems, when the communication to a fusion center is not possible, e.g., due to communication cost or privacy reasons, are proposed.
Distributed Basis Pursuit
The algorithm, named D-ADMM, is a decentralized implementation of the alternating direction method of multi- pliers, and it is shown through numerical simulation that the algorithm requires considerably less communications between the nodes than the state-of-the-art algorithms.
Distributed Spectrum Sensing for Cognitive Radio Networks by Exploiting Sparsity
A cooperative approach to the sensing task of wireless cognitive radio (CR) networks is introduced based on a basis expansion model of the power spectral density map in space and frequency that reduces spatial and frequency spectrum leakage by 15 dB relative to least-squares alternatives.
Sparse event detection in wireless sensor networks using compressive sensing
This paper forms the problem for sparse event detection in wireless sensor networks as a compressive sensing problem, and proposes a Bayesian detection algorithm that has much better performance than the l1-magic algorithm proposed in the literature.
Cooperative Sensing and Compression in Vehicular Sensor Networks for Urban Monitoring
The results show that the cooperative data sensing and compression approach is superior to the conventional sampling and interpolation strategy which propagates data in an uncompressed form, with 4-5dB gain in reconstruction quality and 21-55% savings in communication cost for the same sampling times.
Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication
This work solves the problem for generic connected network topologies with asymmetric random link failures with a novel distributed, de-centralized algorithm, and proposes a novel, Gauss-Seidel type, randomized algorithm, at a fast time scale.
Distributed algorithms for basis pursuit
Methods for solving the Basis Pursuit problem in a distributed environment, i.e., when the computational resources and the matrix A are distributed over several interconnected nodes, are explored.
Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
  • T. Blumensath
  • Computer Science
    IEEE Transactions on Information Theory
  • 2013
It is shown that, under conditions similar to those required in the linear setting, the iterative hard thresholding algorithm can be used to accurately recover sparse or structured signals from few nonlinear observations.