Compressive Sensing with Biorthogonal Wavelets via Structured - - PowerPoint PPT Presentation

compressive sensing with biorthogonal wavelets via
SMART_READER_LITE
LIVE PREVIEW

Compressive Sensing with Biorthogonal Wavelets via Structured - - PowerPoint PPT Presentation

Compressive Sensing with Biorthogonal Wavelets via Structured Sparsity Marco F. Duarte Richard G. Baraniuk Compressive Imaging Data x K -sparse in orthonormal basis : Measure linear projections onto incoherent basis where data is not


slide-1
SLIDE 1

Compressive Sensing with Biorthogonal Wavelets via Structured Sparsity

Richard G. Baraniuk Marco F. Duarte

slide-2
SLIDE 2
  • Data x K-sparse in orthonormal basis :
  • Measure linear projections onto incoherent basis

where data is not sparse

  • Reconstruct via optimization or greedy algorithms

Compressive Imaging

project transmit receive recovery

x

(CoSaMP, OMP, IHT, ...)

slide-3
SLIDE 3
  • Random matrices lead to RIP with high probability if

when is an orthonormal basis

  • i.i.d. Subgaussian entries: Gaussian, Rademacher, ...

Φ

  • RIP of order 2K implies: for all K-sparse and

[Candès and Tao 2005]

  • Preserve distances between sparse/compressible signals

Restricted Isometry Property (RIP)

RIP of order 2K enables K-sparse signal recovery

slide-4
SLIDE 4

Example: Compressive Imaging

  • Example: Recovery via CoSaMP

using 2-D Daubechies-8 wavelet

N = 262144, M = 60000 SNR = 17.93dB

  • 2-D wavelets and 2-D DCT are common

Original

slide-5
SLIDE 5
  • JPEG 2000
  • Lossy compression via transform coding
  • Cohen-Daubechies-Feauveau 9/7

Biorthogonal Wavelet (CDF 9/7)

State-of-the-Art Image Compression

slide-6
SLIDE 6
  • Biorthogonal wavelets involve:

– an analysis basis – a synthesis basis

  • Transform coding:
  • Analysis and synthesis bases are

not orthonormal:

  • Standard guarantees and algorithms are not

necessarily suitable for biorthogonal wavelets

Properties of Biorthogonal Wavelets

slide-7
SLIDE 7

Beyond Orthonormal Bases

  • Dictionary: arbitrary matrix (basis/frame)

that provides sparsity

  • Dictionary coherence
  • Theorem:

If has rows and then the matrix has RIP of order K

  • Sadly, CDF 9/7 synthesis basis has

large coherence:

[Rauhut, Schnass, Vandergheynst 2008]

slide-8
SLIDE 8

CS with Coherent Dictionaries

  • For tight frame dictionaries with arbitrary

coherence, can use -analysis:

  • norm minimization for analysis coefficients
  • New -RIP preserves distances between

signal vectors instead of coefficient vectors

  • -RIP is tailored to dictionary and enables

guarantees for recovery via -analysis (in contrast to -synthesis)

  • Random matrix has -RIP if

[Candès, Eldar, Needell, Randall 2010]

slide-9
SLIDE 9

Compressive Imaging via Biorthogonal Wavelets

  • Example: Recovery via CoSaMP

using CDF 9/7 wavelet

N = 262144, M = 60000 SNR = 4.6dB Original

slide-10
SLIDE 10
  • Example: Recovery via -synthesis

using CDF 9/7 wavelet

N = 262144, M = 60000 SNR = 21.54dB! Original

Compressive Imaging via Biorthogonal Wavelets

slide-11
SLIDE 11

Benefits of Biorthogonal Wavelets

  • Why does -synthesis work well?
  • Because biorthogonal wavelet analysis and

synthesis bases are “interchangeable”:

  • Thus, we have and the

following two formulations are equivalent:

( -synthesis) ( -analysis)

slide-12
SLIDE 12

CDF 9/7 Recovery Artifacts

“Ringing”

slide-13
SLIDE 13

Coherence of Biorthogonal Wavelets

  • Each wavelet is coherent

with spatial neighbors across different wavelet

  • rientations and scales
  • Ringing artifacts caused

by ambiguity due to coherent/neighbor wavelets during sparse wavelet selection

  • Can inhibit supports that

include coherent pairs of neighboring wavelets

slide-14
SLIDE 14

Structured Sparsity Models

  • Promote structure common in

natural images

  • Inhibit selection of additional

highly-coherent wavelet pairs

slide-15
SLIDE 15
  • Modify existing greedy

algorithms that rely on thresholding (e.g. CoSaMP)

  • Replace thresholding with

best structured sparse approximation that finds the closest point to input x in a restricted union of subspaces that encodes structure:

Structured Sparse Recovery Algorithms

x

ΩK

RN

[Baraniuk, Cevher, Duarte, Hegde 2010]

slide-16
SLIDE 16
  • Measurements needed:

for random matrices with i.i.d entries,

Connected Rooted Subtree Sparsity

without structure with structure

  • Structure: K-sparse coefficients

+ nonzero coefficients lie on a rooted subtree

  • Approximation algorithm:

– condensing sort and select [Baraniuk] – dynamic programming [Donoho] – computational complexity:

slide-17
SLIDE 17

CS via Biorthogonal Wavelets

  • Example: Recovery via tree-CoSaMP

using CDF 9/7 wavelet

N = 262144, M = 60000 SNR = 23.31dB Original

slide-18
SLIDE 18
  • analysis

CDF 9/7 SNR = 23.31dB Tree-CoSaMP CDF 9/7 SNR = 22.14dB Tree-CoSaMP Daubechies-8 SNR = 21.54dB SNR = 17.93dB CoSaMP Daubechies-8 SNR = 4.60dB CoSaMP CDF 9/7 Original

N = 262144

slide-19
SLIDE 19

Performance Comparison - Cameraman

N = 262144

  • analysis/CDF97
slide-20
SLIDE 20

Conclusions

  • Structured sparsity enables improved greedy

algorithms for compressive imaging with 2-D biorthogonal wavelets

– promote structure present in wavelet representations of natural images – inhibit interference from neighboring wavelets that do not match model – simple-to-implement modifications to recovery that are computationally efficient – reduced number of random measurements required for improved image recovery

  • Current and future work:

– analytical study of 2-D biorthogonal wavelets (coherence, RIP) for compressive imaging – Extensions to redundant wavelet frames

dsp.rice.edu/cs dsp.rice.edu/~richb cs.duke.edu/~mduarte