One-bit compressive sampling via ℓ0 minimization

The problem of 1-bit compressive sampling is addressed in this paper. We introduce an optimization model for reconstruction of sparse signals from 1-bit measurements. The model targets a solution that has the least ℓ0-norm among all signals satisfying consistency constraints stemming from the 1-bit measurements. An algorithm for solving the model is developed. Convergence analysis of the algorithm is presented. Our approach is to obtain a sequence of optimization problems by successively approximating the ℓ0-norm and to solve resulting problems by exploiting the proximity operator. We examine the performance of our proposed algorithm and compare it with the renormalized fixed point iteration (RFPI) (Boufounos and Baraniuk, 1-bit compressive sensing, 2008; Movahed et al., A robust RFPI-based 1-bit compressive sensing reconstruction algorithm, 2012), the generalized approximate message passing (GAMP) (Kamilov et al., IEEE Signal Process. Lett. 19(10):607–610, 2012), the linear programming (LP) (Plan and Vershynin, Commun. Pure Appl. Math. 66:1275–1297, 2013), and the binary iterative hard thresholding (BIHT) (Jacques et al., IEEE Trans. Inf. Theory 59:2082–2102, 2013) state-of-the-art algorithms for 1-bit compressive sampling reconstruction.

[1]  Stanley Osher,et al.  A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration , 2010, J. Sci. Comput..

[2]  Duan Li,et al.  Reweighted 1-Minimization for Sparse Solutions to Underdetermined Linear Systems , 2012, SIAM J. Optim..

[3]  Rick Chartrand,et al.  Exact Reconstruction of Sparse Signals via Nonconvex Minimization , 2007, IEEE Signal Processing Letters.

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

[5]  R. Chartrand,et al.  Restricted isometry properties and nonconvex compressive sensing , 2007 .

[6]  J. Moreau.  Fonctions convexes duales et points proximaux dans un espace hilbertien , 1962 .

[7]  Yin Zhang,et al.  Fixed-Point Continuation for l1-Minimization: Methodology and Convergence , 2008, SIAM J. Optim..

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

[9]  Christian Jutten,et al.  A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm , 2008, IEEE Transactions on Signal Processing.

[10]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[11]  S. Szarek,et al.  Chapter 8 - Local Operator Theory, Random Matrices and Banach Spaces , 2001 .

[12]  J. Moreau.  Proximité et dualité dans un espace hilbertien , 1965 .

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

[14]  Giuseppe Durisi,et al.  A robust RFPI-based 1-bit compressive sensing reconstruction algorithm , 2012, 2012 IEEE Information Theory Workshop.

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

[16]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[17]  Rayan Saab,et al.  Sparse Recovery by Non-convex Optimization -- Instance Optimality , 2008, ArXiv.

[18]  Stephen P. Boyd,et al.  Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices , 2003, Proceedings of the 2003 American Control Conference, 2003..

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

[20]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[21]  Mike E. Davies,et al.  Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.

[22]  Lixin Shen,et al.  A proximity algorithm accelerated by Gauss–Seidel iterations for L1/TV denoising models , 2012 .

[23]  Michael Unser,et al.  One-Bit Measurements With Adaptive Thresholds , 2012, IEEE Signal Processing Letters.

[24]  Yuantao Gu,et al.  The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery , 2012, IEEE Transactions on Signal Processing.

[25]  Lixin Shen,et al.  Bounds for Eigenvalues of Arrowhead Matrices and Their Applications to Hub Matrices and Wireless Communications , 2009, EURASIP J. Adv. Signal Process..

[26]  O. Mangasarian.  Minimum-support solutions of polyhedral concave programs * , 1999 .

[27]  Kaushik Mahata,et al.  An Improved Smoothed $\ell^0$ Approximation Algorithm for Sparse Representation , 2010, IEEE Transactions on Signal Processing.

[28]  Mike E. Davies,et al.  IEEE International Conference on Acoustics Speech and Signal Processing , 2008 .

[29]  Informationstechnik Berlin,et al.  Exact and Approximate Sparse Solutions of Underdetermined Linear Equations , 2007 .

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