Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices

• Published in: Journal of statistical mechanics Vol. 2012; no. 8; pp. P08009 - 57
• Main Authors: Krzakala, Florent, Mézard, Marc, Sausset, Francois, Sun, Yifan, Zdeborová, Lenka
• Format: Journal Article
• Language: English
• Published: IOP Publishing and SISSA 17.08.2012; IOP Publishing
• Subjects: Algorithms; Asymptotic properties; Computer Science; Condensed Matter; Detection; Information Theory; Mathematics; Optimization; Phase diagrams; Physics; Probabilistic methods; Probability theory; Reconstruction; Statistical Mechanics
• ISSN: 1742-5468; 1742-5468
• DOI: 10.1088/1742-5468/2012/08/P08009

Compressed sensing is a signal processing method that acquires data directly in a compressed form. This allows one to make fewer measurements than were considered necessary to record a signal, enabling faster or more precise measurement protocols in a wide range of applications. Using an interdisciplinary approach, we have recently proposed in Krzakala et al (2012 Phys. Rev. X 2 021005) a strategy that allows compressed sensing to be performed at acquisition rates approaching the theoretical optimal limits. In this paper, we give a more thorough presentation of our approach, and introduce many new results. We present the probabilistic approach to reconstruction and discuss its optimality and robustness. We detail the derivation of the message passing algorithm for reconstruction and expectation maximization learning of signal-model parameters. We further develop the asymptotic analysis of the corresponding phase diagrams with and without measurement noise, for different distributions of signals, and discuss the best possible reconstruction performances regardless of the algorithm. We also present new efficient seeding matrices, test them on synthetic data and analyze their performance asymptotically.