Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g =...

41
Approximate Message Passing in Coded Aperture Snapshot Spectral Imaging Jin Tan, Yanting Ma, Hoover Rueda, Dror Baron, and Gonzalo R. Arce Orlando, FL December 15, 2015 Supported by NSF and ARO

Transcript of Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g =...

Page 1: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Approximate Message Passing in Coded Aperture Snapshot Spectral Imaging

Jin Tan, Yanting Ma, Hoover Rueda,Dror Baron, and Gonzalo R. Arce

Orlando, FLDecember 15, 2015

Supported by NSF and ARO

Page 2: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

RGB image

Image slices at different wavelengths

Hyperspectral Images

3D cube

Page 3: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Hyperspectral Images

• Obtain spectrum information of a scene

• Applications include

• Medical imaging

• Geology

• Astronomy

• Remote sensing

Page 4: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Conventional Hyperspectral Imaging

• Acquire and store entire image in all spectrum bands

• Disadvantages• Long imaging time• Large storage

Page 5: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Conventional Hyperspectral Imaging

• Acquire and store entire image in all spectrum bands

• Disadvantages• Long imaging time• Large storage

Better imaging system?

Page 6: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Compressive Hyperspectral Imaging

Page 7: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Coded Aperture Snapshot Spectral Imaging (CASSI) [Wagadarikar et al. 2008]

Page 8: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

+=

vectorized3D-cube noise

data on focal plane CASSI

g H (m × n) zf0

Compressive Sensing Formulation

g = Hf0 + z

Page 9: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

[Arguello et al. 2013]Higher Order CASSI

measurement rate ≈ 2/L, L: #spectrum bands

Page 10: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Challenges

• Highly compressed measurements

• Structured sensing matrix

• Large signal dimension (need fast algorithm)

Page 11: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Challenges

• Highly compressed measurements

• Structured sensing matrix

• Large signal dimension (need fast algorithm)

no parameter tuning runtime

Page 12: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Approximate Message Passing[Donoho et al. 2009]

Page 13: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Approximate Message Passing (AMP)

g = Hf0 + z ∈ ℝm qt = f0 + vt ∈ ℝncompressive sensing denoising

Pseudo-data(noisy data)

Page 14: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Approximate Message Passing (AMP)

g = Hf0 + z ∈ ℝm qt = f0 + vt ∈ ℝncompressive sensing denoising

• Noise vt uncorrelated with input f0• Noise vt distributed as i.i.d. Gaussian 𝒩𝒩(0,σt2)

• Noise variance σt2 can be accurately estimated

• Convergence theoretically characterized

If sensing matrix H is i.i.d. Gaussian, asymptotically

Page 15: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Approximate Message Passing (AMP)

g = Hf0 + z ∈ ℝm qt = f0 + vt ∈ ℝncompressive sensing denoising

• Noise vt uncorrelated with input f0• Noise vt distributed as i.i.d. Gaussian 𝒩𝒩(0,σt2)

• Noise variance σt2 can be accurately estimated

• Convergence theoretically characterized

If sensing matrix H is i.i.d. Gaussian, asymptotically

May break down for structured matrix!

Page 16: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

AMP PseudocodeInitialize f t=0 ← 𝟎𝟎At iteration 𝑡𝑡, do

Residual: rt ← g − Hf t +rt−1

m/n η′t−1(f t−1 + HTrt−1)

Page 17: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

AMP PseudocodeInitialize f t=0 ← 𝟎𝟎At iteration 𝑡𝑡, do

Residual: rt ← g − Hf t +rt−1

m/n η′t−1(f t−1 + HTrt−1)

Onsager correction

Page 18: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

AMP PseudocodeInitialize f t=0 ← 𝟎𝟎At iteration 𝑡𝑡, do

Residual:

Noisy signal:

Noise (vt) level:

Denoising:

rt ← g − Hf t +rt−1

m/n η′t−1(f t−1 + HTrt−1)

qt ← f t + HTrt

σt2 ← ||rt||22/m

f t+1 ← ηt(qt;σt2)

(= f0 + vt)

𝒩𝒩(0,σt2)

for i.i.d. Gaussian H

Page 19: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Initialize f t=0 ← 𝟎𝟎At iteration 𝑡𝑡, do

Residual:

Noisy signal:

Noise (vt) level:

Denoising:

rt ← g − Hf t +rt−1

m/n η′t−1(f t−1 + HTrt−1)

qt ← f t + HTrt

σt2 ← ||rt||22/m

f t+1 ← ηt(qt;σt2)

AMP for Hyperspectral Image Recovery

3D image denoiser

Page 20: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

• 2D wavelet + 1D discrete cosine transform (DCT)

Denoising (3D-Wiener)

qt = f0 + vt θqt = θf0 + θvt

2D wavelet 1D DCT

Page 21: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

• 2D wavelet + 1D discrete cosine transform (DCT)

• Assume Var(θv,it ) = σt2(= ||rt||/m), i = 1, . . , n

Denoising (3D-Wiener)

qt = f0 + vt θqt = θf0 + θvt

2D wavelet 1D DCT

Page 22: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

• 2D wavelet + 1D discrete cosine transform (DCT)

• Assume Var(θv,it ) = σt2(= ||rt||/m), i = 1, . . , n

• Empirical variance σi2 and mean µi of θf0,i estimated

using θqt in wavelet subband

Denoising (3D-Wiener)

qt = f0 + vt θqt = θf0 + θvt

2D wavelet 1D DCT

Page 23: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

• 2D wavelet + 1D discrete cosine transform (DCT)

• Assume Var(θv,it ) = σt2(= ||rt||/m), i = 1, . . , n

• Empirical variance σi2 and mean µi of θf0,i estimated

using θqt in wavelet subband

• Wiener filter: θf,it+1 = σi2

σi2+σt2

⋅ θq,it − µi + µi

Denoising (3D-Wiener)

qt = f0 + vt θqt = θf0 + θvt

2D wavelet 1D DCT

Page 24: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Divergence Problem

• Structured matrix H• Inaccurate model assumption in denoising problem

Iteration t

f10 f11 f12diverged

Page 25: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Initialize f0 ← 𝟎𝟎At iteration t, do

Residual:

Noisy image:

Noise level:

Denoising:

Damping:

rt ← g − Hf t +rt−1

m/n η′t−1(f t−1 + HTrt−1)

qt ← f t + HTrt

σt2 ← ||rt||22/m

f t+1 ← ηt(qt;σt2)

AMP-3D-Wiener

f t+1 ← 𝛼𝛼 ⋅ f t+1 + 1 − 𝛼𝛼 ⋅ f t(0 < 𝛼𝛼 ≤ 1)

3D-Wiener

Page 26: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Numerical Results

Page 27: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Original Iteration 1

Numerical Results

Lego toy example

Page 28: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Original Iteration 4

Numerical Results

Lego toy example

Page 29: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Original Iteration 7

Numerical Results

Lego toy example

Page 30: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Original Iteration 10

Numerical Results

Lego toy example

Page 31: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Original Iteration 20

Numerical Results

Lego toy example

Page 32: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Original Iteration 50

Numerical Results

Lego toy example

Page 33: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Original Iteration 100

Numerical Results

Lego toy example

Page 34: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Original Iteration 400

Numerical Results

Lego toy example

Page 35: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

• Lego toy example• 2 shots; complementary coded aperture; 20dB noise• No parameter tuning for AMP-3D-Wiener

TwIST [Bioucas-Dias & Figueiredo 2007, Wagadarikar 2008]GPSR [Figueiredo et al. 2007]

Numerical Results

Page 36: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Numerical Results

• Lego toy example• 2 shots; complementary coded aperture; 20dB noise

TwIST [Bioucas-Dias & Figueiredo 2007, Wagadarikar 2008]GPSR [Figueiredo et al. 2007]

Page 37: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Numerical Results

• Lego toy example• 2-12 shots; complementary coded aperture; 20dB noise

TwIST [Bioucas-Dias & Figueiredo 2007, Wagadarikar 2008]GPSR [Figueiredo et al. 2007]

Page 38: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Natural scenes [personalpages.manchester.ac.uk/staff/d.h.foster/]

AlgorithmSNR

Numerical Results

AMP reconstructs better in all tested scenes.

TwIST [Bioucas-Dias & Figueiredo 2007, Wagadarikar 2008]GPSR [Figueiredo et al. 2007]

Page 39: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Summary

Page 40: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Summary

• Problem: Hyperspectral image reconstruction in CASSI

• Algorithm: Approximate message passing with adaptive Wiener filter in 2D wavelet + 1D DCT domain

• Challenges:• Highly compressed measurements• Structured sensing matrix

• Results: • Improved PSNR and runtime• No parameter tuning

Page 41: Approximate Message Passing in Coded Aperture Snapshot ......Approximate Message Passing (AMP) g = Hf 0 +z ∈ℝ m q t = f 0 +v t ∈ℝ n compressive sensing denoising • Noise

Thank you!


Section 4.1 Vectors in ℝ n

Section 4.1 Vectors in ℝ n

APPROXIMATE MESSAGE PASSING ALGORITHMS FOR A …mam15/suthesis-Arian.pdfapproximate message passing algorithms for compressed sensing a dissertation submitted to the department of

APPROXIMATE MESSAGE PASSING ALGORITHMS FOR A …mam15/suthesis-Arian.pdfapproximate message passing algorithms for compressed sensing a dissertation submitted to the department of

Section 5.1 Length and Dot Product in ℝ n

Section 5.1 Length and Dot Product in ℝ n

Compressed-SensingRecoverywith Super … · 2019-03-18 · Compressed Sensing Basics and Practical Relevance Bayesian Approximate Message Passing (BAMP) for Compressed Sensing Recovery

Compressed-SensingRecoverywith Super … · 2019-03-18 · Compressed Sensing Basics and Practical Relevance Bayesian Approximate Message Passing (BAMP) for Compressed Sensing Recovery

GENERALIZED APPROXIMATE MESSAGE PASSING 1 ...2 GENERALIZED APPROXIMATE MESSAGE PASSING problems [10]–[14], while being potentially more general. Moreover, our simulations indicate

GENERALIZED APPROXIMATE MESSAGE PASSING 1 ...2 GENERALIZED APPROXIMATE MESSAGE PASSING problems [10]–[14], while being potentially more general. Moreover, our simulations indicate

Math 22 Linear Algebra and its applications - Lecture 15m22f19/math22_lecture15_f19.pdf · We have seen in Lecture 14: Theorem: Let T: ℝ →ℝ be a linear transformation and let

Math 22 Linear Algebra and its applications - Lecture 15m22f19/math22_lecture15_f19.pdf · We have seen in Lecture 14: Theorem: Let T: ℝ →ℝ be a linear transformation and let

An Approximate Message Passing Framework for Side ... - arXiv · Approximate message passing (AMP) methods have gained recent traction in sparse signal recovery. Additional information

An Approximate Message Passing Framework for Side ... - arXiv · Approximate message passing (AMP) methods have gained recent traction in sparse signal recovery. Additional information

Approximate Computing Is Dead; Long Live Approximate Computingasampson/media/closedproblems-nope2017... · Approximate Computing Is Dead; Long Live Approximate Computing Adrian Sampson

Approximate Computing Is Dead; Long Live Approximate Computingasampson/media/closedproblems-nope2017... · Approximate Computing Is Dead; Long Live Approximate Computing Adrian Sampson

Section 5.1 Length and Dot Product in ℝ n. Let v = ‹v 1, v 2, v 3,..., v n › and w = ‹w 1, w 2, w 3,..., w n › be vectors in ℝ n. The dot product.

Section 5.1 Length and Dot Product in ℝ n. Let v = ‹v 1, v 2, v 3,..., v n › and w = ‹w 1, w 2, w 3,..., w n › be vectors in ℝ n. The dot product.

Empirical-Bayes Approaches to Recovery of Structured ...schniter/pdf/vila_diss.pdfEmpirical-Bayes Approaches to Recovery of Structured Sparse Signals via Approximate Message Passing

Empirical-Bayes Approaches to Recovery of Structured ...schniter/pdf/vila_diss.pdfEmpirical-Bayes Approaches to Recovery of Structured Sparse Signals via Approximate Message Passing

Approximate Message Passinggpapan/pos12/talks/Montanari.pdf · Approximate Message Passing Mohsen Bayati, David Donoho, Adel Jaanmardv Iain Johnstone, Marc Lelarge, Arian Maleki,

Approximate Message Passinggpapan/pos12/talks/Montanari.pdf · Approximate Message Passing Mohsen Bayati, David Donoho, Adel Jaanmardv Iain Johnstone, Marc Lelarge, Arian Maleki,

Section 4.1 Vectors in ℝ n. ℝ n Vectors Vector addition Scalar multiplication.

Section 4.1 Vectors in ℝ n. ℝ n Vectors Vector addition Scalar multiplication.

Approximate+Message+Passing++ …schniter/pdf/spars11_slides.pdfExample Next few slides Algorithm based on alternating minimization Nesterov acceleration, ... [Boutros and Caire 2002;

Approximate+Message+Passing++ …schniter/pdf/spars11_slides.pdfExample Next few slides Algorithm based on alternating minimization Nesterov acceleration, ... [Boutros and Caire 2002;

APPROXIMATE MESSAGE PASSING ALGORITHMS FOR ...mam15/suthesis-Arian.pdfmy life, but also my favorite classmate, my best friend, and my best collaborator. Every time I have an idea,

APPROXIMATE MESSAGE PASSING ALGORITHMS FOR ...mam15/suthesis-Arian.pdfmy life, but also my favorite classmate, my best friend, and my best collaborator. Every time I have an idea,

Spread 10 Approximate STA 10791+00 to Approximate STA ...

Spread 10 Approximate STA 10791+00 to Approximate STA ...

Calculating approximate GCD of univariate polynomials with 'approximate' syzygies

Calculating approximate GCD of univariate polynomials with 'approximate' syzygies

CAMPUS ATB PASSING TEST SCORES CPAt Passing … · CAMPUS ATB PASSING TEST ... • Passing scores on the Wonderlic Basic Skills Test are: Verbal (205 ... must achieve a passing score

CAMPUS ATB PASSING TEST SCORES CPAt Passing … · CAMPUS ATB PASSING TEST ... • Passing scores on the Wonderlic Basic Skills Test are: Verbal (205 ... must achieve a passing score

Approximate Dynamic Programming via Linear Programmingpapers.nips.cc/paper/2129-approximate-dynamic-programming-via... · Approximate Dynamic Programming via Linear Programming ...

Approximate Dynamic Programming via Linear Programmingpapers.nips.cc/paper/2129-approximate-dynamic-programming-via... · Approximate Dynamic Programming via Linear Programming ...

Orthogonal AMP - arXiv · Orthogonal AMP Junjie Ma and Li Ping, Fellow, IEEE Abstract—Approximate message passing (AMP) is a low-cost iterative signal recovery algorithm for linear

Orthogonal AMP - arXiv · Orthogonal AMP Junjie Ma and Li Ping, Fellow, IEEE Abstract—Approximate message passing (AMP) is a low-cost iterative signal recovery algorithm for linear

Passing Off Passing Off: Dilution and the Unprincipled ...

Passing Off Passing Off: Dilution and the Unprincipled ...