Modeling Background Noise for Denoising in Chemical Spectroscopy - - PowerPoint PPT Presentation

modeling background noise for denoising in chemical
SMART_READER_LITE
LIVE PREVIEW

Modeling Background Noise for Denoising in Chemical Spectroscopy - - PowerPoint PPT Presentation

Modeling Background Noise for Denoising in Chemical Spectroscopy Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising Modelling the Noise Estimating Coefficients Segmentation


slide-1
SLIDE 1

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Modeling Background Noise for Denoising in Chemical Spectroscopy

June 29, 2009 Richard Barnard Department of Mathematics Louisiana State University

slide-2
SLIDE 2

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Talk Outline

Problem Formulation An Algorithm for Denoising Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization Numerical Results Conclusions and Future Work

slide-3
SLIDE 3

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

MALDI-TOF Mass Spectrometer

We will consider data sets obtained via Matrix Assisted Laser Desorption/Ionization Time Of Flight Mass Spectrometer.

◮ Analyte sample is placed in a matrix solution.

slide-4
SLIDE 4

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

MALDI-TOF Mass Spectrometer

We will consider data sets obtained via Matrix Assisted Laser Desorption/Ionization Time Of Flight Mass Spectrometer.

◮ Analyte sample is placed in a matrix solution. ◮ Pulsed laser fired at mixture, ionizing analyte.

slide-5
SLIDE 5

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

MALDI-TOF Mass Spectrometer

We will consider data sets obtained via Matrix Assisted Laser Desorption/Ionization Time Of Flight Mass Spectrometer.

◮ Analyte sample is placed in a matrix solution. ◮ Pulsed laser fired at mixture, ionizing analyte. ◮ Analyte ions travel along a path of known length,

striking a detector.

slide-6
SLIDE 6

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

MALDI-TOF Mass Spectrometer

We will consider data sets obtained via Matrix Assisted Laser Desorption/Ionization Time Of Flight Mass Spectrometer.

◮ Analyte sample is placed in a matrix solution. ◮ Pulsed laser fired at mixture, ionizing analyte. ◮ Analyte ions travel along a path of known length,

striking a detector.

◮ Time of flight can be used to determine mass to charge

ratio.

slide-7
SLIDE 7

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Mass Spectrum

Resulting data is a set of 50,000-100,000 data pairs (time/mass-to-charge ratio and intensity). Our spectra will be from SRM 2881, a polystyrene, obtained from NIST. Noise from various sources can lead to uncertainty (see Guttman, Flynn, Wallace, and Kearsley 2009).

Figure: Analyte(red) and corresponding background(blue), low noise

slide-8
SLIDE 8

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Mass Spectrum

Resulting data is a set of 50,000-100,000 data pairs (time/mass-to-charge ratio and intensity). Our spectra will be from SRM 2881, a polystyrene, obtained from NIST. Noise from various sources can lead to uncertainty (see Guttman, Flynn, Wallace, and Kearsley 2009).

Figure: Analyte(red) and corresponding background(blue), with noise

slide-9
SLIDE 9

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Mass Spectrum

Resulting data is a set of 50,000-100,000 data pairs (time/mass-to-charge ratio and intensity). Our spectra will be from SRM 2881, a polystyrene, obtained from NIST. Noise from various sources can lead to uncertainty (see Guttman, Flynn, Wallace, and Kearsley 2009).

Figure: Analyte(red) and corresponding background(blue),with noise

slide-10
SLIDE 10

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Overview

◮ Fit background spectrum to stochastic differential

model

slide-11
SLIDE 11

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Overview

◮ Fit background spectrum to stochastic differential

model

◮ Determine the mean and variance of noise

slide-12
SLIDE 12

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Overview

◮ Fit background spectrum to stochastic differential

model

◮ Determine the mean and variance of noise ◮ Segment spectrum

slide-13
SLIDE 13

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Overview

◮ Fit background spectrum to stochastic differential

model

◮ Determine the mean and variance of noise ◮ Segment spectrum ◮ Use Tikhonov regularization on each segment

slide-14
SLIDE 14

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Background Model

We fit the analyte-free spectrum to a Stochastic Differential Equation with time dependent coefficients dXt = (a0(t) + a1(t)Xt)dt + b0(t)Xt(t)dWt {Wt} is a Wiener Process, Wt − Ws ∼ N(0, t − s), s < t

slide-15
SLIDE 15

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Discretization

Given the background data {X(i)} at discrete points, we use Euler-Maruyama discretization: ∆X(i) = (a0(i) + a1(i)X(i)δ + b0(i)X(i)∆Wi (1)

slide-16
SLIDE 16

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Discretization

Given the background data {X(i)} at discrete points, we use Euler-Maruyama discretization: ∆X(i) = (a0(i) + a1(i)X(i)δ + b0(i)X(i)∆Wi (1) Given a window size for regression h, we use the Epanechnikov Kernel Kh(z) = 3 4h(1 − z2) for z ∈ (−1, 0) and Kh ≡ 0 off (−1, 0).

slide-17
SLIDE 17

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Estimating a0, a1

In order to estimate a0, a1 at each i, we look to minimize min

a0,a1 N

  • j=1

(X(j + 1) − X(j) δ − a0(i) − a1(i)X(j))2Kh(δ(j − i) h ). (2)

slide-18
SLIDE 18

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Estimating a0, a1

In order to estimate a0, a1 at each i, we look to minimize min

a0,a1 N

  • j=1

(X(j + 1) − X(j) δ − a0(i) − a1(i)X(j))2Kh(δ(j − i) h ). (2) For Y (j) = X(j + 1) − X(j), τij = δ(j−i)

h

˜ a0(i) = Y (j)Kh(τij) − δa1(i)Kh(τij) δKh(τij)

slide-19
SLIDE 19

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Estimating a0, a1

In order to estimate a0, a1 at each i, we look to minimize min

a0,a1 N

  • j=1

(X(j + 1) − X(j) δ − a0(i) − a1(i)X(j))2Kh(δ(j − i) h ). (2) For Y (j) = X(j + 1) − X(j), τij = δ(j−i)

h

˜ a1(i) = 1 δ( Kh(τij) Kh(τij)X(j)2 − ( Kh(τij)X(j))2) ∗ (

  • Kh(τij)
  • Y (j)X(j)Kh(τij)

  • Y (j)Kh(τij)
  • X(j)Kh(τij))
slide-20
SLIDE 20

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Estimating b0

Therefore ∆X(i) − (˜ a0(i) + ˜ a1(i)X(i))δ ≈ b0(i)X(i)∆Wi, We set ˜ Ei = ∆X(i) − (˜ a0(i) + ˜ a1(i)X(i))δ δ Then we find ˜ b0(i) by maximizing at each i −1 2

N

  • j=1

Kh(τij)(log(b2X 2(i)) + ˜ E 2

i

b2X 2(i). (3) ˜ b0(i) = N

j=1 Kh(τij)˜

E 2

i |X(i)|−2

N

j=1 Kh(τij)

(4)

slide-21
SLIDE 21

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Mean and Variance

E[X(t)] solves the initial value problem y′(t) = a0(t) + a1(t)y(t), y(0) = X(0) which we solve using a first order forward Euler scheme. The variance of the noise is given by δ(b0(t)X(t))2

slide-22
SLIDE 22

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Segmentaton

◮ We want to use denoising algorithms that take

advantage of knowledge about the noise.

slide-23
SLIDE 23

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Segmentaton

◮ We want to use denoising algorithms that take

advantage of knowledge about the noise.

◮ Many assume constant variance of the noise.

slide-24
SLIDE 24

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Segmentaton

◮ We want to use denoising algorithms that take

advantage of knowledge about the noise.

◮ Many assume constant variance of the noise. ◮ We partition the data and take an approximation of the

variance on each segment.

slide-25
SLIDE 25

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Segmentation

Given a number L we partition the background spectrum into L intervals, Iℓ, such that ||σ(t)|Iℓ||1 = 1 L||σ(t)||1 (5) where σ is the variance of the background spectrum.

slide-26
SLIDE 26

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Tikhonov Regularization

We look to minimize fλ,L(xest) = ||xest − xobs||2

2 + λ||Lxest||2 2

slide-27
SLIDE 27

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Parameter Selection and Segmentation

UPRE is an unbiased estimator of the mean squared error of predictive error Pλ of, 1 N ||Pλ||2 = 1 N ||xλ − xtrue||2,

slide-28
SLIDE 28

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

UPRE Cont’d

We use the following UPRE functional, U(λ) = E( 1 N ||Pλ||2) = 1 N ||rλ||2 + 2σ2 N trace(Aλ) − σ2, where rλ is the residual and Aλ = (I + λI)−1. We can take the mean of σ(t) for the above σ

slide-29
SLIDE 29

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

UPRE Cont’d

We use the following UPRE functional, U(λ) = E( 1 N ||Pλ||2) = 1 N ||rλ||2 + 2σ2 N trace(Aλ) − σ2, where rλ is the residual and Aλ = (I + λI)−1. We can take the mean of σ(t) for the above σ The optimal λ is defined to be, λopt = min

λ {U(λ)} .

slide-30
SLIDE 30

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Algorithm Summary

Given h, ǫ, L, background spectrum, and analyte spectrum:

  • 1. Fit background spectrum to discreted stochastic model,

using h for regression

  • 2. Partition time/mass-per-charge interval into segments
  • 3. Use UPRE to establish on each corresponding segment
  • f analyte spectrum an optimal λ and use Tikhonov

regularization

  • 4. Repeat (2) and (3) with increased number of segments

until improvement in normalized L1 is less than ǫ or number of segments is equal to L.

slide-31
SLIDE 31

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Noise Model

Figure: Simulated Background Spectrum from Noise model for 2nd Noisy Spectrum

slide-32
SLIDE 32

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Denoising Results

With h = 10, tolerance at .001, and max iterations 20,

Figure: 1st Noisy Set

slide-33
SLIDE 33

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Denoising Results

With h = 10, tolerance at .001, and max iterations 20,

Figure: 2nd Noisy set

slide-34
SLIDE 34

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Normalized Denoised Results

Figure: Low Noise Spectrum divided by its L1 Figure: 1st Noisy Spectrum, Denoised, similarly normalized

slide-35
SLIDE 35

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Normalized Denoised Results

Figure: Low Noise Spectrum divided by its L1 Figure: 2nd Noisy Spectrum, Denoised, similarly normalized

slide-36
SLIDE 36

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Normalized Denoised Results

Normalized L1 distance from Best Set and Noisy Spectrum Noisy Denoised 1st Set .5720 .5682 2nd Set .4950 .4912

slide-37
SLIDE 37

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Strategic Points

We create a set of strategic points using the following algorithm

  • 1. Set first and last data points as strategic points
  • 2. Find data point with maximum orthogonal distance

from line segment connecting two consecutive strategic points

  • 3. This point becomes a new strategic point
  • 4. Repeat until maximal orthogonal distance is below

prescribed tolerance

slide-38
SLIDE 38

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Strategic Points

slide-39
SLIDE 39

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Strategic Points

slide-40
SLIDE 40

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Conclusions

◮ Modeled noise by SDE ◮ Created an algorithm to denoise spectrum by

segmentation

◮ Smoothes without moving peak locations

slide-41
SLIDE 41

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Future Work

◮ Peak height is reduced, possibly fit strategic point

height to pre-denoised level

◮ Investigate other regularization techniques ◮ Filter strategic points to remove insignificant peaks for

better estimation of oligomer peaks

slide-42
SLIDE 42

Modeling Background Noise for Denoising in Chemical Spectroscopy Problem Formulation An Algorithm for Denoising

Modelling the Noise Estimating Coefficients Segmentation Tikhonov Regularization

Numerical Results Conclusions and Future Work

Thank You!