richard baraniuk rice university dsp.rice.edu/cs compressive signal processing

15
Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

Post on 19-Dec-2015

221 views

Category:

Documents


1 download

TRANSCRIPT

Page 1: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

Richard Baraniuk

Rice Universitydsp.rice.edu/cs

Compressive

Signal Processing

Page 2: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

Compressive Sensing (CS)

• When data is sparse/compressible, can directly acquire a condensed representation with no/little information loss

• Random projection will work

measurementssparsesignal

sparsein some

basis

[Candes-Romberg-Tao, Donoho, 2004]

Page 3: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

• Reconstruction/decoding: given(ill-posed inverse problem) find

CS Signal Recovery

measurementssparsesignal

nonzeroentries

Page 4: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

• Reconstruction/decoding: given(ill-posed inverse problem) find

• L2 fast

CS Signal Recovery

Page 5: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

• Reconstruction/decoding: given(ill-posed inverse problem) find

• L2 fast, wrong

CS Signal Recovery

Page 6: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

Why L2 Doesn’t Work

least squares,minimum L2 solutionis almost never sparse null space of

translated to

(random angle)

Page 7: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

• Reconstruction/decoding: given(ill-posed inverse problem) find

• L2 fast, wrong

• L0

CS Signal Recovery

number ofnonzeroentries:

ie: find sparsestpotential solution

Page 8: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

• Reconstruction/decoding: given(ill-posed inverse problem) find

• L2 fast, wrong

• L0 correct, slowonly M=K+1 measurements required to perfectly reconstruct K-sparse signal[Bresler; Rice]

CS Signal Recovery

Page 9: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

• Reconstruction/decoding: given(ill-posed inverse problem) find

• L2 fast, wrong

• L0 correct, slow

• L1 correct, mild oversampling [Candes et al, Donoho]

CS Signal Recovery

linear program

Page 10: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

Why L1 Works

minimum L1 solution= sparsest solution (with high probability) if

Page 11: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

• Gaussian white noise basis is incoherent with any fixed orthonormal basis (with high probability)

• Signal sparse in time domain:

Universality

Page 12: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

• Gaussian white noise basis is incoherent with any fixed orthonormal basis (with high probability)

• Signal sparse in frequency domain:

• Product remains white Gaussian

Universality

Page 13: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

Ex: Sub-Nyquist Sampling• Nyquist rate samples of wideband signal (sum of 20 wavelets)

N = 1024 samples/second

• Reconstruction from compressive measurementsM = 150 random measurements/second (6.8x sub-Nyquist)

MSE < 2% of signal energy

Page 14: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

Ex: Sub-Nyquist Sampling• Nyquist rate samples of image (N = 65536 pixels)

• Reconstruction from M = 20000 compressive measurements (3.2x sub-Nyquist)

MSE < 3% of signal energy

Page 15: Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing

Ex: Sub-Nyquist Sampling

• Nyquist rate samples of image (N = 65536 pixels)

• Reconstruction from measurements from a compressive camera

M = 11000 M = 1300 measurements measurements