Documente Academic
Documente Profesional
Documente Cultură
Compressible/k-sparse signals
Stable measurements
Restricted isometric property
Signal reconstruction algorithms
Geometric interpretation
Constrained/Unconstrained optimization
Fast algorithms
4
10
2
10
0
10
-2
10
0 1 2 3 4 5 6
4
x 10
Shortcommings:
Measurement matrix
Goal of CS
The measurement processes must not erase the information present in the k
non-zero entries of signal
random Gaussian
random binary
k-sparse vectors
Equivalent
Algorithms
l1_ls [Kim et al, 2007]
GPRS [Figueiredo et al, 2007]
TwIST [Bioucas-Dias & Figueiredo , 2007]
is i.i.d. Gaussian
20
40
60
80
100
120
100 200 300 400 500 600 700 800 900 1000
0.8
0.6 0.1
0.4
0.2 0.05
-0.2 0
-0.4
-0.6 -0.05
-0.8
-1 -0.1
0 200 400 600 800 1000 1200 0 20 40 60 80 100 120 140
Pseudo-inverse regularization
1 1
f f
0.8 0.8
fpseudo-inv f
0.6 0.6
0.4 0.4
0.2 0.2
0 0
-0.2 -0.2
-0.4 -0.4
-0.6 -0.6
-0.8 -0.8
-1 -1
0 200 400 600 800 1000 1200 0 200 400 600 800 1000 1200
D. Donoho, Compressed sensing, IEEE Trans. Inform. Theory, vol. 52, no.
4, pp. 1289 1306, April 2006.