pith. sign in

arxiv: 1601.00350 · v1 · pith:MPMRU2SNnew · submitted 2016-01-03 · 📊 stat.ML · cs.IT· cs.LG· math.IT

Sparse Diffusion Steepest-Descent for One Bit Compressed Sensing in Wireless Sensor Networks

classification 📊 stat.ML cs.ITcs.LGmath.IT
keywords compresseddiffusionsensingsparsesteepest-descentalgorithmdistributeddistributive
0
0 comments X
read the original abstract

This letter proposes a sparse diffusion steepest-descent algorithm for one bit compressed sensing in wireless sensor networks. The approach exploits the diffusion strategy from distributed learning in the one bit compressed sensing framework. To estimate a common sparse vector cooperatively from only the sign of measurements, steepest-descent is used to minimize the suitable global and local convex cost functions. A diffusion strategy is suggested for distributive learning of the sparse vector. Simulation results show the effectiveness of the proposed distributed algorithm compared to the state-of-the-art non distributive algorithms in the one bit compressed sensing framework.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.