Professional Documents
Culture Documents
Chng 1
PHP BIN I WAVELET
1.1- M U
Nh trnh by phn m u, giai on phn tch nh lng ng vai tr
quan trng trong vic phn tch ti liu t nn c nhiu phng php c a
ra. V cc phng php truyn thng, c th lit k mt s phng php tiu biu
nh phng php na dc cc i ca tip tuyn ca Peters, L.J., (1949) [60];
phng php xc nh v tr v su ca Werner, S., (1953) [79], phng php s
dng cc i ng cong ca Smith, R.A., (1959) [68], phng php s dng hnh
dng th v bin ca Parasnis, D.S., (1986) [59] T thp nin 60 ca th k
trc, my tnh pht trin mnh, ngi ta thng s dng phng php th - sai
gm phng php tin (forward method) v phng php nghch o (inverse
method) xc nh li gii bng my tnh; phng php ny c s dng rng
ri v pht trin cho n nay. Ngy nay, ngi ta thng s dng phng php tn
hiu gii tch (Nabighian, N.M., (1972, 1974) [55], [56], Hsu, S.K., Sibuet, J.C. v
Shyu, C.T., (1996) [41]) v phng php gii chp Euler (Thomson, D.T., (1982)
[72]; Reid, A.B. v nnk., (1990) [63] ); c hai phng php ny u t c s trn
vic tnh o hm theo phng ngang v phng thng ng ca tn hiu; hin nay,
hai phng php ny vn ang tip tc pht trin.
Nm 1958, Dean, W.C., [27] ngh s dng php bin i Fourier trong
bi ton chuyn trng v php tnh o hm trong phn tch ti liu t v trng
lc. Nm 1964, Cooley, J.W. v Turkey, J., [23] a ra thut ton php bin i
Fourier nhanh (Fast Forier Transform). T , php bin i Fourier c s dng
hu hiu v rng ri trong vic phn tch nh tnh v nh lng ti liu t (v
trng lc) [19], [69] v chng c pht trin cho ti nay [80]. Tuy nhin, php
bin i Fourier c nhng im hn ch ca n (s trnh by trong mc tip theo)
nn ngi ta tm nhng php bin i khc c nhiu u im hn. Ngy nay, ngi
ta s dng php bin i wavelet v n khc phc c cc khuyt im ca php
bin i Fourier. C hai php bin i wavelet l php bin i wavelet ri rc v
php bin i wavelet lin tc; chng c s dng trong vic phn tch nh tnh
[5], [64] v phn tch nh lng ti liu t [18], [32], [66].
Trong lun n ny, chng ti s dng php bin i wavelet lin tc; tuy
nhin, c ci nhn y v php bin i wavelet, trong chng ny chng ti
trnh by cc phn c bn ca php bin i wavelet lin tc v php bin i
wavelet ri rc.
f(t)
(s)
F()
(Hz)
wavelet lin tc p dng trong vic phn tch nh lng ti liu t c trnh by
trong chng hai.
1
s
f ( x ).
*
0
xb
)dx
s
(1.1)
trong :
-
phn tch.
Phng trnh (1.1) cho thy, php bin i wavelet l mt nh x chuyn t
hm mt bin f(x) thnh hm W(s, b) ph thuc hai bin s l bin t l s v bin
dch chuyn b. H s chun ha 1 /( s ) trong (1.1) m bo cho s chun ha sng
wavelet vi cc t l phn tch s khc nhau 0(s, b) = 0 .
Php bin i wavelet c tnh linh ng cao so vi php bin i Fourier (s
dng duy nht hm m) v khng nht thit phi s dng mt hm wavelet c nh,
m c th la chn cc hm wavelet khc nhau trong h hm wavelet sao cho thch
hp vi bi ton (hnh dng ca hm wavelet ph hp vi tn hiu cn phn tch)
kt qu phn tch l tt nht. Hin nay, ngi ta xy dng c khong vi chc
cc h hm wavelet khc nhau nhm p dng cho nhiu mc ch phn tch a
dng. Hnh 1.2 th ca ba hm wavelet l hm wavelet Harr, hm wavelet
Daubechies 5 v hm wavelet Morlet.
Biu thc (1.1) c th vit li di dng tch trong (inner product) nh sau:
W (s, b) = f ( x ), 0 (s ,b ) ( x )
trong :
(1.2)
0(s , b ) ( x ) =
xb
0
s s
a)
b)
(1.3)
c)
0 ( y ) dy = 0
(1.4)
xb
) trong mt vng khng gian gii hn c qui
s
10
E=
f (x) 2 dx = f (x)
(1.5)
0 ( y ) dy = 1
(1.6)
11
f (x) =
1
cg
xb
1
db 0 sW(s, b) 0 ( s )ds
(1.7)
trong :
- cg l hng s ph thuc vo hm wavelet c s dng.
Cng thc (1.7) cho php khi phc li tn hiu nguyn thy t cc h s
bin i wavelet bng php tnh tch phn theo ton b cc tham s t l s v dch
12
chuyn b. Trong (1.7), hm wavelet 0 c s dng thay cho hm lin hip phc
ca n trong biu thc (1.1).
Trong thc t, vic khi phc chnh xc tn hiu gc t php bin i wavelet
gp kh khn (khng ging nh vic khi phc tn hiu t php bin i Fourier).
Theo Vecsey, L., (2002) [78] vic khi phc tn hiu gc t php bin i wavelet
s cho kt qu chnh xc khi phng trnh sau y c tha:
1/ 2
+
()
c g = 2
d
<
(1.8)
trong :
- () l bin i Fourier ca hm ( x )
1
R B
W (s, B) = f (R ). *0 (
)dR
s
s
(1.9)
trong :
- R(x1, x2) l vct ta gm hai thnh phn l x1 v x2 tha h thc:
R 2 = x 12 + x 22
- B (b1, b2) l vct v tr, c hai thnh phn tha h thc: B 2 = b12 + b 22 .
H s (1/s) chun ha nng lng ca sng wavelet 2-D, c suy ra t
trng hp 1-D. Tn hiu f(R) l hm theo hai bin khng gian l x1 v x2.
Php bin i wavelet nghch 2-D c vit di dng:
1
f (R ) =
cg
dB s
W(s, B) 0 (
RB
)ds
s
(1.10)
So vi biu thc bin i wavelet nghch 1-D cho bi (1.7), biu thc (1.10)
xut hin s hng (1/s3) thay cho s hng (1/s) do nguyn nhn co gin v dch
chuyn ca hm wavelet trong php bin i 2-D:
13
1
RB
0 ( s ,B) ( R ) = 0 (
)
s
s
(1.11)
(1.12)
0 ( s ,B) (R ) =
1
s
( n / 2)
0 (
R B
)
s
(1.13)
1
s
( n / 2)
f (R). (
*
0
R B
)dR
s
(1.14)
1
cg
dB
W(s, B). 0 (
n +1
RB
)ds
s
(1.15)
14
1.2
1.5
1.2
1
1
0.8
1.5
0.8
0.6
0.6
1
0.4
0.5
0.4
0.5
0.2
0.5
0.2
0
0
-0.2
-0.2
-0.4
-0.4
-0.5
-0.5
-0.5
-0.6
-0.6
-1
-0.8
-0.8
0
0.5
1.5
2.5
3.5
4.5
a) Coif-1
b) Coif-2
10
11
10
12
c) Coif-3
14
16
10
d) Coif-4
15
20
10
15
20
25
e) Coif-5
(1.16)
15
f (x) =
1
1
. exp( x 2 ), g(x ) = 4 . exp(ix x 2 )
(1.17)
16
1
3
(a)
S=1
S=2
S=3
3
(b)
S=1
S=2
S=3
Tn s
Ta x
Tn hiu f(x)
(m)
(m)
b)
a)
(m)
(m)
Hnh 1.7a: Hnh trn l tn hiu f(x), hnh di l bin i wavelet ca tn hiu
s dng hm wavelet l o hm bc nht ca hm Gauss
Hnh 1.7b: Hnh trn l tn hiu f(x), hnh di l bin i wavelet ca tn hiu
s dng hm wavelet l o hm bc hai ca hm Gauss
17
f ( x )dx = 0
(1.18)
S dng wavelet ng hng thun tin khi phn tch cc cu trc c kch
thc gn bng nhau theo hai hng nh vt th hnh trn, hnh vung Hm
wavelet bt ng hng thng s dng phn tch nhng cu trc bt i xng
v khi cc tham s t l s gp phn thit lp mi tng quan v kch thc trung
bnh gia ln theo phng x v ln theo phng y.
(1.19)
18
l ca W(s, b) hoc
cg
1
cg
+ +
W (s , b )
ds
db
s2
(1.20)
1
cg
W (s, b )
(1.21)
db
E=
E (s )
ds
s2
(1.22)
1
s
* (
nb
)
s
(1.23)
19
nb
)
s
(1.24)
20
a)
b)
c)
d)
Bt u on
tn hiu
Kt thc on
tn hiu
21
x
Bt u
tn hiu
Kt thc
tn hiu
Tn
chocho
gim
dn n
Tnhiu
hiu
gim
dnkhng
Bt u
tn hiu
Kt thc
tn hiu
Lp li tn hiu
22
Lp li tn
hiu i xng
x
Bt u
tn hiu
Kt thc
tn hiu
Ca s lm
trn
Cho tn hiu
bng khng
Tn hiu gc
Tn hiu
b sung
Cho tn hiu
bng khng
x
Bt u
tn hiu
Kt thc
tn hiu
Tn hiu c
ngoi suy
Tn hiu c
ngoi suy
x
Bt u
tn hiu
Kt thc
tn hiu
23
ha hnh thp (pyramidal coding). Nm 1989, Mallat, S., [49] a ra k thut phn
tch a phn gii (multiresolution analysis) trn c s m ha hnh thp v xut
cc h hm wavelet trc giao p dng trong x l tn hiu s.
Trong phn tch ti liu t (v trng lc), php bin i wavelet ri rc c
s dng trong vic lc nhiu ti liu t hng khng (Ridsdill Smith, T.A. v
Dentith, M.C., (1999) [64]) v tch trng khu vc v trng a phng t trng
quan st (Fedi, M., Quarta, T., (1998), [30], Ucan, O.N., v nnk., (2000) [75]).
Vit Nam, ng Vn Lit v nnk., (2002) [5], (2005) [1] s dng php bin i
wavelet ri rc lc nhiu v tch trng khu vc v trng a phng. Ngoi ra,
cn c nhiu nhm nghin cu khc s dng php bin i wavelet ri rc trong cc
lnh vc khc nh vin thng, in t, y hc
Do chng ti khng s dng php bin i wavelet ri rc trong lun n nn
trong phn tip theo, chng ti ch gii thiu tm lc php bin i wavelet ri
rc, c bit l k thut a phn gii, mt k thut thng c s dng trong vic
phn tch ti liu t lc nhiu v tch trng.
24
( x ) = c K . ( 2x k )
(1.25)
k =0
(x) =
N 1
( 1)
k =0
c K . ( 2 x + k N + 1)
(1.26)
Php ly mu xung 2
Bin i wavelet
ri rc tng mt
Bin i wavelet
ri rc tng hai
25
(1.27)
(1.28)
(1.29)
(y
high
(1.30)
26
thng cao (tng t trng hp 1-D), php bin i wavelet 2-D c tnh c th
nh sau:
(1) ( x , y) = ( x ). ( y) : HH
(1.31)
( 2 ) ( x , y) = ( x ). ( y) : HG
(1.32)
( 3) ( x , y) = ( x ). ( y) : GH
(1.33)
( 4 ) ( x , y) = ( x ). ( y) : GG.
(1.34)
G
G
Ti to
2-D
Tn hiu
2-D
Tn hiu
mi hng
1-D
Ti to
2-D
G
G
G
G
s1
s2
s3
s4
27
1.4- KT LUN
Hn hai mi nm qua, php bin i wavelet c p dng v pht trin
mnh m gp phn quan trng trong vic phn tch ti liu nhiu lnh vc khc
nhau trong c vic phn tch ti liu t (v trng lc). Trong chng ny, chng
ti trnh by tng qut v l thuyt c bn ca php bin i wavelet lin tc v
vic tnh ton hn ch tc ng ca hiu ng bin. Ngoi ra, chng ti cng trnh
by tm lc v php bin i wavelet ri rc v cc ng dng ca n tch
trng v lc nhiu trong phn tch ti liu t v trng lc.