Abstract

The Shannon/Nyquist sampling theorem tells us that in order to not lose information when uniformly sampling a signal we must sample at least two times faster than its bandwidth. In many applications, including digital image and video cameras, the Nyquist rate can be so high that we end up with too many samples and must compress in order to store or transmit them. In other applications, including imaging systems (medical scanners, radars) and high-speed analog-to-digital converters, increasing the sampling rate or density beyond the current state-of-the-art is very expensive. In this lecture, we will learn about a new technique that tackles these issues using compressive sensing [1, 2]. We will replace the conventional sampling and reconstruction operations with a more general linear measurement scheme coupled with an optimization in order to acquire certain kinds of signals at a rate significantly below Nyquist. 2

Citations

1468	A Wavelet Tour of Signal Processing - Mallat - 1998
1089	Atomic decomposition by basis pursuit - Chen, Donoho, et al. - 1998
1064	Embedded image coding using zerotrees of wavelet coefficients - Shapiro - 1993
917	Compressed sensing - Donoho - 2006
714	Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information - Candes, Romberg, et al. - 2006
488	Near optimal signal recovery from random projections: Universal encoding strategies - Candès, Tao - 2006
359	Decoding by linear programming - Candes, Tao
307	An introduction to compressive sampling - Candès, Wakin
261	Wavelet-based statistical signal processing using hidden Markov models - Crouse, Nowak, et al. - 1998
239	P.: Image denoising using scale mixtures of gaussians in the wavelet domain - PORTILLA, STRELA, et al.
236	An iterative thresholding algorithm for linear inverse problems with a sparsity constraint - Daubechies, Defrise, et al. - 2004
231	The concentration of measure phenomenon - Ledoux - 2001
228	The Dantzig selector: statistical estimation when p is much larger than n - Candès, Tao - 2007
183	CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Applied and Computational Harmonic Analysis - Needell, JA
162	The restricted isometry property and its implications for compressed sensing,” Comptes Rendus de l’Academie des Sciences - Candès - 2008
149	Majorization-minimization algorithms for wavelet based image restoration - Figueiredo, Bioucas-Dias, et al. - 2007
130	Sampling signals with finite rate of innovation - Vetterli, Marziliano, et al. - 2002
124	Signal recovery from partial information via orthogonal matching pursuit - Tropp, Gilbert
116	Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit - Donoho, Tsaig, et al.
110	Algorithms for simultaneous sparse approximation. part I: Greedy pursuit - Tropp, Gilbert, et al.
104	Signal reconstruction from noisy random projections - Haupt, Nowak
103	Bayesian Tree-Structured Image Modeling Using Wavelet-Domain Hidden Markov Models - Romberg, Choi, et al. - 2001
75	Iterative Hard Thresholding for Compressed Sensing - Blumensath, Davies
56	CART and best-ortho-basis: A connection - Donoho - 1997
48	An introduction to compressive sensing - CANDES, WAKIN
48	Subspace pursuit for compressed sensing: Closing the gap between performance and complexity - Dai, Milenkovic - 2009
41	A signal-dependent time-frequency representation: Optimal kernel design - Baraniuk, Jones - 1993
38	Mishali M. Robust Recovery of Signals From a Structured Union of Subspaces - Eldar
35	Fast reconstruction of piecewise smooth signals from random projections - Duarte, Wakin, et al. - 2005
35	Uniform uncertainty principle for Bernoulli and sub-Gaussian ensembles - Mendelson, Pajor, et al. - 2008
32	Tree approximation and optimal encoding - Cohen, Dahmen, et al. - 1999
27	On the reconstruction of block-sparse signals with an optimal number of measurements - Stojnic, Parvaresh, et al.
26	Robust recovery of signals from a union of subspaces,” arXiv.org 0807.4581; submitted to - Eldar, Mishali - 2008
25	The johnson-lindenstrauss lemma meets compressed sensing,” http://www.dsp.rice.edu/cs/jlcs-v03.pdf - Baraniuk, Davenport, et al. - 2006
25	Analog-to-Information Conversion via Random Demodulation - Kirolos, Laska, et al. - 2006
22	Sampling Theorems for Signals from the Union of Finite-Dimensional Linear Subspaces - Blumensath, ME
19	Exploiting structure in wavelet-based Bayesian compressive sensing - He, Carin - 2009
15	On random binary trees - Brown, Shubert - 1984
14	Recovery of jointly sparse signals from a few random projections - Wakin, Duarte, et al. - 2006
13	Sparse signal recovery using markov random fields - Cevher, Duarte, et al. - 2008
13	Sampling signals from a union of subspaces - Lu, Do - 2008
12	Sampling theorems for signals from the union of linear subspaces,” accepted to - Blumensath, Davies - 2008
11	R.G.: A compressed sensing camera: New theory and an implementation using digital micromirrors - Takhar, Bansal, et al. - 2006
10	Wavelet-domain compressive signal reconstruction using a hidden Markov tree model - Duarte, Wakin, et al. - 2008
9	Compressive sensing recovery of spike trains using a structured sparsity model. SPARS - Hegde, Duarte, et al. - 2009
7	Optimal tree approximation with wavelets - Baraniuk - 1999
7	Recovery of clustered sparse signals from compressive measurements - Cevher, Indyk, et al. - 2009
6	Tree-based orthogonal matching pursuit algorithm for signal reconstruction - La, Do - 2006
5	and best-ortho-basis : A connection. The Annals of Statistics 25 - Donoho - 1997
3	Near best tree approximation - Baraniuk, DeVore, et al.