Image Reconstruction by CS
Image Reconstruction by CS
Applications
Conclusions
CALIM09 31/03/09
Anna Scaife
Outline
Applications
Conclusions
Anna Scaife
Deconvolution
CLEAN
Local iterative deconvolution
Matching Pursuit
Implicitly implies sparsity
MEM
Global minimization problem
Assumes an entropic prior
Both methods are flexible enough to consider a variety of bases
(Dirac, wavelet etc)
Anna Scaife
Sparsity
Anna Scaife
Anna Scaife
Restricted Isometry
P
Q
p
l=1 |ul |
1/p
Anna Scaife
Cm
.
2 ln4 N
Anna Scaife
Basis Pursuit
the `1 norm of the vector is simply the sum of the
absolute values of the vector
PT components:
||||1 = =1 | |.
Laplacian Prior
Recovery
If the solution of the BP is then the corresponding recovered
signal is
x = .
Solutions
CS shows
that if satisfies a RIP of order 2K with
2K < 2 1 then the solution x provides an accurate
reconstruction.
It can be said to be optimal in the sense that exactly sparse
signals in the absense of noise are recovered exactly.
In the presence of noise very strong stability results are
obtained.
Anna Scaife
Interferometer Data
SNR(s,s ) = 20 log10
(ss
(s)
Anna Scaife
0)
Cosmic Strings
Topological defects in the CMB.
CDM cosmology.
String signal is well modelled by GGDs in wavelet space
GGDs
h i
v
j
j ( ) exp u
j
s-norm
() exp
s
P ||||
vj
|
||||s | u
j
Anna Scaife
BP
min ||0 ||1 s.t. ||y 0 ||2
BP+
ri x 0 and x 0 0.
min ||x 0 ||1 s.t. y =
SBP
min ||0 ||s s.t. ||y Wcmb ri s 0 ||2
Anna Scaife
Compact Sources
Anna Scaife
Cosmic Strings
Anna Scaife
SNR
Anna Scaife
Conclusions
Anna Scaife