Professional Documents
Culture Documents
7
H A P T E R
(1) yi = xi + zi
FIGURE 1. Overall approach for signal analysis where i = 0, 1, , n1; subscript i is the
in nondestructive testing. time index of the signal; n is the length of
the time sequence; xi is the desired signal;
and zi represents conventional white
Raw signal noise (indicating that the noise is
uncorrelated1,2) with standard deviation
. The discrete wavelet transform
Preprocessing
decomposes a signal y into a weighted
Enhancement sum of basis functions v,k:
Restoration
(2) y(n ) = c
v k
v ,k v ,k (n)
Feature extraction
Characterization and
v v
discontinuity profiling Discontinuity sizing (3) v,k (n) = 2 2 2 2 (n k )
Model based and profiling
System based
+ 2 E (ni ) ( si yi )
FIGURE 2. Eddy current signals: (a) raw signal; (b) wavelet
denoised signal. If ni is uncorrelated with si and yi the last
(a) term reduces to zero:
E (ni ) ( si yi )
60
(8) = 0
Amplitude (mV)
50
40
and:
30
20
10 FIGURE 3. Overall schematic diagram of adaptive noise
0 20 40 60 80 100 120 cancellation.
Scan position (arbitrary unit)
Reference
(b) signal di
20
Amplitude (mV)
15
10 +
5 Input Adaptive filter yi
0 H(z) Output yi
signal ui
5
10
15 Error signal i
0 20 40 60 80 100 120
FIGURE 4. Results obtained from application of adaptive noise cancellation algorithm: (a) raw
magnetic flux leakage data; (b) output after noise cancellation.
(a)
20 (0.8)
Specimen width,
40 (1.6)
mm (in.)
60 (2.4)
80 (3.0)
100 (3.6)
2 4 6 8 10 12
(b)
20 (0.8)
Specimen width,
40 (1.6)
mm (in.)
60 (2.4)
80 (3.0)
100 (3.6)
2 4 6 8 10 12
for 1 k N 1. H (f )
To get rid of the low frequency trends, (15) H (f ) =
H (f )
2
the low frequency coefficients in the + Q
transformed signal B(k) are set to zero and
the signal is reconstructed. This technique
results in removing the low frequency where H(f ) is the complex conjugate of
trends and the mean without affecting the H(f ) and Q is related to the ratio of signal
phase information, crucial in eddy current to noise. Wiener filters6 use a constrained
signals. Figure 5 shows the results of least squares minimization procedure to
discrete cosine transform based estimate x(t) from the measurement y(t).
detrending of the eddy current signal in Although this technique is well
Fig. 2a. established, it requires knowledge of H(f ).
In cases where the distortion kernel H(f )
is not available, blind deconvolution
algorithms can be used as described
Deconvolution below.
A second source of distortion is the
blurring of a signal because of the point Blind Deconvolution
spread function or impulse response of Blind deconvolution techniques are
the transducer. Deconvolution techniques particularly attractive because they do not
can be used to eliminate transducer require specification of the distortion
responses from signals and thereby kernel. These algorithms iteratively
estimate the true response. One of the estimate the kernel (in this case the point
most popular restoration techniques uses spread function of the probe) from the
the wiener filter. available data. Another advantage
associated with blind deconvolution
Wiener Filtering algorithms is the ease with which
constraints can be added. This property
The wiener filter models the measured
can be used to constrain the size of the
signal y(t) as the output of a linear time
kernel based on the size of the probe
invariant system corrupted by noise n(t):6
used. The blind deconvolution technique
based on the richardson-lucy algorithm7
uses maximum likelihood principles and
obtains high quality reconstructed images
FIGURE 5. Eddy current signal after detrending of signal in even in the presence of noise. Consider
Fig. 2a. the experimental (convolved) eddy
20
current image data c(x,y) obtained using a
Amplitude (mV)
(16) ( )
P xy =
( )
P y x P ( x)
P (y x) P (x) dx
Scan position (arbitrary unit)
where i is the iteration number. All FIGURE 6. Images from pancake coil probes: (a) true image;
quantities in Eq. 17 are two-dimensional (b) gaussian point spread function kernel; (c) measured,
and depend on two spatial variables m convolved image; (d) result of blind deconvolution.
and n. Given the point spread function
g(m,n) and an initial guess of the original (a) (b) (c) (d)
image f(m,n), the reconstructed image can
be obtained by iteratively applying Eq. 17
until convergence.
The inverse iterative equation, derived
by reversing the role of the reconstructed
image and the point spread function in
Eq. 17, is given by:
c (m, n)
(18) g i +1(m, n) =
g i (m, n) f (m,n)
k 1 FIGURE 7. Eddy current test with two closely
spaced discontinuities: (a) raw image;
}
f ( m, n) g i (m, n) (b) result of blind deconvolution algorithm.
(a) (b)
The inverse iterative equation is also
referred to as a richardson-lucy operation.
The blind deconvolution algorithm
consists of a two-step procedure. At the
kth iteration, the point spread function
g k(y,x) is calculated from Eq. 19 by
performing a specific number of
richardson-lucy operations, given the
knowledge of the reconstructed image
f k1(m,n) obtained from Eq. 20 after the
(k1)th iteration:
c (m, n)
(19) g ik+1(m, n) =
g i (m, n) f (m,n)
k k 1
}
f k 1( m, n) g ik (m, n)
Signal classification techniques often rely cosine transform coefficients8 and scale
on pattern recognition for interpreting based features such as discrete wavelet
nondestructive test data. Pattern transform coefficients,9 principal
recognition techniques help to classify components10 and linear predictive
signals into one of a known set of classes. coding coefficients.11 These feature
Such techniques may be used, for extraction schemes are described below.
example, to discriminate between
multiple types of discontinuities or
between discontinuities and benign
Discrete Fourier Transform
sources. In the case of steam generator One of the earliest and simplest
tube tests, for example, such techniques techniques used for feature extraction is
could be used to distinguish eddy current the discrete fourier transform. The discrete
signals from those caused by cracks, tube fourier transform of a signal x(n) can be
supports and antivibration bars. The expressed as the weighted sum of complex
parameters of the classifier are generally exponential basis functions. For a series
determined by using a data bank of x(n) with N samples, the discrete fourier
signals from expected discontinuity types. transform is expressed as:
The collection of signals, referred to as the
training database, is used for training the
jn 2
X (k ) x(n) e
1
classification algorithm. Most (21) = N
classification techniques use a two-step N
n
procedure.
1. In feature extraction, characteristic where k = 0, 1, , N1.
features in the signal that carry For smooth signals, the magnitude of
discriminatory information are the coefficients can be shown to decay at
identified and extracted. These the rate of n 2 with the result that the
features serve as a compact signature energy can be compacted in very few
of the signal. discrete fourier transform coefficients.
2. The feature vector is classified by using Magnitudes of the discrete fourier
a standard pattern classification transform coefficients are the simplest
technique such as a clustering and most commonly used feature vector
algorithm or a neural network. for representing signals for classification.
[ ]
c (k )
2
(24) = (26) v ,k (n) = 2 2 2 k (n k )
N
x[n]
g[n] h[n]
2 2
1
DWTlow = h[k] x[2n k]
k
1
DWThigh = g [k] x[2n k]
k
g[n] h[n]
Level 1 DWT
Coefficients 2 2
Level 2 DWT
Coefficients g[n] h[n]
2 2
Level 3 DWT
Coefficients
Legend
DWT = discrete wavelet transform
g = high pass function
h = low pass function
k = iteration number
n = number of points in signal
x = data vector
i = E ( x mi ) ( x mi ) | C = Ci K Means Clustering
T
(34)
Clustering algorithms treat a feature
vector as a point in the N-dimensional
Then Sw can be defined: feature space.16 Feature vectors from a
similar class of signals then form a cluster
M in the feature space. The most popular of
P (C )
1 the clustering algorithms is the K means
(35) Sw = i i
M clustering algorithm, which uses an
i =1
iterative procedure that classifies each
and: input signal into one of K classes.
M
Synaptic weights
Output
Input
Neurons
f ( x) =
1
1 + e x
Compute error
1 2
= dy
2
Yes
< ?
No No
Update weight
output
j = ( )( )
y 1 y j dj y j End of training
data?
hidden
j = xj (1 xj ) k w j,k
k Nodes in layers Yes
above node j
[
+ wij (t ) wij (t 1) ]
Legend
d = output at node j
t = time
w = weighting factor
x = input signal
y = network output at node j
= momentum parameter
= variable defined by equation
= learning parameter
= preset threshold value for error
(44) S = { sij }M Q N
(46) f ( x) = w ( x c )
i =1
i i i
NL
(49) f ( x) = s
j =1
L L
j j ( x)
1 Nk
L
+ d
k =1 j =1
k k
j j ( x)
Legend
L = scale index (superscript)
x = input to network where d jk denotes the corresponding
f(x) = function output
= scaling function
expansion coefficients; f(x), the mapping
= wavelet basis function function to be estimated; sjL, the scaling
coefficients; jk (x), the wavelet basis
functions generated via translations and
FIGURE 12. Neural network characterization of magnetic flux leakage signal from 75 mm (3 in.) long and 75 mm (3 in.) wide
discontinuity: (a) magnetic flux leakage signal; (b) discontinuity profile; (c) prediction using radial basis function network;
(d) prediction using wavelet basis function network.21
(a) (c)
Magnetic flux density, 1 (kG)
1.0 (10)
0)
0.5 (5)
Depth, mm (in.)
1.3 (0.05)
0
2.5 (0.10)
0.5 (5)
3.8 (0.15)
1.0 (10)
50 5.0 (0.20)
40 300
30 150 (6)
200 150 (6)
20 100 (4)
10 100
Circumferential 100 (4)
0 0 50 (2) 50 (2)
scan positions Axial scan positions
(arbitrary unit) (arbitrary unit) Width, mm (in.) 0 0
Length, mm (in.)
(b) (d)
0.1
0)
Normalized depth
Depth, mm (in.)
1.3 (0.05) 0
(ratio)
2.5 (0.10)
0.1
3.8 (0.15)
5.0 (0.20)
0.2
150 (6) 150 (6)
150 (6) 150 (6)
100 (4) 100 (4)
100 (4)
100 (4)
50 (2) 50 (2) 50 (2)
Width, mm (in.) 50 (2)
0 0 Width, mm (in.) 0 0
Length, mm (in.) Length, mm (in.)
Summary
Advances in digital processing have made
sophisticated signal and image processing
techniques available for practical
applications in nondestructive testing.
When integrated in software programs for
discontinuity classification, signal
processing algorithms make possible the
automation of diagnostic procedures and
quality assurance protocols.
Bibliography
McClelland, J.L. and D.E. Rumelhart.
Explorations in Parallel Distributed
Processing. Cambridge, MA: MIT Press
(1988).
Stanley, W.D. Digital Signal Processing.
Reston, VA: Reston Publishing (1975).
Strauts, E.J. Section 11, Electronic
Analysis Circuits for Eddy Current
Tests. Nondestructive Testing Handbook,
second edition: Vol. 4, Electromagnetic
Testing. Columbus, OH: American
Society for Nondestructive Testing
(1986): p 265-314.