Learning Splines for Sparse Tomographic Reconstruction Elham - - PowerPoint PPT Presentation

learning splines for sparse tomographic reconstruction
SMART_READER_LITE
LIVE PREVIEW

Learning Splines for Sparse Tomographic Reconstruction Elham - - PowerPoint PPT Presentation

Learning Splines for Sparse Tomographic Reconstruction Elham Sakhaee and and Alireza Entezari University of Florida esakhaee@cise.ufl.edu Tomographic Reconstruction Recover the image given X-ray measurements X-ray detector Sinogram


slide-1
SLIDE 1

Learning Splines for Sparse Tomographic Reconstruction

Elham Sakhaee and

and Alireza Entezari

University of Florida esakhaee@cise.ufl.edu

slide-2
SLIDE 2

Tomographic Reconstruction

2

§ Recover the image given X-ray measurements

X-ray source X-ray detector Sinogram

slide-3
SLIDE 3

Motivation

§ X-ray Exposure Reduction § ill-posed problem

Half-Detector

A x b

Limited-Angle Few-View

Images courtesy of Pan et.al [2]

3

slide-4
SLIDE 4

Sparse CT

§ Least-squares solution: § Regularize the solution: § R(x) can be sparsity promoting regularizer

A x b

ˆ x = min

x

||Ax − b||2

2

ˆ x = min

x

||Ax − b||2

2 + λR(x)

4

tomographic system matrix intensity image sinogram data

slide-5
SLIDE 5

Related Work (Sparsity)

§ TV minimization:

  • Very promising for piece-wise constant images
  • ASD-POCS [Pan & Sidky 2009]

§ Besov space priors:

  • Bayesian inversion [Siltanen et al. 2012]

§ X-let sparsity:

  • Wavelet [Mirzargar et al. 2013]
  • Curvelet [Hyder & Sukanesh, 2011]

§ Adaptive sparsity via dictionary learning

  • K-SVD [Aharon et al. 2006]

5

slide-6
SLIDE 6

Related Work (Dictionary Learning)

  • KSVD for limited-angle CT [Liao & Sapiro 2008]
  • Learns pixel values
  • Accounts for uniform noise
  • Statistical iterative reconstruction [Xu et al. 2012]
  • Fixed and adaptive dictionaries
  • Updates pixel values using surrogate functionals
  • Handles Poisson noise
  • Sinogram restoration [Shtok et al. 2011]
  • Weighted K-SVD
  • Handles Poisson noise

6

slide-7
SLIDE 7

Common Pixel Representation

vs. Continuous object Finite grid reconstruction

7

Image courtesy of C.G. Koay, https://science.nichd.nih.gov

slide-8
SLIDE 8

Expansion Sets

§ Alternative for pixel-basis

  • Blob functions [Lewitt 1990]
  • Kaiser-Bessel functions
  • Higher-order box-splines
  • Tensor-product linear B-spline
  • Tensor-product cubic B-spline
  • Zwart-Powell function

8

f(x) =

N

X

n=1

cnϕ(x − xn)

slide-9
SLIDE 9

Optimization Problem:

§ Integrate patch-based adaptive sparsity

into spline framework:

9

min

c,α

||Hc − ˆ p||2

W +

+ λ K X

k=1

||Ekc − Dαk||2

2 + µk||αk||0

!

system matrix spline coeff Projection data accounts for data-dependent noise patch extractor learned dictionary sparse representation

  • f kth patch
slide-10
SLIDE 10

Proposed Approach

Dictionary Sparse Splines

Few-View Projection Data Weighted Least-Squares Dictionary Learning

in Spline Domain

Update Spline Coefficients Orthogonal Matching Pursuit Reconstruct Image

from

Spline Coefficients

Stopping Criterion?

Yes

10

No

slide-11
SLIDE 11

Update Splines

§ How to update the spline coefficients? § Differentiate the quadratic objective function:

HT WH + λ X

k

ET

k Ek

! c = HT Wˆ p + λ X

k

ET

k Dαk

11

slide-12
SLIDE 12

Proposed Approach

Dictionary Sparse Splines

Few-View Projection Data Weighted Least-Squares Dictionary Learning

in Spline Domain

Update Spline Coefficients Orthogonal Matching Pursuit Reconstruct Image

from

Spline Coefficients

Stopping Criterion?

Yes

12

No

update c sparsify patches of c

slide-13
SLIDE 13

Proposed Approach

Dictionary Sparse Splines

Few-View Projection Data Weighted Least-Squares Dictionary Learning

in Spline Domain

Update Spline Coefficients Orthogonal Matching Pursuit Reconstruct Image

from

Spline Coefficients

Stopping Criterion? 13

Yes No

  • Fixed # of iterations
  • Threshold on objective function
  • Change in objective function
slide-14
SLIDE 14

Proposed Approach

Dictionary Sparse Splines

Few-View Projection Data Weighted Least-Squares Dictionary Learning

in Spline Domain

Update Spline Coefficients Orthogonal Matching Pursuit Reconstruct Image

from

Spline Coefficients

Stopping Criterion?

Yes

14

No

f(x) =

N

X

n=1

cnϕ(x − xn)

slide-15
SLIDE 15

Results: pixel-basis vs. Linear

Pixel-basis (first-order box-spline) SNR: 10.52 dB Linear (second-order box-spline) SNR: 14.46 dB

15

FBP SNR: 10.49 dB

§ 45 projection views:

slide-16
SLIDE 16

Results: LSQR vs. Spline Learning

FBP (SNR: 15.51 dB) LSQR (SNR: 17.19 dB) Spline Learning (SNR: 18.23 dB) Original 16

§ 60 projection views:

slide-17
SLIDE 17

Results: Fixed vs. Learned Sparsity

Original Spline Learning SNR:17.58 dB Wavelet SNR: 15.72 dB

17

§ 60 projection views:

slide-18
SLIDE 18

Results: Resilience to Reduction of Angles

90 views SNR: 15.66 dB 60 views SNR: 15.19 dB 45 views SNR: 14.46 dB

18

slide-19
SLIDE 19

Summary

§ We proposed higher-order box-splines as

alternatives for pixel-basis, integrated patch-based adaptive sparsity into this spline framework

§ Superiority of higher-order splines § Simply choice of tensor-product Linear B-spline

19

slide-20
SLIDE 20

Future Work

§ Mixed spline representations § Analysis of approximation error as a function of

grid resolution

20

slide-21
SLIDE 21

References

§

Pan, X., Sidky, E.Y., Vannier, M.: Why do commercial CT scanners still employ traditional, filtered back-projection for image reconstruction? Inverse Problems 25 (2009)

§

Candes, E., Romberg, J., Tao, T., “Robust uncertainty principles: exact signal reconstruction from highly in- complete frequency information,” IEEE Trans.

  • Inform. Theory, vol. 52, pp. 489–509, (2006).

§

Mirzargar, M., Sakhaee, E., Entezari, A.: A spline framework for sparse tomographic

  • reconstruction. In: Biomedical Imaging (ISBI) 10th IEEE International Symposium on.

(2013)

§

Kolehmainen, V., Lassas, M., Niinimaki, K., Siltanen, S.: Sparsity-promoting bayesian

  • inversion. Inverse Problems 28 (2012).

§

Hyder, S. Ali, and R. Sukanesh. "An efficient algorithm for denoising MR and CT images using digital curvelet transform." Software Tools and Algorithms for Biological

  • Systems. Springer New York, 2011. 471-480.

§

Liao, H., Sapiro, G.: Sparse representations for limited data tomography. In Biomedical Imaging: From Nano to Macro, 2008. ISBI 2008. 5th IEEE International Symposium on. (2008) 1375–1378

§

Xu, Q., Yu, H., Mou, X., Zhang, L., Hsieh, J., Wang, G.: Low-dose X-ray CT reconstruction via dictionary learning. IEEE Trans Med Img 31 (2012) 1682–1697

§

Shtok, J., Elad, M., Zibulevsky, M.: Sparsity-based sinogram denoising for low-dose computed tomography. In: Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on. (2011) 569–572

21

slide-22
SLIDE 22

22

Thank you … Questions?

slide-23
SLIDE 23

Results: SNR vs. Iteration number

23

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 13 14 15 16 17 18 19

iteration number

SNR (dB) Zwart−Powell Cubic Linear Pixel−basis

slide-24
SLIDE 24

Results: Resilience

24

number of projection angles

SNR (dB)

30 45 60 90 10 12 14 16 18 20 22

slide-25
SLIDE 25

Results: Convergence

25

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 23 24 25 26 27 28 29 30

iteration number

Sparse Representation Error

min

c,α

||Hc − ˆ p||2

W + λ

K X

k=1

||Ekc − Dαk||2

2 + µk||αk||0

!