Sparsity-optimized Harmonic Wavelets for Compressed Sensing MRI - - PowerPoint PPT Presentation

sparsity optimized harmonic wavelets for compressed
SMART_READER_LITE
LIVE PREVIEW

Sparsity-optimized Harmonic Wavelets for Compressed Sensing MRI - - PowerPoint PPT Presentation

Sparsity-optimized Harmonic Wavelets for Compressed Sensing MRI Ruediger Willenberg (ECE) JEB1433 Project Presentation April 22, 2010 References n M.Lustig, D.Donoho, J.M.Pauly: Sparse MRI: The Application of Compressed Sensing for Rapid


slide-1
SLIDE 1

Sparsity-optimized Harmonic Wavelets for Compressed Sensing MRI

Ruediger Willenberg (ECE) JEB1433 Project Presentation April 22, 2010

slide-2
SLIDE 2

References

n M.Lustig, D.Donoho, J.M.Pauly: „Sparse MRI: The

Application of Compressed Sensing for Rapid MR Imaging“, 2009

n D.E.Newland: „Harmonic Wavelet Analysis“, 1993 n D.E.Newland: „Harmonic and Musical Wavelets“, 1994 n B. Liu, „Adaptive Harmonic Wavelet Transform with

applications in vibration analysis“, 2002

n R.R.Coifman, M.V. Wickerhauser, „Entropy-based

Algorithms for Best Basis Selection“, 1992

slide-3
SLIDE 3

Motivation

n Strong technical, medical and economic

incentives for sampling minimal data

n Compressed sensing provides the

mathematical tools for that

n A sparse transform domain must exist to be

able to sample minimal data

slide-4
SLIDE 4

Sparse transforms

slide-5
SLIDE 5

Basic Idea

n Can we find optimized transforms for „families“

  • f similar images?
slide-6
SLIDE 6

Basic Idea

n Can we find optimized transforms for „families“

  • f similar images?

n No easy recipe to build an orthonormal basis

with optimal sparsity

n We need a transform that can be easily

reconfigured

slide-7
SLIDE 7

Wavelet Transforms

n Wavelets:

Locally concentrated

  • scillating functions,

scalable and translatable

slide-8
SLIDE 8

Wavelet Transforms

n Wavelet transforms

break down signals

  • r images in

frequency and spatial information

slide-9
SLIDE 9

Harmonic Wavelet Transform

n Introduced by D.E.Newland in 1993 for signal

analysis

n Approach: Cleanly separated wavelet spectra

slide-10
SLIDE 10

HWT: Complex Wavelet Components

slide-11
SLIDE 11

HWT: Wavelet scaling & translation

Frequency scaling (j) and translation (k): define vj,k(x) = w(2jx-k)

slide-12
SLIDE 12

HWT: Wavelet scaling & translation

slide-13
SLIDE 13

HWT: Coefficients & Expansion

n Coefficients: n Expansion formula:

slide-14
SLIDE 14

HWT: Base conditions

n Orthogonality: <em,en> = 0 n Orthonormality: <em,em> = 1 n Parseval Identity:

energy of coefficients = energy of function

slide-15
SLIDE 15

HWT: Orthogonality

slide-16
SLIDE 16

HWT: Orthonormality

slide-17
SLIDE 17

HWT: Parseval

slide-18
SLIDE 18

HWT: Discretization

n Basis functions must be periodic on the

unit interval:

slide-19
SLIDE 19

HWT: Discrete Transform

slide-20
SLIDE 20

Back to the Idea: Optimized Bases

n Freely chosen harmonic wavelets instead

  • f a fixed series:
slide-21
SLIDE 21

Is that still an orthonormal basis?

n Orthogonality, orthonormality and Parseval

were proven

n Newland proposed it in 1994 and called this

„General harmonic wavelets“

slide-22
SLIDE 22

How to find the optimal base?

n Take data sample to compress n Try out all possible spectrum divisions n Select the most sparse one n Problems: Complexity too high?

Sparsity metric? 2-dimensional-images groups of images

slide-23
SLIDE 23

Lower complexity approximation

n Binary tree search:

  • Compute sparsity for each subdivision
  • Compare sparsity of ‚node‘ with sum of child

sparsities

  • Choose minimal set
slide-24
SLIDE 24

Possible sparsity metrics

n Shannon entropy:

  • Σi pi log(pi) with pi=|ci|2 / ||f||2

n L1-Norm: Sum of absolutes n L0-Norm: Number of non-zero coefficients

(Reality: non-zero coefficients -> cutoff?)

slide-25
SLIDE 25

2-dimensional images

n Sequential application of

FFT, HWT for vertical and horizontal data

n Since directional

characteristics different: separate sparsity analysis, different bases

slide-26
SLIDE 26

2-dimensional images, image groups

n Two approaches for line,

image combination: a) average all line FFTs, then build base spectrum b) build base spectrum for each line, average base spectra

slide-27
SLIDE 27

Success metric

n l1magic: Min-l1 with quadratic constraints too

slow for whole images

n Instead robustness for image reconstruction

from sparse data:

  • Transform image
  • Throw away 95% smallest coefficients
  • Retransform
  • Compare FFT, Optimized HWT,

Original HWT, JPEG2K

slide-28
SLIDE 28

Results

n Shannon Entropy, l0norm, l1norm all heavily

prefer minimal frequency bands => HWT degenerates to FFT

slide-29
SLIDE 29

Results

n Through explicit tweaking, higher level

frequency bands can be forced, but no consistent behavior is observable

slide-30
SLIDE 30

Original

slide-31
SLIDE 31

Original HWT

slide-32
SLIDE 32

General HWT

slide-33
SLIDE 33

FFT

slide-34
SLIDE 34

JPEG 2000

slide-35
SLIDE 35

Original

slide-36
SLIDE 36

Original HWT

slide-37
SLIDE 37

General HWT

slide-38
SLIDE 38

FFT

slide-39
SLIDE 39

JPEG 2000

slide-40
SLIDE 40

Conclusions

n Approach to simplistic; averaging spectral

information over a whole picture (or more) gives weak results

n Harmonic Wavelet Transform in general lacks

sparsity, especially in competition with JPEG2000 (here: LeGall 5/3 wavelet)

slide-41
SLIDE 41

Conclusions

slide-42
SLIDE 42

Thank you for your attention!

n Questions?