One-bit compressive sensing and source localization in wireless sensor networks

This paper considers the problem of reconstructing sparse or compressible signals from one-bit quantized measurements. We study a new method that uses a log-sum penalty function, also referred to as the Gaussian entropy, for sparse signal recovery. Additionally, in the proposed method, the sigmoid function is introduced to quantify the consistency between the measured one-bit quantized data and the reconstructed signal. A fast iterative algorithm is developed by iteratively minimizing a convex surrogate function that bounds the original objective function. This leads to an iterative reweighted process that alternates between estimating the sparse signal and refining the weights of the surrogate function. The application of one-bit compressed sensing to source localization in wireless sensor networks is also discussed. Simulations are provided to illustrate the effectiveness of our proposed algorithm.

[1]  Martin J. Wainwright,et al.  Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting , 2007, IEEE Transactions on Information Theory.

[2]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[3]  D. Hunter,et al.  Optimization Transfer Using Surrogate Objective Functions , 2000 .

[4]  Yaniv Plan,et al.  One‐Bit Compressed Sensing by Linear Programming , 2011, ArXiv.

[5]  Ming Yan,et al.  Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit , 2012, IEEE Transactions on Signal Processing.

[6]  Zhu Han,et al.  Sparse event detection in wireless sensor networks using compressive sensing , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[7]  Shahrokh Valaee,et al.  Multiple Target Localization Using Compressive Sensing , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[8]  Wotao Yin,et al.  Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements , 2011, IEEE Transactions on Signal Processing.

[9]  Yingshu Li,et al.  Sparse target counting and localization in sensor networks based on compressive sensing , 2011, 2011 Proceedings IEEE INFOCOM.

[10]  Richard G. Baraniuk,et al.  1-Bit compressive sensing , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[11]  Laurent Jacques,et al.  Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors , 2011, IEEE Transactions on Information Theory.

[12]  Bhaskar D. Rao,et al.  Sparse Bayesian learning for basis selection , 2004, IEEE Transactions on Signal Processing.

[13]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[14]  Pramod K. Varshney,et al.  Performance Bounds for Sparsity Pattern Recovery With Quantized Noisy Random Projections , 2012, IEEE Journal of Selected Topics in Signal Processing.

[15]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[16]  P. Boufounos.  Greedy sparse signal reconstruction from sign measurements , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[17]  R. Coifman,et al.  Entropy-based Algorithms for Best Basis Selection from Which We Can Estimate a L+1 2 2 L . Thus a Signal of N = 2 L Points Can Be Expanded in 2 N Diierent , 1992 .

[18]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.

[19]  Richard G. Baraniuk,et al.  Regime Change: Bit-Depth Versus Measurement-Rate in Compressive Sensing , 2011, IEEE Transactions on Signal Processing.