Compressed Sensing of Approximately-Sparse Signals: Phase Transitions and Optimal Reconstruction

Abstract : Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large) components the other components are not strictly equal to zero, but are only close to zero. In this paper we model the approximately sparse signal with a Gaussian distribution of small components, and we study its compressed sensing with dense random matrices. We use replica calculations to determine the mean-squared error of the Bayes-optimal reconstruction for such signals, as a function of the variance of the small components, the density of large components and the measurement rate. We then use the G-AMP algorithm and we quantify the region of parameters for which this algorithm achieves optimality (for large systems). Finally, we show that in the region where the GAMP for the homogeneous measurement matrices is not optimal, a special "seeding" design of a spatially-coupled measurement matrix allows to restore optimality.
Liste complète des métadonnées
Contributor : Claudine Le Vaou <>
Submitted on : Tuesday, October 15, 2013 - 1:17:10 PM
Last modification on : Friday, March 29, 2019 - 11:28:10 AM

Links full text


  • HAL Id : hal-00873240, version 1
  • ARXIV : 1207.2079



Jean Barbier, Florent Krzakala, Marc Mézard, Lenka Zdeborová. Compressed Sensing of Approximately-Sparse Signals: Phase Transitions and Optimal Reconstruction. 50th annual Allerton conference on communication, control, and computing, Oct 2012, United States. pp.800-807. ⟨hal-00873240⟩



Record views