Improving Approximate Message Passing Recovery of Sparse Binary Vectors by Post Processing

Compressed sensing allows to recover a sparse highdimensional signal vector from fewer measurements than its dimension would suggest. Approximate Message Passing (AMP) was introduced by Donoho et al. to perform iterative recovery with low complexity. We investigate the behavior of AMP for a low number of measurements and low signal-to-noise ratio. In these cases, recovered signals exhibit many false alarms and strong amplitude deviations from the original. We propose post processing schemes that try to retain the correct detections while voiding false alarms. The best performance is obtained by Maximum Likelihood (ML) detection that is performed on a well selected subset of the recovered signal vector’s support. In order to maintain feasibility, ML detection is implemented by a sphere decoder and the sparse signal vector is assumed to be binary, i.e., its few nonzero elements have value one. We show by simulation that post processing enables accurate estimation of the true signal vector and its support, despite strong noise or an insufficient number of measurements.

[1]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[2]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[3]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[4]  Richard G. Baraniuk,et al.  VLSI Design of Approximate Message Passing for Signal Restoration and Compressive Sensing , 2012, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[5]  A. Burg,et al.  Soft-Output Sphere Decoding: Performance and Implementation Aspects , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[6]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[7]  Markus Rupp,et al.  Soft-output sphere decoding: Single tree search vs. improved k-best , 2011, 2011 18th International Conference on Systems, Signals and Image Processing.

[8]  E.J. Candes Compressive Sampling , 2022 .

[9]  Helmut Bölcskei,et al.  Soft-output sphere decoding: algorithms and VLSI implementation , 2008, IEEE Journal on Selected Areas in Communications.

[10]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[11]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[12]  Andrea Montanari,et al.  Message passing algorithms for compressed sensing: I. motivation and construction , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[13]  Martin Mayer,et al.  RFID tag acquisition via compressed sensing , 2014, 2014 IEEE RFID Technology and Applications Conference (RFID-TA).

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

[15]  Zhan Guo,et al.  Algorithm and implementation of the K-best sphere decoding for MIMO detection , 2006, IEEE Journal on Selected Areas in Communications.

[16]  Andrea Montanari,et al.  Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.

[17]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[18]  David L. Donoho,et al.  De-noising by soft-thresholding , 1995, IEEE Trans. Inf. Theory.