## Precise Undersampling Theorems

Citations: | 18 - 2 self |

### BibTeX

@MISC{Donoho_preciseundersampling,

author = {David L. Donoho and Jared Tanner},

title = { Precise Undersampling Theorems},

year = {}

}

### OpenURL

### Abstract

Undersampling Theorems state that we may gather far fewer samples than the usual sampling theorem while exactly reconstructing the object of interest – provided the object in question obeys a sparsity condition, the samples measure appropriate linear combinations of signal values, and we reconstruct with a particular nonlinear procedure. While there are many ways to crudely demonstrate such undersampling phenomena, we know of only one approach which precisely quantifies the true sparsity-undersampling tradeoff curve of standard algorithms and standard compressed sensing matrices. That approach, based on combinatorial geometry, predicts the exact location in sparsity-undersampling domain where standard algorithms exhibit phase transitions in performance. We review the phase transition approach here and describe the broad range of cases where it applies. We also mention exceptions and state challenge problems for future research. Sample result: one can efficiently reconstruct a k-sparse signal of length N from n measurements, provided n � 2k · log(N/n), for (k, n, N) large, k ≪ N.