Compressive Sensing Algorithms for Fast and Accurate Imaging

Transcription

1 Compressive Sensing Algorithms for Fast and Accurate Imaging Wotao Yin Department of Computational and Applied Mathematics, Rice University SCIMM 10 ASU, Tempe, AZ

2 Acknowledgements: results come in part from joint work with 1. Wolfgang Stefan, Yilun Wang, Yin Zhang (Rice) 2. Junfeng Yang (Nanjing, China) 3. Weihong Guo (Case Western) Work supported by the NSF, ONR, and Sloan Foundation

3 Compressive Sensing Pioneered by Candes-Romberg-Tao 05, Donoho 05 Goal: acquires a signal fast and robustly CS requires: 1. Signal has a sparse structure u = Ψx, x is sparse/compressible jointly sparse (for multiple signals) 2. Encoding: linear, incoherent with Ψ, physically implementable 3. Decoding: take advantages of sparsity, fast, robust to noise

4 Decoding Algorithmic Challenges: 1. Large, dense data (sensing matrices and measurements) 2. Standard methods (simplex, interior-point) not suitable 3. Some applications have the real-time need Opportunities: 1. Fast way of computing Ax and A x 2. Structured random matrices help 3. Solution structure helps

5 Model u: the signal A is the sensing matrix, f contains the measurements For this talk, we consider the model: min αtv v (u) + β Ψu w, Au f 2 M and its extensions TV v (u) = pixels v i (Du) i an extension of total variation, Rudin-Osher-Fatemi 92 capture sharp edges useful in image reconstruction

6 Model u: the signal A is the sensing matrix, f contains the measurements For this talk, we consider the model: min αtv v (u) + β Ψu w, Au f 2 M and its extensions TV v (u) = pixels v i (Du) i an extension of total variation, Rudin-Osher-Fatemi 92 capture sharp edges useful in image reconstruction A fast splitting algorithm, various applications integration with support/edge detection, Bregman reg. GPU implementation

7 Variable Splitting Consider min f (Lx) + g(x). L: linear operator Introduce y = Lx, obtain min{f (y) + g(x) : Lx y = 0}

8 Variable Splitting Consider min f (Lx) + g(x). L: linear operator Introduce y = Lx, obtain min{f (y) + g(x) : Lx y = 0} Apply augmented Lagrangian, obtain L(x, y; λ) = f (y) + λ, Lx y + c 2 Lx y g(x)

9 Variable Splitting Consider min f (Lx) + g(x). L: linear operator Introduce y = Lx, obtain min{f (y) + g(x) : Lx y = 0} Apply augmented Lagrangian, obtain L(x, y; λ) = f (y) + λ, Lx y + c 2 Lx y g(x) 1. (x k+1, y k+1 ) min x,y L(x, y) 2. Update λ, e.g., λ k+1 λ k + c(lx k+1 y k+1 )

10 Variable Splitting Consider min f (Lx) + g(x). L: linear operator Introduce y = Lx, obtain min{f (y) + g(x) : Lx y = 0} Apply augmented Lagrangian, obtain L(x, y; λ) = f (y) + λ, Lx y + c 2 Lx y g(x) 1. (x k+1, y k+1 ) min x,y L(x, y) 2. Update λ, e.g., λ k+1 λ k + c(lx k+1 y k+1 ) Instead, alternating direction method (ADM) does 1. x k+1 min x L(x k, y k ) 2. y k+1 min y L(x k+1, y k ) 3. λ k+1 λ k + γc(lx k+1 y k+1 ) ADM goes back to Douglas-Rachford in 50s and various methods for PDEs and monotone operator equations.

11 Split the Right Way! Let us simplify. Keep TV and ignore Ψu w,1. Consider min αtv (u) Au f 2 2.

12 Split the Right Way! Let us simplify. Keep TV and ignore Ψu w,1. Consider min αtv (u) Au f 2 2. Alternate x/y-directions? Doesn t make it simpler. Not right.

13 Split the Right Way! Let us simplify. Keep TV and ignore Ψu w,1. Consider min αtv (u) Au f 2 2. Alternate x/y-directions? Doesn t make it simpler. Not right. Alternate TV (u) and 1 2 Au f 2 2? One subproblem is ROF: min TV (u) + c u v 2 2 The other is least-squares Not bad, but solving multiple ROFs is not fast.

14 Split the Right Way Let us simplify. Keep TV and ignore Ψu w,1. Consider min αtv (u) Au f 2 2. TV ( ) i ( ) i and (D ). Split them.

15 Split the Right Way Let us simplify. Keep TV and ignore Ψu w,1. Consider min αtv (u) Au f 2 2. TV ( ) i ( ) i and (D ). Split them. Keep (D ) with 1 2 A f 2 2.

16 Split the Right Way Let us simplify. Keep TV and ignore Ψu w,1. Consider min αtv (u) Au f 2 2. TV ( ) i ( ) i and (D ). Split them. Keep (D ) with 1 2 A f 2 2. One subproblem is shrinkage. The other is least-squares, having closed-form sol s for many A. The right way for denoise, deblurring, color, some CS probs, etc. FTVd Wang-Yang-Y-Zhang 07, 1 year before split Bregman

17 Variable Splitting Split Bregman (Goldstein & Osher) applies ADM to min α v i (Du) i + β Ψu w, Au f 2 M.

18 Variable Splitting Split Bregman (Goldstein & Osher) applies ADM to min α v i (Du) i + β Ψu w, Au f 2 M. Introduce y = Du and z = Ψu, obtain min u,y,z {α v i y i + β z w, Au f 2 M : y = Du, z = Ψu}

19 Variable Splitting Split Bregman (Goldstein & Osher) applies ADM to min α v i (Du) i + β Ψu w, Au f 2 M. Introduce y = Du and z = Ψu, obtain min u,y,z {α v i y i + β z w, Au f 2 M : y = Du, z = Ψu} Augmented Lagrangian: min α v i y i + c 1 u,y,z 2 y Du λ β z w,1 + c 2 2 z Ψu λ Au f 2 M

20 Variable Splitting Split Bregman (Goldstein & Osher) applies ADM to min α v i (Du) i + β Ψu w, Au f 2 M. Introduce y = Du and z = Ψu, obtain min u,y,z {α v i y i + β z w, Au f 2 M : y = Du, z = Ψu} Augmented Lagrangian: min α v i y i + c 1 u,y,z 2 y Du λ Apply ADM +β z w,1 + c 2 2 z Ψu λ Au f 2 M minimizing y and z is shrinkage, closed-form, component-wise minimizing u can be easy too λ k+1 i λ k i + γ( ), i = 1, 2 Global convergence for γ (0, ) by He et al.

21 FTVd: Denoising+Deblurring A is a known convolution minimizing u solves (c 1 D D + c 2 I + A A)u = r, one FFT and one ifft

22 FTVd: Denoising+Deblurring A is a known convolution minimizing u solves (c 1 D D + c 2 I + A A)u = r, one FFT and one ifft Test 1: Lena, Test 2: Man Time from 2 years ago, on an old PC

23 FTVd: Color Deblurring and Impulsive Noise uses 3-channel TV, L1 fidelity kau f k1, need another splitting main computation is FFTs and iffts

24 RecPF: CS from Partial Fourier A is subsampled Fourier, pioneering work by Lustig-Donoho-Pauly 08 works with any sampling pattern (radial lines, spiral, random, etc.) main computation is still FFTs and iffts images, 17% samples, 0.2s CPU

25 Self-Feeding Sparse SENSE Self-Feeding Sparse SENSE (Huang-Chen-Y-Lin-Ye-Guo-Reykowski 09) #CH min αtv g (u) + β Ψu 1 + A(S j u) f j 2 2 PPI, g-factor, sensitivity maps j=1 a 8-CH head coil, 5x acceleration, low RMSE. Better RMSE than SENSE, GRAPPA, CG-CS SENSE

26 RecPC: CS from Partial Circulant/Toeplitz Toeplitz and circulant matrices: t n t n 1 t 1 t n+1 t n t 2 T = t 2n 1 t 2n 2 t n t n t n 1 t 1 t 1 t n t 2 and C = t n 1 t n 2 t n A is a subsampled circulant matrix (Tropp et al 06, Baraniuk et al 07, Marcia et al 08, Hauput 08, Romberg 09, Ying s group 09) Important: C = (FDF ), D is diagonal Sensing matrix: A = P(FDF )

27 Random Circulant vs I.I.D. Random Random circulant has less freedom, is less random. However, they give no difference for CS, for most signals.

28 Random Circulant vs I.I.D. Random Random circulant has less freedom, is less random. However, they give no difference for CS, for most signals.

29 RecPC: CS from Partial Circulant/Toeplitz For images, partial circulant seems to be better than partial Fourier Radial Fourier Random Fourier Random Circulant

30 Other applications of operator splitting Frame-based image processing CS reconstruction for permuted Walsh measurements Nonparametric statistics: copula estimation Matrix completion, rank minimization Semidefinite programming

31 Other applications of operator splitting Frame-based image processing CS reconstruction for permuted Walsh measurements Nonparametric statistics: copula estimation Matrix completion, rank minimization Semidefinite programming Next, other exciting techniques...

32 EdgeCS: Edge Guided CS Reconstruction Guo-Y 10, runs 2-5 iterations: 1. RecPF with weighted TV 2. Subpixel edge detection, partial edge OK 3. Update weights for TV Has theoretical justifications

33 EdgeCS: Edge Guided CS Reconstruction Guo-Y 10, runs 2-5 iterations: 1. RecPF with weighted TV 2. Subpixel edge detection, partial edge OK 3. Update weights for TV Has theoretical justifications From noiseless samples:

34 EdgeCS: Edge Guided CS Reconstruction Guo-Y 10, runs 2-5 iterations: 1. RecPF with weighted TV 2. Subpixel edge detection, partial edge OK 3. Update weights for TV Has theoretical justifications From noisy samples:

35 Bregman Iterative Regularization: noisy CS reconstruction min µ u Au b true signal BPDN recovery 1.5 true signal BPDN recovery µ = 48.5 Not sparse µ = 49 Poor fitting

36 Bregman Iterative Regularization: noisy CS reconstruction min µ u Au b true signal BPDN recovery 1.5 true signal BPDN recovery µ = 48.5 Not sparse µ = 49 Poor fitting Bregman, µ = 150: u k min µ u Au bk 2 2, bk+1 b k + (b Au k ) true signal Bregman recovery Itr 5

37 ADM+Bregman Applied to l p Minimization Chartrand 09: min{ (Du) i p : Au = b} Iterations: 1. for Bregman iterations 2. for ADM iterations Bregman update (add back)

38 ADM+Bregman Applied to l p Minimization Chartrand 09: min{ (Du) i p : Au = b} Iterations: 1. for Bregman iterations 2. for ADM iterations Bregman update (add back) Phantom: , noiseless, 10 radial lines, 3.8% Uterus: , noisy, random k-space, 15%

39 Edge Detection from Incomplete Fourier Samples Stefan, Viswanathan, Gelb, Renaut: uses l 1 and matching wave forms, no Gibbs edges Stefan has a preliminary GPU implementation. See his poster. In MATLAB, on Xeon CPU, 2.5 minutes On Telsa C1060 GPU: 15 seconds (10x speedup)

40 Papers, Software, and Demos available at