Non-convex approach to binary compressed sensing

Abstract

We propose a new approach to the recovery of binary signals in compressed sensing, based on the local minimization of a non-convex cost functional. The desired signal is proved to be a local minimum of the functional under mild conditions on the sensing matrix and on the number of measurements. We develop a procedure to achieve the desired local minimum, and, finally, we propose numerical experiments that show the improvement obtained by the proposed approach with respect to the classical convex approach, i.e., Lasso.