Code and Data supplement to "Deterministic Matrices Matching the Compressed Sensing Phase Transitions of Gaussian Random Matrices."
Abstract/Contents
- Abstract
The data and code provided here are supplementary information for the paper “Deterministic Matrices Matching the Compressed Sensing Phase Transitions for Gaussian Random Matrices” by H. Monajemi, S. Jafarpour,
Stat330/CME362 Collaboration, and D. L. Donoho. The description of the data is provided in the companion README.TXT file. The data is the outcome of research that started as a course project at Stanford University by participants of Stat330/CME362 class taught by Donoho in Fall 2011 (Course TA: Matan Gavish). Data collection was a joint effort of 40 researchers listed in the original paper.\n\n
In compressed sensing, one takes $n < N$ samples of an $N$-dimensional vector $x_0$ using an $n\times N$ matrix $A$, obtaining undersampled measurements $y = Ax_0$. For random matrices with Gaussian i.i.d entries, it is known that, when $x_0$ is $k$-sparse, there is a precisely determined {\it phase transition}: for a certain region in the ($k/n$,$\ n/N$)-phase diagram, convex optimization $\text{min } ||x||_1 \text{ subject to } y=Ax, \ x \in X^N$ typically finds the sparsest solution, while outside that region, it typically fails. It has been shown empirically that the same property -- with the same phase transition location -- holds for a wide range of non-Gaussian \textit{random} matrix ensembles.\n\n
We consider specific deterministic matrices including Spikes and Sines, Spikes and Noiselets, Paley Frames, Delsarte-Goethals Frames, Chirp Sensing Matrices, and Grassmannian Frames. Extensive experiments show that for a typical $k$-sparse object, convex optimization is successful over a region of the phase diagram that coincides with the region known for Gaussian matrices. In our experiments, we considered coefficients constrained to $X^N$ for four different sets $X \in \{[0,1], R_+, R, C\}$. We establish this finding for each of the associated four phase transitions.
Description
Type of resource | software, multimedia |
---|---|
Date created | 2012 |
Creators/Contributors
Author | Donoho, David | |
---|---|---|
Author | Monajemi, Hatef | |
Author | Jafarpour, Sina | |
Author | Gavish, Matan | |
Author | Stat330/CME362 Collaboration |
Subjects
Subject | Compressed Sensing |
---|---|
Subject | Sparse Recovery |
Subject | Grassmannian Frames |
Subject | Paley Frames |
Subject | Delsarte-Goethals Frames |
Subject | Noiselets |
Subject | Phase Transition |
Genre | Dataset |
Bibliographic information
Related Publication | Hatef Monajemi, Sina Jafarpour, Matan Gavish, Stat 330/CME 362 Collaboration, and David L. Donoho. Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices. PNAS 2012 ; published ahead of print December 31, 2012, doi:10.1073/pnas.1219540110. Available at http://www.pnas.org/content/early/2012/12/28/1219540110. |
---|---|
Related item | |
Location | https://purl.stanford.edu/wp335yr5649 |
Access conditions
- Use and reproduction
- User agrees that, where applicable, content will not be used to identify or to otherwise infringe the privacy or confidentiality rights of individuals. Content distributed via the Stanford Digital Repository may be subject to additional license and use restrictions applied by the depositor.
- License
- This work is licensed under an Open Data Commons Public Domain Dedication & License 1.0.
Preferred citation
- Preferred Citation
Monajemi H, Jafarpour S, Gavish M, {Stat 330/CME 362} Collaboration, Donoho DL (2012) Data for the article Deterministic Matrices Matching the Compressed Sensing
Phase Transitions of Gaussian Random Matrices. Available at http://purl.stanford.edu/wp335yr5649.
Collection
Stanford Research Data
View other items in this collection in SearchWorksContact information
- Contact
- donoho@stanford.edu
Also listed in
Loading usage metrics...