Non-convex approach to binary compressed sensing

From MaRDI portal
Publication:6308656

arXiv1810.09872MaRDI QIDQ6308656FDOQ6308656


Authors: Sophie M. Fosson Edit this on Wikidata


Publication date: 23 October 2018

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.













This page was built for publication: Non-convex approach to binary compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6308656)