Académique Documents
Professionnel Documents
Culture Documents
manipulation
Signals
A signal is actually composed of several responses.
Sample response
Background response
Signal
A response obtained from a stimuli
It can arise from many sources
Classical Methods
Instruments
Either qualitative or quantitative.
Signal detection
Interference responses
Variation of signal
2signal = 2sample + 2background +2interferences
Signal detection
frequency
_
_
x
x
background sample
Signal detection
sample
background
X sample -X background
decreases as the amount
of sample is reduced.
Limit of detection
IUPAC definition of detection limit
The amount of sample that gives a signal
centered about bkg + 3 bkg
This definition assures that you will have an
error and must make a decision:
Signal Detection
Limit of detection
The smallest amount of an analyte that can
be detected with absolute certainty.
6!
If 2
IUPAC
is
probability
probability of
of
being
being sample
sample
probability
probability of
of
being
being background
background
Measurement decision
background
analyte
detected
with certainty.
Measurement decision
+ 6
Measurement decision
a = A - 3 A
b = B + 3 B
If measured signal
> b# analyte must be present
< a# no analyte is present
#
between no absolute
decision can be make
No
bkg
3!
3!
0.13% overlap
Limit of detection
A - analyte
B - background
= 2
bkg
sample
then the minimum for
guaranteed detection
Yes
Measurement decision
no decision
likely to be
no sample
likely to
be sample
No sample
Sample
^x A -x B h ^N A +N B -2h
1
(N A -1) s 2A + ^N B -1h s B2
N A +N B
This equation is just a modification of the t test to
see if there is any significant overlap.
t s x bkg
x bkg +
N
DF =N A +N B -2
^x A -x B h ^N A +N B -2h
1
(N A -1) s 2A + ^N B -1h s B2
N A +N B
If calculated value is t, then the mean
sample is different from the background.
Let D =` x A -x b j
v 2 D =v 2 x A +v 2 x B =
v2 A v2B
+
NA
NB
^N A -1h s 2 A + ^N B -1h s 2 B
N A +N B -2
pooled statistics
Signal to noise
Signal to noise
At the 95% confidence level, the difference
between the blank and sample must be at
least 2.875 times larger that sbackground.
This assumes that NA = NB = 10.
As the number of measurements increases,
the minimum difference in S/N will
decrease.
Signal to noise
Example
Precision at the
detection limit
Optimization of a method
The key to improving a method is to improve
the signal to noise ratio.
Optimization of a method
The first thing you should always do is:
Assure that all experimental parameters
except the analyte are invariant (constant).
Examples - temperature, pH, solvent,
matrix, instrumental conditions, steps in the
procedure.
Optimization of a method
Prior to making each factor invariant, each must be
evaluated for optimum response.
Example.
You might find that the highest response is at pH = 2 or
at a of 356nm.
In UV/Vis, we use a max to two reasons - highest response
AND more invariant do to minor variations.
Signal averaging
n
Signal =! measurements
n
i =1
Optimization of a method
After you have obtained the best possible response,
you may consider some type of signal treatment to
improve S/N.
Modulation
Smoothing
Signal averaging
For n measurements, S/N improves by N1/2.
Requires a large number of measurements to
get a significant improvement in S/N.
N
S/N improvement
2
4
9
16
1
2
3
4
Signal averaging
Example
3000
2500
2000
1500
1000
500
0
3
1800
1400
3.4
3.6
3.8
4.2
4.4
4.6
4.8
Another view.
1600
3.2
600
RSTD = 9.1%
500
1200
1000
400
800
300
600
200
400
RSTD = 14.9%
100
200
0
3.4
3.5
3.6
3.7
3.8
3.9
4.1
4.2
0
3
3.2
3.4
3.6
3.8
4.2
4.4
4.6
4.8
Boxcar integration
A single-channel signal averager.
This method works by making multiple
measurements at each point in a spectrum.
Steps
Turn detector on/off several times, storing the
measured value when on.
Move to the next and repeat.
Boxcar integration
This approach will increase n ( the number
of measurements ) at each .
The sample must be stable with respect to
time and being analyzed.
Method will make run times longer but not
as much as taking multiple spectra.
Goal is to cancel out noise by making
several on-the-fly measurements
Filtering
Reduces noise by not allowing rapid changes in the
signal.
Modulation
Applies a frequency to the signal that can be
monitored and evaluated.
Types of noise
! White
Random background.
! Flicker
Changes in response with changing !operation
or conditions.
! Interference
Noise spikes of random occurrence ! and
intensity.
Signal modulation
white
flicker
interference
Signal modulation
Signal modulation
The approach will also eliminate flicker and signal
drift.
modulated source
source
signalbkg
chopper
sample
detector
signalsample
zero
We can look
at the ratio of
background to
sample.
This allows for
the elimination
of drift and
flicker.
Curve fitting
Application of a function that approximates the data.
Common in chromatography and spectral signals.
Curve fitting.
Estimate signal parameters such as
maximum amplitude, area, general shape
Smoothing, deconvolution, differentiation.
Enhance quality of data.
Curve fitting
Curve fitting
RMAX
f(x)MAX give
maximum response.
Integral of f(x) give
area.
XMAX
Peak recognition
width of a single
A/D reading
Peak recognition
The sampling rate must be high
enough so that the number of
points represents the signal
being measured.
Peak recognition
Lets assume that
The sampling rate is high enough to give a
good measure of the peak.
Peak recognition
Start of peak.
We can evaluate the change in our data (first
and second derivative) as a way of detecting
the start of a peak.
1st and 2nd derivative
are still positive
OK - its a peak.
Peak recognition
Peak recognition
Top of peak.
We need to know the point of RMAX.
End of peak.
Essentially the reverse of detecting the start
of a peak.
positive
slope
negative
slope
Peak recognition
Peak area
Determined by summing responses over the
determined peak region. The baseline is typically
estimated and subtracted.
Other integration options are usually available to
improve the fit of the model.
! Examples
! peak width
tangent skimming
! threshold
non-peak baseline shifts.
Data smoothing
These methods can be used to remove small variations
in your data.
It can actually enhance larger ones. If overused, it can
trash all of your data.
Boxcar averaging
Moving window
Golay smoothing
Least-squares polynomial smooth
Fourier transform smooth
Signal differentiation
box c
5000
Boxcar averaging
3 point boxcar
4500
4000
3500
3000
2500
This approach
is very useful
for GC/MS
2000
1500
1000
500
0
0
20
40
60
80
100
Page 1
Moving window
Moving window
Pick a number of points and calculate
an average.
Store the value on a new array.
Move over one point and repeat the
process.
You lose the first and last points for a
three point smooth but the resolution of
your data is maintained.
Windows
7
1
2
5
3
10
8
11
9
12
moving c
5000
4500
Moving window
average
7 pt
5 pt
3 pt
4000
3500
3000
Golay smooth
Similar to a moving window smooth but
applies Gaussian weight to the points.
Response
3 point
Method
assumes that each point is actually
5 point
7point
the
center of a Gaussian peak.
2500
2000
1500
1000
500
0
0
20
40
60
80
100
120
140
120
golay c
4500
Golay smooth
weights
100
60
20
1
4000
3500
3000
2500
2000
1500
1000
XNEW =
500
0
0
20
40
60
80
100
Page 1
Smoothing noise.
Boxcar
Reduced
white and
spike
noise.
Raw!
boxcar+5!
Poly.(boxcar+5)!
Moving window.
Again, some improvement in white and spike.
Golay
Did the poorest job on spikes but they approximated peaks.
120
Unprocessed spectrum
1.8
1.6
1.4
1.2
0.8
0.6
0.4
0.2
0
2
10
12
14
16
Moving average.
3
1.6
1.4
2.5
1.8
1.2
1.6
1.4
0.8
Absorbance
3 point
5 point
7 point
1.2
1.5
0.6
0.4
0.8
0.2
0.6
0
2
0.4
12
10
14
0.5
16
0.2
0
2
0
2
10
12
14
16
10
14
16
1.8
7-point Golay
12
1.6
2.5
1.4
1.2
2.5
1
1.5
0.8
0.6
0.4
0.5
0.2
0
6.5
7.5
8.5
9.5
10
6.5
7.5
1.5
2.5
1.5
0.5
0.5
0
2
10
12
14
16
0
6
6.5
7.5
8.5
9.5
10
8.5
9.5
10
Signal differentiation
IR example again.
1.8
1.6
1.4
1.2
1
0.8
0.6
0.4
2
0.2
1.8
0
9
9.1
9.2
9.3
9.4
9.5
9.6
9.7
9.8
1.6
9.9
10
9.1
1.4
dR
dx
d2R
d2x
1.2
1
0.8
0.6
0.4
0.2
0
9.2
9.3
9.4
9.5
9.6
9.7
9.8
9.9
10
10.1