Professional Documents
Culture Documents
VIN THNG
IT
BI GING MN HC
X L NH
Ngi son : PGS. TS. NNG TON
LI NI U
IT
tin Hc vin Cng ngh BCVT, Ban Gim c Hc vin Cng ngh BCVT h tr v
to iu kin cho ra i gio trnh ny.
Mc d rt c gng nhng ti liu ny chc chn khng trnh khi nhng sai st.
Chng ti xin trn trng tip thu tt c nhng kin ng gp ca bn c cng nh cc
bn ng nghip c chnh l kp thi.
Th gp xin gi v:
Nng Ton,
Vin Cng ngh thng tin.
18 Hong Quc Vit, Cu Giy, H Ni
in thoi: 04.3.7567935
Email: dntoan@ioit.ac.vn
H Ni, ngy 28 thng 06 nm 2010
IT
TC GI
MC LC
LI NI U .............................................................................................................................................................................. 2
Chng 1: NHP MN X L NH ....................................................................................................................7
1.1. TNG QUAN V H THNG X L NH ............................................................................................ 7
1.2. NHNG VN C BN TRONG X L NH ............................................................................. 8
1.2.1. Mt s khi nim c bn ..................................................................................................................................8
1.2.2. Nn chnh bin dng............................................................................................................................................8
1.2.3. Kh nhiu ...................................................................................................................................................................8
1.2.4. Chnh s mc xm ................................................................................................................................................9
1.2.5. Phn tch nh ............................................................................................................................................................ 9
1.2.6. Nhn dng v phn loi nh........................................................................................................................... 9
1.2.7. Nn nh...................................................................................................................................................................... 10
Chng 2: THU NHN NH ...................................................................................................................................... 11
2.1. CC THIT B THU NHN NH .................................................................................................................. 11
IT
IT
IT
Chng 1:
NHP MN X L NH
nh
X L NH
IT
Kt lun
Hnh 1.1. Qu trnh x l nh
Thu nhn nh
(Scanner,
Camera,Sensor)
Tin x l
Trch chn
c im
H quyt nh
i snh rt
ra kt lun
Hu
x l
Lu tr
Khi trich chn c im: c nhim v trch chn cc c trng quan trng ca
cc bc nh c tin x l s dng trong h quyt nh
Chng 1: Nhp mn x l nh
nh mong mun
nh thu nhn
IT
Pi
f ( Pi ) Pi '
min
i 1
Chng 1: Nhp mn x l nh
1.2.4. Chnh s mc xm
Chnh s mc xm l nhm khc phc tnh khng ng u ca h thng x l nh,
thng thng c 2 hng tip cn:
IT
Vic trch chn hiu qu cc c im gip cho vic nhn dng cc i tng nh
chnh xc, vi tc tnh ton cao v gim thiu dung lng lu tr.
1.2.6. Nhn dng v phn loi nh
Nhn dng t ng (automatic recognition), m t i tng, phn loi v phn
nhm cc mu l nhng vn quan trng trong th gic my, c ng dng trong nhiu
ngnh khoa hc khc nhau. Tuy nhin, mt cu hi t ra l: mu (pattern) l g?
Watanabe, mt trong nhng ngi i u trong lnh vc ny nh ngha: Ngc li vi
hn lon (chaos), mu l mt thc th (entity), c xc nh mt cch ang ng (vaguely
defined) v c th gn cho n mt tn gi no . V d mu c th l nh ca vn tay,
nh ca mt vt no c chp, mt ch vit, khun mt ngi hoc mt k tn hiu
ting ni. Khi bit mt mu no , nhn dng hoc phn loi mu c th s dng
hai cch chnh:
Chng 1: Nhp mn x l nh
C nhiu cch tip cn khc nhau trong l thuyt nhn dng trong c: i snh
mu da trn cc c trng c trch chn, phn loi thng k, i snh cu trc, phn
loi da trn mng n-ron nhn to...
H thng nhn dng t ng bao gm ba khu tng ng vi ba giai on ch yu
sau y:
1. Thu nhn d liu v tin x l.
2. Biu din d liu.
3. Nhn dng, ra quyt nh.
Trong ng dng thc tin, khng th ch dng c mt cch tip cn n l phn
loi ti u v vy cc phng thc phn loi t hp thng c s dng khi nhn dng.
Cho n nay cc h thng lai (hybrid system) s dng nhiu phng php v cch tip cn
khc nhau cho nhng kt qu nhiu trin vng.
1.2.7. Nn nh
Nn nh l k thut nhm gim thiu khng gian lu tr. C hai hng tip cn
chnh l nn c bo ton v khng bo ton thng tin. Nn khng bo ton th thng c
kh nng nn cao hn nhng khng phc hi c nh gc, ngc li nn c bo ton cho
php khi phc hon ton nh gc. Nn nh ni chung c 4 cch tip cn c bn:
Nn nh thng k: K thut nn ny da vo vic thng k tn xut xut hin
ca gi tr cc im nh, trn c s m c chin lc m ha thch hp. Mt v
d in hnh cho k thut m ha ny l *.TIF
IT
10
Chng 2:
THU NHN NH
nh
cha
tn hiu
quang
hc
IT
2.2. LY MU V LNG T HO
2.2.1. Giai on ly mu
Ngi ta s dng b cm bin hoc my qut bin tn hiu quang ca nh thnh
tn hiu in lin tc. Phng php s dng my qut ph bin hn. My qut s qut theo
chiu ngang to ra tn hiu in ca nh, kt qu cho ra mt tn hiu in hai chiu
I(x,y) lin tc.
Dng tn hiu nh
fx 2fxmax vi fx =
1
l tn s ly mu theo trc x.
x
fy 2fymax vi fy =
1
l tn s ly mu theo trc y.
y
11
2.2.2. Lng t ha
nh sau khi ly mu s c dng I(m,n) vi m, n l nguyn nhng gi tr I(m, n) vn
l gi tr vt l lin tc. Qu trnh bin i gi tr I(m,n) thnh mt s nguyn thch hp
lu tr gi l lng t ho. y l qu trnh nh x mt bin lin tc u vo bin ri rc u*
thuc tp hu hn [u1, u2,..uL] xc nh trc, L l mc lng t ho c to ra.
V d:
Tit kim b nh
IT
DIB
Ca s
Thay i
12
Vector
ha
VECTOR
Raster
ha
RASTER
IT
2.4. CC NH DNG NH C BN
Hin nay trn th gii c trn 50 khun dng nh thng dng. Sau y l mt s nh
dng nh hay dng trong qu trnh x l nh hin nay.
2.4.1. nh dng nh IMG
nh IMG l nh en trng, phn u ca nh IMG c 16 byte cha cc thng tin:
6 byte u: dng nh du nh dng nh. Gi tr ca 6 byte ny vit di
dng Hexa: 0x0001 0x0008 0x0001
Loi 1: Gi cc dng ging nhau. Quy cch gi tin ny nh sau: 0x00 0x00
0xFF Count. Ba byte u tin cho bit s cc dy ging nhau, byte cui cho bit
s cc dng ging nhau.
13
IT
1 word: s im nh.
1 word.
48 byte: chia n thnh 16 nhm, mi nhm 3 byte. Mi nhm ny cha thng tin
v mt thanh ghi mu. Nh vy ta c 16 thanh ghi mu.
14
IT
15
D liu cha trong tp thng c t chc thnh cc nhm dng (ct) qut ca d
liu nh. Cch t chc ny lm gim b nh cn thit cho vic c tp. Vic gii nn c
thc hin theo 4 kiu khc nhau c lu tr trong byte du hiu nn.
2.4.4. nh dng file nh BITMAP
Mi file BITMAP gm u file cha cc thng tin chung v file, u thng tin cha
cc thng tin v nh, mt bng mu v mt mng d liu nh. Khun dng c cho
nh sau:
BITMAPFILEHEADER
bmfh;
BITMAPINFOHEADER
bmih;
RGBQUAD
aColors[];
BYTE
aBitmapBits[];
DWORD
bfSize;
UINT
bfReserved1;
UINT
bfReserved2;
DWORD
bfOffBits;
IT
UINT
} BITMAPFILEHEADER;
LONG
biWidth;
LONG
WORD
DWORD
biHeight;
biPlanes;
WORD
biBitCount;
DWORD
biCompression;
DWORD
biSizeImage;
LONG
biXPelsPerMeter;
LONG
biYPelsPerMeter;
DWORD
biClrUsed;
DWORD
biClrImportant;
} BITMAPINFOHEADER, *LPBITMAPINFOHEADER;
16
biWidth
biHeight
biPlanes
biBitCount
S bit cho mt im nh
biCompression
Kiu nn
biSizeImage
biClrImportant
IT
BYTE
rgbGreen;
BYTE
rgbRed;
BYTE
BYTE
rgbReserved;
} RGBQUAD;
bmiHeader;
RGBQUAD
bmiColors[1];
} BITMAPINFO, *PBITMAPINFO;
2.5. K THUT TI NHN NH
2.5.1 K thut chp nh
Phng php sao chp nh l phng php n gin, gi thnh thp, cht lng cao.
Sau bc chp l k thut phng ti nhm tng cng nh nh mong mun. V d k thut
phng ti nh: phng i nh, thu nh nh, ty theo ng dng. K thut chp nh mn
hnh mu kh n gin. N bao gm cc bc sau:
17
2.5.2 K thut in nh
Ngi ta dng k thut na cng th hin nh trn sch bo, tp ch. Theo k
thut ny, mt nh to nn bi mt chui cc im in trn giy. Thc cht, mi im nh
c th c coi l mt hnh vung trng bao quanh mt chm en. Do vy, nu chm en
cng ln im nh s cng xm mu. Mu xm c th coi nh chm en chim na vng
trng. Vng trng l vng gm mt chm cc im nh c rt t hoc khng c chm en.
T c im cm nhn ca mt ngi, s thay i cng chm en trong cc
phn t nh trng to nn m phng ca mt nh lin tc. Nh vy, mt ngi cm nhn t
mt nh m mu bin i t en qua xm ri n trng. Tng s cng duy nht hin
din s xc nh cc kch thc khc nhau ca chm en. Thng thng, bo nh to nh
na cng vi phn gii t 60 n 80 DPI(dot per inchs: s im nh trn mt inch),
sch c th in n 150 DPI.
IT
a) Phn ngng
K thut ny t ngng hin th cc tng mu lin tc. Cc im trong nh c
so snh vi ngng nh trc. Gi tr ca ngng s quyt nh im c c hin th
hay khng. Do vy nh kt qu s mt i mt s chi tit. C nhiu k thut chn ngng
p dng cho cc i tng khc nhau:
M
mu
Mn hnh mu
en
en
Xm m
Xm nht
Xanh
Trng
Vng
18
10
12
14
11
15
13
IT
c) K thut Dithering
Dithering l vic bin i mt nh a cp xm (nhiu mc sng ti) sang nh nh
phn (hai mc sng ti). K thut Dithering c p dng to ra nh a cp sng khi
phn gii ngun v ch l nh nhau. K thut ny s dng mt ma trn mu gi l ma trn
Dither. Ma trn ny gn ging nh ma trn Rylander.
to nh, mi phn t ca nh gc s c so snh vi phn t tng ng ca ma
trn Dither. Nu ln hn, phn t u ra s sng v ngc li.
d) K thut khuch tn li (Error diffusion)
Khuch tn li cho php gim thiu mc mt chi tit ca nh khi tch ngng
bng cch phn tn li do lng t ha ra cc im nh xung quanh. Bng cch ny tng
gi tr im nh ca mt vng nh c gi tng i gn vi gi tr trn nh gc.
Khuch tn li c hai dng, khuch tn li mt chiu v khuch tn li hai chiu.
Khuch tn li mt chiu ch phn tn li sang im nh ln cn trn cng mt dng trong
khi khuch tn li hai chiu phn tn li sang cc im nh ln cn theo mt t l xc
nh bi mt ma trn khuch tn li.
19
Floyd v Steinberg
IT
20
IT
21
Green
Cyan
Red
Magenta
Blue
Yellow
Black
Blue
White
Red
Cyan
Yellow
Green
IT
Magenta
C 1 R
M 1 G
Y 1 B
Hnh 2.6. S bin i t RGB thnh CMY
2.6.2.3. M hnh mu HSV (Hue, Saturation, Value)
Cc m hnh mu RGB, CMY c th hin th c tt c cc mu cn thit, tuy vy
rt kh khn con ngi c th phi mu trn hai h mu ny. phi mu d dng hn
Smith nh ngha m hnh mu HSV ca hay HSB vi B l Brightness ( sng) hng
ngi s dng da trn c s nn tng trc gic v tng mu, sc v sc thi m thut.
22
o bi gc quanh trc
c ng vi m
mu l 0o, mu lc l
120o, mu lam l 240o. Cc mu b nm v tr i din vi nhng
ng m
mu gc. S ly gi tr
t 0 trn ng
ng trc tm (trc V) n 1 trn
tr cc mt bn ti ca hnh
nh chp su ccnh. S bo
ha c hiu l mc
c ti
t
ca
a mu, cc mu xm t en ti trng c S l 0. Gi tr V
c hiu l sng ca mu,
m V l 0 th l mu en, V l 1 th l mu
u c sng ti a.
Gi m chuyn
n i t RGB sang HSV
IT
Hm RGB_HSV_Conversion
H: Sc mu
u [0-360]
[0
vi mu ti im 0
S: bo
o ha [0-1]
[0
V: Gi tr cng
ng sng [0-1]
[0
Max: Hm ly
y gi tr cc i
Min: Hm ly
y gi tr nh nht
{
//Xc nh
nh gi tr cng
c
sng
V= Max(R,G,B)
//Xc nh
nh bo
b
ha
Temp= Min(R,G,B)
If V=0 than
S= 0
Else
S= (V-Temp)/V
Temp)/V
End
//Xc nh
nh sc mu
m
IF s=0 THEN
H= Undefined
Else
Cr= (V-R)/(V
R)/(V-Temp);
Cg= (V-G)/(V
G)/(V-Temp);
Cb= (V-B)/(V
B)/(V-Temp);
// Mu nm
m trong khong gia vng
vng (Yellow) v
ta (Magenta)
If R=V then
H= Cb-Cg
Cg
23
IT
If H=Undefined then
R= V
B= V
Endif
Else
G= V
If H=360 then
H= 0
Else
H= H/60
endif
I= Floor(H)
F= H-I
M= V*(1-S)
N= V*(1-S*F)
K= V*(1-S*(1-F))
//(R,G,B)=(V,K,M) R= V; C= K; B= M
If I=0 then
(R,G,B)=(V,K,M);
If I=1 then
(R,G,B)=(N,V,M);
If I=2 then
(R,G,B)=(M,V,K);
24
IT
2.6.2.4.
.2.4. M hnh mu HSL
HS
M hnh mu HSL
L tng t nh m hnh HSV nhng thay v bi
biu din tp hp mu
hnh nn su nh
m hnh
h
HSV th HSL biu din cc tp hp mu
u hnh chp i di
dng khng gian hnh tr.
. Sc mu
m H (hue) vn l gc quanh trc
c ng vi m
mu ti gc
o
0 . Chng ta c th xem h mu HSL nh mt s bin dng ca h HSV
HSV.
H: Sc mu
u [0-360]
[0
vi mu ti im 0
S: bo
o ha [0-1]
[0
V: Gi tr cng
ng sng [0-1]
[0
Max: Hm ly
y gi tr cc i
Min: Hm ly
y gi tr nh nht
{
//Xc nh
nh sng
M1= Max(R,G,B)
M2= Min(R,G,B)
L= (M1+M2)
//Xc nh
nh bo
b
ha
If M1=M2 //Trng
//Tr
hp khng mu
S= 0
H= Undefined
Else
If L <= 0.5 then //Trng
//Tr
hp mu
S= (M1-M2)/(M1+M2)
M2)/(M1+M2)
Else
S= (M1-M2)/(2
M2)/(2-M1-M2)
25
IT
Hm HLS_RGB_Conversion()
H: Sc mu [0-360] vi mu ti im 0
S: bo ha [0-1]
{
If L <= 0.5 then
Else
M2= L*(1+S)
M2= L+S-L*S
Endif
M1= 2*L-M2
//Kim tra bo ha = 0
If S=0 then
If H=Undefined
R=L
G=L
B=L
Else //Error: D liu nhp sai
Endif
Else //Xc nh gi tr ca RGB
RGB(H+120, M1,M2,Value)
R= Value
RGB(H, M1,M2,Value)
G= Value
RGB(H-120, M1,M2,Value)
B= Value
26
IT
27
2.7. CU HI N TP CHNG
Cu 1: Th no l m hnh Raster v Vector? Trnh by s ging v khc nhau ca
hai m hnh ny.
Cu 2: Nu cc nh dng nh ph bin. Trnh by cch nn nh ca nh dng anh
BITMAP.
Cu 3: K thut khuch tn li (Error diffusion) l g? Thc hin khuch tn li mt
chiu vi nh sau, c bit ngng l 127.
23 156 22 45
1
I 133 13 12 12 212
12 232 127 32 21
IT
28
Chng 3:
X L NNG CAO CHT LNG NH
h(g)
1
1
IT
I=
29
TB
mn
~ s im nh trung bnh ca mi mc xm ca nh cn bng
new _ level
g
t ( g ) h(i ) ~ s im nh c mc xm g trn nh gc
i 0
t(g)
f ( g ) max 0, round
1
TB
10
11
14
15
17
19
20
1
3
4
Ikq =
IT
I=
nh sau khi thc hin cn bng cha chc l cn bng "l tng ", tuy nhin
chng ta c th thy biu tn sut ca anh sau cn bng ng u hn rt nhiu so nh
gc.
30
1 g
i.h(i) ~ mmen qun tnh TB c mc xm g
t ( g ) i0
m( g )
Hm f: g f (g ) c nh ngha l:
f (g)
t(g)
m( g ) m(G 1)2
mxn t ( g )
IT
f max f ( g )
0 g G 1
0
0
I=
V d: Tm ngng t ng ca nh sau
ih(i)
m(g)
f(g)
h(g) t(g)
g.h(g)
i 0
15
15
1.35
20
0,25
1.66
24
13
0,54
1.54
27
22
0,81
1.10
29
30
1,03
0.49
30
35
1,16
31
h(i) .
i f 1 ( q )
V d:
g
h(g)
g + 1 nu g 2
g
nu g = 3
IT
f(g) =
g 1 nu g > 3
h(q)
q = f(g)
{ , + },
{ , + }})
32
I T ( x, y )
i 0
m 1
Hoc
I T ( x, y)
i 0
n 1
I x i, y j * T i, j
(3.1)
j 0
n 1
I x i, y j *T i, j
(3.2)
j 0
T=
I=
IT
V d:
I T ( x, y )
i 0
I x, y I x 1, y 1
IT=
10
12
12
12
33
IT=
10
12
12
12
Trong qu trnh thc hin php nhn chp c mt s thao tc ra ngoi nh, nh khng
c xc nh ti nhng v tr dn n nh thu c c kch thc nh hn.
nh thc hin theo cng thc 3.1 v 3.2 ch sai khc nhau 1 php dch chuyn
n gin ta s hiu php nhn chp l theo cng thc 3.1
T1 =
IT
31
V d 1:
55
65
45
46
52
58
34
35
I T1 = 29
27
35
35
I=
Ikq =
28
38
18
19
25
31
34
T2 =
-1
-1
-1
-1
-14
-22
14
16
-1
-6
-10
-2
I T2 =
+ Nu n l x 1
2
* Mnh 3.1
n
i
+ Nu n chn: x hoc
2
xx
x 1
2
IT
3.2.3. Lc trung v
* nh ngha 3.1 (Trung v)
Cho dy x1; x2...; xn n iu tng (gim). Khi trung v ca dy k hiu l
Med(xn), c nh ngha:
min ti Med xn
i 1
n
2
Ta c:
n
i 1
x x i x xi x x M i
i 1
i 1
i 1
i 1
x xi x M i x x M i xi
M
x M 1 x M x M xi
i 1
35
i 1
i 1
x M i Med xi xi Med xi
n
xi Med xi
i 1
Nu n l:
B sung thm phn t Med xi vo dy. Theo trng hp n chn ta c:
n
xx
i 1
n
xx
min ti Med({xn})
i 1
* K thut lc trung v
Gi s ta c nh I ngng ca s W(P) v im nh P
Khi k thut lc trung v ph thuc khng gian bao gm cc bc c bn sau:
+ Bc 1: Tm trung v
IT
V d:
I=
I ( P) Med ( P)
I ( P)
I ( P)
Med ( P) I ( P) Med ( P)
16
vi ca s W(3 3) v = 2
Ikq =
36
1 n
AV x n round xi
n i 1
* Mnh 3.2
2
x x
i
min ti AV xn
i 1
t:
( x ) x x i 2
i 1
Ta c:
n
( x ) 2 x x i
' ( x) 0
n
x x 0
i
i 1
1 n
xi AV xi
n i 1
IT
i 1
Mt khc,
''
( x ) 2n 0
min
ti
x AV xi
I ( P) AV ( P)
I ( P)
I ( P)
AV ( P) I ( P) AV ( P)
37
V d:
I=
16
vi ca s W(3 3) v = 2
Ikq =
IT
+ Bc 1: Tm K gi tr gn nht
I(q) q W(p) k gi tr gn I(P) nht
+ Bc 2: Tnh trung bnh
V d:
I=
I ( P) AVk ( P)
I ( P)
I ( P)
AVk ( P) I ( P) AVk ( P)
16
vi ca s W(3 3), = 2 v k = 3
Ikq =
38
Tn hiu
nhiu (x,y)
IT
nh gc
g(x,y)
H thng thu
nhn nh H
Tn hiu nh
g(x,y)
M hnh ri rc:
Trn c s m hnh nhiu lin tc, ta c th xy dng mt m hnh nhiu ri rc
tng ng vi nh s. Khi g(x,y) s chuyn thnh nh ri rc g[m,n], nh lin tc
g(x,y) s chuyn thnh ma trn im nh g[m,n] v nhiu cng phn b ri rc ti cc
im nh [m,n]. Gi s H l hm tuyn tnh bt bin trong phm vi MN (kch thc
nh) th ta c:
k l
(3.3)
39
h(m,n)
g(m,n)
h-1(m,n)
g*(m,n)
IT
G ' [u, v]
H [u, v]
(3.5)
G ' [u , v] N [u , v]
(3.6)
Lc gi o (Pseudoinverse filter):
K thut lc ny khc phc c nhc im ca k thut lc o l lm cho hm
T
H [u,v] lun xc nh:
40
1
khi H[u, v]
H [u, v] H [u, v]
0
khi H[u, v]
(3.7)
Vi l mt gi tr cho trc.
Trong trng hp nh nguyn gc g[m,n] chuyn ng tnh tin theo phng x v y
sinh ra hin tng nho nh th HT[u,v] s c xc nh theo cc thng s chuyn ng,
v lc gi o c kh nng khi phc c nh nho ny.
Lc nhiu lm m:
Ta bit nhiu lm m gy ra do tnh cht g gh ca b mt vt th gy ra hin
tng tn x cc tia n sc. Phn ny ta s nghin cu mt k thut lc nhiu lm m l
k thut trung bnh thng k s dng b lc ng cu.
K thut lc nhiu trung bnh thng k tin hnh thng k cc cng sng ca i
tng nh b nhiu lm m bng N ln thu nhn c lp v ly trung bnh cc cng
.
Ta gi thit h thng ch c nhiu lm m v nhiu ny c th coi nh l tng v s
hn cc pha c lp v ng nht. Ta c th biu din nhiu lm m nh sau:
IT
a[m,n]=aR[m,n]+j.aL[m,n]
Vi aR v aL l cc bin ngu nhin c lp phn b theo Gaussian, ng vi mi to
[m,n] c trung bnh bng 0 v phng sai 2. Ta c cng S:
S[m,n] = a[m,n] = aR2 + aL2
(3.8)
(3.9)
1
N
'
i
N
'
i
[ m, n ]
i 1
(3.10)
(3.11)
(3.12)
2 / 6 N 1
S N (1 , 2 ) 2
1 / N N 1
(3.13)
41
3.4. CU HI N TP CHNG
Cu 1: Biu tn sut l g? Hy tm biu tn sut h(g) cho nh I sau, c bit
cc im nh c gi tr t 0 n 9:
1 2 1 3 2 1
4 4 3 2 4 0
6 9 2 3 2 1
=
6 2 0 5 3 0
3 4 0 5 1 5
5 6 8 9 3 6
Cu 2: Thc hin cc php bin i sau vi nh I cu 1.
Tng sng vi c = 4.
Tch ngng vi = 3.
Lu : Cc im nh ch nhn gi tr t 0 n 9.
Cu 3: T biu tn sut h(g) tnh c cu 1 hy tnh biu tn sut h'(g) ca
nh I' sau khi c bin i t nh I s dng biu thc:
IT
( ) = |2 9|
2 2 2
2
2 2 2
2 2 2
2
2 2 2
2 2 15 15 15 2 2
1 1
= 2 2 13 17 16 2 2 =
1 1
2 2 15 15 15 2 2
2 2 2
2
2 2 2
2 2 2
2
2 2 2
Cu 5: Thc hin lc vi ca s 3x3 v = 3 s dng cc phng php sau vi nh I
cu 1:
Lc trung v vi.
Lc trung bnh.
42
Chng 4:
CC PHNG PHP PHT HIN BIN
Pht hin bin gin tip: Nu bng cch no ta phn c nh thnh cc vng
th ranh gii gia cc vng gi l bin. K thut d bin v phn vng nh l hai
bi ton i ngu nhau v d bin thc hin phn lp i tng m khi phn
lp xong ngha l phn vng c nh v ngc li, khi phn vng nh
c phn lp thnh cc i tng, do c th pht hin c bin.
IT
Phng php pht hin bin trc tip t ra kh hiu qu v t chu nh hng ca
nhiu, song nu s bin thin sng khng t ngt, phng php t ra km hiu qu,
phng php pht hin bin gin tip tuy kh ci t, song li p dng kh tt trong trng
hp ny. S khc bit c bn gia hai phng php ny l: Phng php pht hin bin
trc tip cho ta kt qu l nh bin, cn phng php pht hin bin gin tip cho ta kt
qu l ng bin.
4.1.2. K thut pht hin bin Gradient
Theo nh ngha, gradient l mt vct c cc thnh phn biu th tc thay i gi
tr ca im nh, ta c:
f ( x, y )
f ( x dx, y ) f ( x, y )
fx
x
dx
f ( x, y )
f ( x, y dy ) f ( x, y )
fy
y
dy
Trong , dx, dy l khong cch (tnh bng s im) theo hng x v y.
43
f
x f x 1, y f x, y
f
f x, y 1 f x, y
y
Do , mt n nhn chp theo hng x l
v hng y l
A= 1 1
1
B=
1
V d:
I=
; I B=
IA=
IT
Ta c,
I A + I B=
Hy =
-1
-1
-1
-1
-1
-1
44
I Hy =
-10
-10
-15
-15
-10
-10
-5
-5
15
15
10
-15
IT
I Hx =
-15
-10
-5
-15
-15
-10
-5
15
15
-5
-15
-15
-15
-15
-20
-15
-15
-15
-15
-10
I=
I Hx + I Hy =
45
Hy =
-1
-2
-1
-1
-2
-1
-3
-3
-3
-3
-3
-3
-3
H2 =
5
5
H4 =
H3 =
H1 =
IT
4.1.2.3. K thut la bn
K thut s dng 8 mt n nhn chp theo 8 hng 00, 450, 900, 1350, 1800, 2250,
2700, 3150
H5 =
H7 =
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
-3
H6 =
H8 =
+ Bc 2:
I H
i 1
46
2 f 2 f
f 2 2
x
y
2
f
f
f ( x 1, y ) f ( x, y )
2
x
x x x
2
f ( x 1, y ) f ( x, y ) f ( x, y ) f ( x 1, y )
f ( x 1, y ) 2 f ( x, y ) f ( x 1, y )
Tng t,
2 f
f
f ( x, y 1) f ( x, y )
2
y
y y y
IT
f ( x, y 1) f ( x, y ) f ( x, y ) f ( x, y 1)
f ( x, y 1) 2 f ( x, y ) f ( x, y 1)
Vy: 2 f= f(x+1,y) + f(x,y+1) - 4f(x,y) + f(x-1,y) + f(x,y-1)
Dn ti:
0 1 0
H 1 4 1
0 1 0
0 1 0
1 1 1
1 2 1
H1 1 4 1 H 2 1 8 1 H 3 2 4 2
0 1 0
1 1 1
1 2 1
47
4
9
12
9
4
IT
2
4
1
H=
5
159
4
2
Gi G l kt
t qu lc nhiu: G = I H
2
4
5
4
2
Gx = G Hx, Gy = G Hy
(, ) +
(, )
2(
( , ),
( , ))
48
IT
49
IT
x
0
Kh khn cho vic phn tch cc nh trn thc t l ch s bin thin v mc xm
ca im nh khng phi ch c th hin theo mt hng duy nht m phi xt theo c
tm hng ca cc im nh lng ging, ti cc vng bin v ln cn bin s bin thin
mc xm ca cc im nh thng khng t ngt m tri qua mt khong bin thin
khng u nhng c tc bin thin nhanh.
N=5
IT
}
}
tt_GrayScale+=GetPoint(pOrgImg,ii,jj);
if (tt_GrayScale>9*GetPoint(pOrgImg,i,j)+1){
}
}
}
SetPoint(pBdImg,i,j,BLACK);
Trong :
biWidth, biHeight: l chiu rng v chiu cao ca nh tnh theo n v Pixel.
pOrgImg, pBdImg: ln lt l cc con tr tr n cc vng d liu ca nh gc v
nh bin.
tt_GrayScale: l tng gi tr xm ca cc im nh thuc ma trn 33 c tm l
im nh ang xt.
1: l chnh lch mc xm ca im nh ang xt so vi gi tr xm trung bnh
ca ma trn.
SetPoint() v GetPoint(): l cc hm c, ghi gi tr im nh.
Chng ta c th so snh c hiu qu ca thut ton pht hin bin ny so vi cc
thut ton pht hin bin truyn thng thng qua cc hnh minh ha di y. Hnh 4.3a l
nh gc, Hnh 4.3b l nh bin qua lc Sobel Hx, Hnh 4.3c l nh bin qua lc Sobel Hy,
Hnh 4.3d l nh bin qua lc Kirsh, Hnh 4.2e l nh bin qua lc Laplace. Hnh 4.3 l cc
51
nh bin thu c khi s dng thut ton pht hin bin xut da vo trung bnh cc b
vi gi tr 1 khc nhau. Hnh 4.3a l nh bin thu c vi 1= 25, Hnh 4.3b l nh bin
thu c vi 1= 250.
a) nh gc
b) nh qua lc Sobel Hx
d) nh qua lc Kirsh
c) nh qua lc Sobel Hy
e) nh qua lc Laplace
IT
Hnh 4.3. Cc nh bin theo cc thut ton pht hin bin truyn thng
a) nh bin thu c vi 1= 25
52
IT
Trong Hnh 3.1 biu din ma trn 8 lng ging k nhau, cc im P0, P2, P4, P6 l cc
4-lng ging ca im P, cn cc im P0, P1, P2, P3, P4, P5, P6, P7 l cc 8-lng ging
ca P.
P2
P1
P4
P0
P5
P6
P7
P3
*i tng nh
Hai im Ps, Pe E, E hoc c gi l 8-lin thng (hoc 4-lin thng)
trong E nu tn ti tp cc im c gi l ng i (io,jo)...(in,jn) sao cho (io,jo)= Ps,
(in,jn)= Pe, (ir,jr) E v (ir,jr) l 8-lng ging (hoc 4-lng ging tng ng) ca (ir-1,jr-1) vi
r = 1,2,...,n
Quan h k-lin thng trong E (k=4,8) l mt quan h phn x, i xng v bc cu.
Bi vy l mt quan h tng ng. Mi lp tng ng c gi l mt thnh phn
k-lin thng ca nh. V sau ta s gi mi thnh phn k-lin thng ca nh l mt i
tng nh.
53
IT
54
IT
Do xut pht t nhng tiu chun v nh ngha khc nhau v im bin, v quan h
lin thng, cc thut ton d bin cho ta cc ng bin mang cc sc thi rt khc nhau.
Kt qu tc ng ca ton t d bin ln mt im bin ri l im bin ri+1 (8-lng
ging ca ri). Thng thng cc ton t ny c xy dng nh mt hm i s Boolean
trn cc 8-lng ging ca ri. Mi cch xy dng cc ton t u ph thuc vo nh ngha
quan h lin thng v im bin. Do s gy kh khn cho vic kho st cc tnh cht
ca ng bin. Ngoi ra, v mi bc d bin u phi kim tra tt c cc 8-lng ging
55
La chn im bin
IT
NV
NV
(b,r)
(b,r)
56
IT
tnh gi tr cho hng tip theo ta lp bng da trn gi tr pdir tnh c trc
theo cc kh nng c th xy ra:
pdir
im trng trc
Trng so vi en mi
57
X B = {x: Bx X}
IT
0
0
V d: Ta c tpp X nh sau: X =0
0 0
0
0
0
0
0
0
0 0
0
0 0
X B = 0
0 0 v X B = 0
0
0
0 0
0
0
0
B=
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
58
CLOSE(X,B) = (X B) B = 0
0
0
4.4.2. Mt
t s tnh cht ca php ton hnh
h
thi
* Mnh 4.1 [Tnh gia tng]:
tng
(i) X X
X B X B
X B X B
(ii) B B'
xX
B
x X '
X ' B
x / Bx X x / Bx X ' = X B
(ii) X B =
IT
Chng minh:
XB=
X B X B' X
X B X B
(i) X B =
0
0
0
0
B'
X B'
xX
xX
Theo nh ngha:
X B =
x / B' x X x / Bx X = X B.
59
Chng minh:
(i) X (B B) = (X B) (X B)
Ta c: B B B
X (B B) X B (tnh gia tng)
Tng t:
X (B B) X B
X (B B) (X B) (X B)
(4.1)
Mt khc,
y X (B B) x X sao cho y (B B)x
y Bx
yXB
y Bx
y X B
y (X B) (X B)
X (B B) (X B) (X B)
(4.2)
T (4.1) v (4.2) ta c: X (B B) = (X B) (X B)
(ii) X (B B) = (X B) (X B)
B B B
IT
Ta c:
X (B B) X B
X (B B) (X B) (X B)
Mt khc,
(4.3)
Tng t:
x (X B) (X B)
Suy ra,
xXB
x X B
Bx X
Bx X
(B B)x X
x X (B B)
X (B B) (X B) (X B)
(4.4)
(X Y) B X B
Tng t: (X Y) B Y B
60
(X Y) B (X B) (Y B)
(4.5)
Mt khc,
x (X B) (Y B)
Suy ra
xXB
Bx X
xYB
Bx Y
Bx X Y
x (X Y) B
(X Y) B (X B) (Y B)
(4.6)
=(
) B'
IT
x X
(B
B' ) =
x X
(B B )
'
x X
= X (B' B)
By X
yBx'
( B ' B) x X
'
Mt khc, ( B B ) x X
( B x' B) X
yBx'
y B x' ta c By X
hay y B x' ta c y X B
Do , B x' X B
Ta c, (X B) B'
= x / Bx X B'
= {x/ B x' X B}
= {x/ ( B ' B ) x X} (do chng minh trn)
61
= X (B B').
* nh l 4.2 [X b chn bi cc cn OPEN v CLOSE]
Gi s, X l mt i tng nh, B l mu, khi , X s b chn trn bi tp CLOSE
ca X theo B v b chn di bi tp OPEN ca X theo B.
Tc l:
(X B) B X (X B) B
Chng minh:
Ta c: x X Bx X B
(V X B =
x X
(4.7)
Mt khc,
y (X B) B, suy ra:
x X B sao cho y Bx (V (XB) B =
xXB
Suy ra: X (X B) B
IT
Bx X y X
(4.8)
T (4.7) v (4.8) Ta c: (X B) B X (X B) B.
(ii) ((X B) B) B = XB
Chng minh:
(i) Tht vy, t nh l 4.2 ta c X (X B) B
X B ((X B) B) B (do tnh cht gia tng)
(4.9)
(4.10)
(4.11)
Do , thay X bi X B ta c, XB ((X B) B) B
(4.12)
cp n mt tip cn mi trong pht hin bin da vo cc php ton hnh thi thng qua
cc k thut xp x trn v xp x di i tng.
Cng c mt vi tc gi cp n k thut pht hin bin da vo php ton
hnh thi. Nhng cc k thut pht hin bin trc tip, gin tip v da vo cc php ton
hnh thi k trn u xut pht t quan im bin ca i tng l mt tp hp con ca i
tng. Trong thc t chng ta thng hiu ng bin l khu vc ranh gii bao gm c hai
phn thuc i tng v khng thuc i tng. phn di y, chng ti xut mt
k thut pht hin bin da vo php ton hnh thi theo quan nim ny, xut pht t c s
nh l 4.2 c chng minh trn.
Bin (hay ng bin) c th hiu n gin l cc ng bao ca cc i tng trong
nh chnh l ranh gii gia i tng v nn. Vic xem ranh gii l phn c to lp bi
cc im thuc i tng v thuc nn cho php ta xc nh bin da trn cc php ton
hnh thi.
Theo nh l 4.2 ta c: (XB)B X B
Nh vy, tp CLOSE(X,B) = (XB)B c th c xem nh l xp x trn ca tp
X theo mu B (Hnh 4.8).
IT
CLOSE(X,B)= (XB)B
Xp x trn ca X (cha X)
X B = CLOSE(X,B)\ OPEN(X,B)
Xp x bin ca X theo mu B
OPEN(X,B)= ((XB)B)
Xp x di ca X (thuc X)
X B i
i 1
63
4.4.4. Thut ton pht hin bin da vo php ton hnh thi
Vo
: nh X v dy mu B= {Bi, 1 i n };
: Bin ca i tng theo mu B
Ra
Phng php:
Bc 1: Tnh X Bi i=1,n
Bc 2: Tnh
X B
i
i 1
B1
B2
B3
B4
IT
a) nh gc a cp xm
Hnh 4.9. Pht hin bin bi thut ton da vo php ton hnh thi
64
4.5. CU HI N TP CHNG
Cu 1: im bin c nh ngha nh th no? K thut ph bin nht pht hin
bin l g?
Cu 2: Thc hin ci t phng php tch bin Canny. u vo ca h thng l
mt ma trn nh a cp xm (0-255)v u ra l nh vi ch hai loi im nh, im nn c
gi tr l 0 v im bin c gi tr l 255.
Cu 3: Thc hin php co v dn hnh X vi mt phn t cu trc B sau c hai
hnh X1 v X2. Thc hin php tr tm nh bin. c bit tm ca B l chnh gia.
0
1
1
X
1
1
1
1
1
1
1
0
0
1
1
1
0
1
0
1
0
1
0
0
0
0
1
1
1
1
0
0
0
1
1
1
0
1
1
1
1
1
1
1
1
0
1
0
1
1
1
0
1
1
1
0
0
1
0 1 0
1
B 1 1 1
0
0 1 0
1
0
IT
65
Chng 5:
PHN VNG NH
IT
X l nh bao gm cc bc: thu nhn nh, tin x l, phn on nh, biu din v
gii thch, nhn dng v m t (tuy nhin khng phi ng dng x l nh no cng phi c
y tt c cc bc trn). Trong cc bc , bc phn on nh l bc quan trng
nht nhng v cng kh khn nht. Mt khc, c nhiu ng dng quan trng cn n k
thut phn on: nh mu hoc a mc xm th cn phi phn ngng; mun nhn dng
c cc i tng th trc ht cn phi phn nh thnh cc vng khc nhau cha cc i
tng trong nh: tch ra vng l ch, s trn b th hoc fax trong phn loi th, fax t
ng; tch ra cc vng l ch, hnh nh, bng biu trong cc ng dng nhp d liu t
ng; tch ra vng b bng nh gi phn trm din tch bng trn da; tch ra vng rng
b chy trong nh chp t my bay, v tinh pht hin chy rng; tch ra ao, h, cy xanh
t nh chp thnh ph t v tinh nh gi t l ao h, cy xanh, nh ca ca thnh ph
v.v..
X Ri
(5.1)
i 1
Ri R j 0
vi i j
(5.2)
(5.3)
(5.4)
Nhng vng Ri, i=1..N phi lp kn hon ton nh, n c th hin trong tnh cht
(5.1). Tnh cht (5.2) m bo rng hai vng khc nhau l nhng tp hp ri nhau. V t
P(Ri) phi l TRUE trn mi vng Ri bo m tnh ng nht ca vng, c th c
66
(5.5)
(5.6)
IT
Trong nhiu ng dng, s lin thng ca vng ng vai tr quan trng trong vic
phn on nh. Mt vng R c gi l lin thng nu bt k hai im (xA,yA) v (xB,yB)
thuc vo R c th c ni bi mt ng (xA,yA)... (xi-1,yi-1), (xi,yi), (xi+1,yi+1)... (xB,yB),
m cc im (xi,yi) thuc vo R v bt k im (xi,yi) no u k st vi im trc (xi-1,yi1) v im tip theo (xi+1,yi+1) trn ng . Mt im (xk,yk) c gi l k vi im
(xl,yl) nu (xl,yl) thuc vo lng ging trc tip ca (xk,yk). Chng ta c th nh ngha hai
loi lng ging. 4-lng ging ca mt im (x,y) l mt tp hp bao gm lng ging dc v
lng ging ngang ca n:
N4((x,y)) = {(x+1,y), (x-1,y), (x,y+1), (x,y-1)}
(5.7)
8-lng ging ca (x,y) l mt tp cha ca 4-lng ging v bao gm lng ging ngang,
dc v cho:
(5.8)
2.
67
[ ]=
)/
[ ]
)/
(5.9)
Trong ,
IT
( )
( )
vi
+
2
=
(5.10)
68
0.
S im
nh
Nn
IT
i tng
Gi tr sng
T maxp a
(5.11)
69
d
Hmin
Hb
bmin
bmax
Gi tr sng
IT
(5.12)
b) Cc i tng ti:
TopHat ( A, B ) A ( A B ) A min (max ( A))
B
(5.13)
T
Hnh 5.3. Bimodal histogram
Gi tr sng
70
IT
vi
i 1,2,...,
n
X
i j
Z i Z j vi
P(Z ) True vi
i 1,2,...,
n
i
i j
P(Zi Z j ) False vi
(5.14)
(5.15)
(5.16)
71
mi
1
I (k , l )
n ( k ,l )Zi
(5.17)
1
( I ( k ) mi ) 2
n ( k ,l )Z j
(5.18)
(5.19)
vi l mt ngng
hoc tiu chun l lch bnh phng trung bnh nh hn
1 n
( xi x) 2
n i1
(5.20)
IT
Nu min ang xt khng tho mn tiu chun th khng phi l min ng nht v
s c chia thnh 4 phn.
72
Begin
1. Max = 0; Min = 255;
2. For i = N1 to N2 do
For j = N1 to N2 do
If I(i,j) < Min Then Min = I(i,j);
If I(i,j) >Max Then Max = I(i,j);
3.
Else Examin_Criteria = 1;
End
IT
Begin
1. xtb = 0; e=0; n = (N2-N1)*(M2-M1)
2. For i = N1 to N2 do
For j = N1 to N2 do
For j = N1 to N2 do
e = e + sqr(I(i,j)-xtb)/n
73
a) nh gc
IT
b) Phn mc 1
10
11
12
13
14
15
16
c) Phn mc 2
74
17 18 9
10
19 20
21 22 8
11
12
23 24
25 26 29 30 4
27 28 31 32
15
16
d) Phn mc 3
18
19
20
21
22
17
10
23
24
11
25
IT
12
26
13
27
28
15
14
29
30
31
16
32
e) Cy tng ng
75
mi
1
I (k , l )
n ( k ,l )Ri
(5.21)
2
1
( I (k , l ) mi )
n ( k ,l )Ri
(5.22)
m'i
1
n
2
I (k , l ) mi 2 )
(n i
n 1
n 1
(5.23)
(5.24)
i2
1
(I(k, l) n * mi )
n 1
tiu chun:
IT
Phng php hp cho php lm gim s min lin thng xung ti thiu nhng
cu trc hng ngang dn tri, khng cho ta thy mi lin h gia cc vng.
76
i.
ii.
Lm mnh bin
Nh phn ho ng bin
Miu t ng bin
Mc xm
IT
a) ng bin l tng
Mc xm
b) ng bin bc thang
Mc xm
x
c) ng bin thc
Hnh 5.5. ng bin ca nh
77
ng bin bc thang (Hnh 5.5 b) xut hin khi s thay i cp xm tri rng
qua nhiu im nh. V tr ca ng bin c xem nh v tr chnh gia ca
ng ni gia cp xm thp v cp xm cao.
IT
(5.25)
vi:
IT
79
(5.27)
Trung bnh:
Phng sai:
tng phn:
IT
(5.32)
80
Xc sut cc i:
(5.33)
Entropy:
(5.34)
D dng thy c entropy cc i khi xc sut lin hip P(k,l,d) c phn phi u.
M men bc m:
(5.35)
IT
Ngoi hai cch tip cn trn, ngi ta cn dng cch tip cn khc bng cch ly t
hp 2 cch trn v gi l k thut mosaic. M hnh ny biu din cc qu trnh hc ngu
nhin, v d nh khm ngu nhin hay u ca mt mt phng vo cc ng cong li s
lm ni ln tnh kt cu t bo.
5.4.3. Tip cn theo tnh kt cu
Khi i tng xut hin trn mt nn c tnh kt cu cao, vic phn on da vo
tnh kt cu tr nn quan trng. Nguyn nhn l kt cu si thng cha mt cao cc g
(edge) lm cho phn on theo bin km hiu qu, tr phi ta loi tnh kt cu. Vic phn
on da vo min ng nht cng c th p dng cho cc c trng kt cu v c th
dng phn on cc min c tnh kt cu.
Nhn chung, vic phn loi v phn vng da vo kt cu l mt vn phc tp.
y, ti liu ch mang tnh cht gii thiu. C th gii quyt vn ny trong thc t nu ta
bit trc cc loi kt cu (da vo quy lut hay cc phn b ca n).
81
5.6. CU HI N TP CHNG
Cu 1: Thut ton i xng nn l thut ton g? Thut ton i xng nn cho kt
qu tt nht khi no?
Cu 2: Thc hin tm ngng phn vng vi thut ton i xng nn vi biu tn
sut sau. c bit chnh xc cn tnh l 88%.
g
0
h(g) 2
1
3
2
4
3
5
4
7
5
8
6
12
7
47
8
10
9
2
1
3
2
4
3
5
4
7
5
8
6
12
7
47
8
10
9
2
IT
82
Chng 6:
NHN DNG NH
La chn lut ra quyt nh (phng php nhn dng) v suy din qu trnh hc.
Hc nhn dng.
IT
83
Trch chn c
tnh biu din i
tng
Phn lp ra
quyt nh
nh
gi
IT
Ci Cj = vi i j v Ci = X
Trong trng hp g l tuyn tnh, ngi ta ni l vic phn lp l tuyn tnh hay siu
phng (Hyperplane).
Cc hm phn bit thng c xy dng da trn khi nim khong cch hay da
vo xc sut c iu kin.
L t nhin, khong cch l mt cng c rt tt xc nh xem i tng c "gn
nhau" hay khng. Nu khong cch nh hn mt ngng no y ta coi 2 i tng l
ging nhau v gp chng vo mt lp. Ngc li, nu khong cch ln hn ngng, c
ngha l chng khc nhau v ta tch thnh 2 lp.
84
P ( X / Ci ) P (Ci )
P( X )
P (C / Xi ) P (Ci )
i 1
(6.1)
Nu P(Ci /X) > P(Ck /X) vi i # k th X Ci. Tu theo cc phng php nhn dng
khc nhau, hm phn bit s c cc dng khc nhau.
f x
1
2 2
exp
x m 2
2 2
IT
Quy tc Bayes
- Cho khng gian i tng X = {Xl, l=1, 2,..., L}, vi Xl= {x1, x2,..., xp}
- Cho khng gian din dch = { C1, C2,..., Cr}, r l s lp
Quy tc Bayes pht biu nh sau:
: X sao cho X Ck nu P(Ck /X) > P(Cl /X) l <> k, l=1, 2,...,r.
Trng hp l tng l nhn dng lun ng, c ngha l khng c sai s. Thc t,
lun tn ti sai s trong qu trnh nhn dng. Vn y l xy dng quy tc nhn
dng vi sai s l nh nht.
Phng php ra quyt nh vi ti thiu
Ta xc nh X Ck nh xc sut P(Ck/X). Vy nu c sai s, sai s s c tnh bi
1 - P(Ck/X). nh gi sai s trung bnh, ngi ta xy dng mt ma trn L(r,r) gi thit l
c n lp.
Ma trn L c nh ngha nh sau:
l k , j 0
Lk , j
l k , j 0
Khi
Khi
k j
k j
(6.3)
85
rk(X) =
lk , jP(C / X )
(6.4)
j 1
(6.5)
j 1
Vy, quy tc ra quyt nh da trn l thuyt Bayes c tnh n sai s c pht biu
nh sau:
XCk nu pk < pp vi p k, p= 1,2, .., r
(6.6)
vi k l rk(X).
l 12 l 22 P (C 2 )
P( X / C 2)
l 11 l 21 P (C 1)
(6.7)
IT
Bc 2
Tnh cc khong cch Dj1, Dj2.
Dj1 = D(Xj,Z1), Dj2 = D((Xj,Z2). t Dk(2) = max j Dj
86
Nguyn tc chn
Nu Dk(2) < d1 kt thc thut ton. Phn lp xong.
Jk = X gk D ( X , Zk ) D 2( Xj , Zk )
j 1
(6.9)
Xt
IT
Jk l hm ch tiu vi lp Ck. Vic phn vng cho k ht nhn u tin c tin hnh
theo nguyn tc khong cch cc tiu. y, ta dng phng php o hm tnh
cc tiu.
J
0 vi Zk l bin. Ta d dng c (6.9) min khi:
Z
k
1 Nc
Zj
( Xi Zk ) = 0 ==> Zk = Nc
j 1
i 1
(6.10)
87
IT
88
V d: Ngn ng PLD
Trong ngn ng ny, cc t vng l cc vch c hng. C 4 t vng c bn:
a:
b:
c:
d:
IT
89
IT
(6.11)
90
(6.12)
x x
sj
W = (w ij) vi
Nu i j
si
s 1
(6.13)
wji =
0
y Xs = (xs1,...,xsm).
Nu i=j
IT
c) S dng mng
Gi s a vo mng vect tn hiu X. S dng mng tnh u ra tng ng vi
tn hiu vo X l qu trnh lp bao gm cc bc:
Ban u, t X(0) = X. Gi Y(t) l vect tn hiu ra tng ng vi mt ln cho X(t)
lan truyn trong mng.
91
IT
a) Cu trc mng
Mng Kohonen rt gn gi vi kiu cu trc mng n ron sinh hc c v cu to ln
c ch hc. Mng Kohonen thuc vo nhm mng mt lp cc n ron c phn b trong
mt phng hai chiu theo kiu li vung, hay li lc gic.
Hnh 6.3. Li cc n ron
trong mt phng hai chiu
92
i:=-k to k do
for
j:=-k to k do
begin
xi:=mod(x+i+p-1,p) + 1;
yi:=mod(y+j+q-1,q) + 1;
if (i=k) or (j=k) then
n ron (xi, yi) thuc vo lp lng ging th k
else
n ron (xi, yi) thuc vo lp lng ging th r
r<k; r c xc nh bi max(xi,yi)
end;
Trng hp lp nron Kohonen l mt dy, cch cun trn mng n ron to thnh
mt ng trn.
IT
N ron c c tn hiu ra cc i
(6.14)
(6.15)
93
f = (t). a(dcj),
tmax - t
(t) = (amax - amin) _________ + amin
(6.16)
tmax - 1
y t l s i tng mu dng luyn mng
tmax l s mu ti a
amax, amin tng ng l gi tr cc i, cc tiu ca hm a(.)
Tu thuc vo n ron trung tm c c la chn theo nguyn tc 1 hoc nguyn tc 2
ta c cch hiu chnh cc trng s wji tng ng:
wji = wji + (t) a(dcj)(1 - xi wji)
(6.17)
(6.18)
n
2
ji
i 1
IT
Theo kinh nghim, cn phi to ra phn b ngu nhin cc trng s trong khong 0.1 n 0.1 hoc -1/m n 1/m, y m l s trng s ca mng v chun ho d liu vo,
ra bng -1 hoc 1.
Tuy nhin cng phi ch mt iu l vic la chn tiu chun chun ho, nh c
d liu ph thuc rt nhiu vo bn cht bi ton.
c) S dng mng
Gi s hun luyn mng nhn c ma trn trng s W. Khi a vo mng
mt vector X, ton b ma trn W li c cp nht theo cc cng thc (6.17) hoc (6.18)
tu thuc vo s dng nguyn tc 1 hay nguyn tc 2.
Nh vy, mng Kohonen cho chng ta bit c s phn b v quan h tng i v
mt "a l" gia cc mu trong khng gian biu din.
94
Chng 7:
NN D LIU NH
IT
Cch phn loi th hai da vo cch thc thc hin nn. Theo cch ny, ngi ta
cng phn thnh hai h:
Phng php khng gian (Spatial Data Compression): Cc phng php thuc
h ny thc hin nn bng cc tc ng trc tip ln vic ly mu ca nh trong
min khng gian.
C mt cch phn loi khc na, cch phn loi th ba, da vo trit l ca s m
ha. Cch ny cng phn cc phng php nn thnh hai h:
95
IT
Phng php RLC c th chia thnh 2 phng php nh: phng php dng chiu
di t m c nh v phng php thch nghi nh kiu m Huffman. Gi s cc mch gm
M bits. tin trnh by, t M = 2m 1. Nh vy mch c c thay bi mch mi gm
m bits.
Vi cch thc ny, mi mch u c m ha bi t m c cng di. Ngi ta
cng tnh c, vi M = 15, p = 0,9, ta s c m = 4 v t s nn l 1,95.
Giai on th nht:
o Tnh tn sut ca cc k t trong d liu gc: duyt tp gc mt cch tun
t t u n cui xy dng bng m.
o Tip sau l sp xp li bng m theo th t tn sut gim dn.
96
K t
Tn sut
Xc sut
152
1532
0.2770
323
602
0.1088
412
536
0.0969
226
535
0.0967
385
112
0.0746
602
385
0.0696
92
323
0.0585
112
315
0.0569
87
226
0.0409
1532
220
0.0396
536
152
0.0275
220
112
0.0203
315
92
0.0167
535
87
0.0158
4
5
Tn sut
K t
IT
Qu trnh gii nn tin hnh theo chiu ngc li kh n gin. Ngi ta cng phi
da vo bng m to ra trong giai on nn (bng ny c gi li trong cu trc ca tp
nn cng vi d liu nn). V d, vi mt tp d liu m tn sut cc k t cho bi.
Bng tn sut
97
10
0110
010
11110
001
11011
000
111111
1110
111110
1100
110101
0111
110100
IT
98
w = null;
IT
while ( c k t k ) {
if k l EOI hoc EOF
in ra m ca w;
}elseif wk tn ti trong t in {
w = wk;
}else{
thm wk vo t in;
in ra m ca w;
w = k;
}
}
99
Chui
null
258
AB
259
BC
260
CB
BC
259
261
BCA
B
C
258
262
ABC
263
CA
264
ABCD
u ra
IT
AB
A
AB
B
C
ABC
262
EOF
100
Chui
258
AB
IT
259
BC
259
BC
260
CB
258
AB
261
BCA
262
ABC
262
ABC
263
CA
ABC
264
ABCD
B
C
BC
AB
u ra
A
EOF
101
IT
Vic m ha theo s khi cng c s dng nhiu trong cc phng php khc nh
phng php dng bin i s trnh by trong mc 8.3 gim bt khng gian lu tr.
Thut ton
Gi s p(0, k, x) l xc sut ca khi ch to bi cc im trng bit, t s nn c
th tnh c d dng. Xc sut ny c th c thit lp bi m hnh l thuyt cho mt
khi c bit. Do vy, ta chia khi lm hai loi: khi mt chiu v khi hai chiu.
Khi mt chiu: Xc sut P(0, k, l) tnh c nh vo m hnh ca qu trnh Markov
bc mt. Qu trnh ny c biu din nhiu ma trn dch chuyn trng thi :
Vi:
(0, , 1) = ( ) ( / )
iu ny c th gii thch nh sau: xc sut xut hin mt khi k x 1 ch gm cc
im trng bng xc sut xut hin mt im trng tip theo k - 1 dch chuyn trng sang
trng.
102
1
1 ( )
( / )
+1
[ ( / ) ( / = ,
= )
( / ) ( / = ,
= )(
)(
=
1 ( )
( / )
IT
N l s im nh trn hng.
Trn c s ny, ngi ta p dng m ha khi t ng thch nghi cho mt s
ng dng
103
IT
104
IT
Phn khi
Chun nn JPEG phn nh ra cc khi 8x8. Cng on bin i nhanh Cosin hai
chiu cho cc khi 8x8 t ra hiu qu hn. Bin i Cosin cho cc khi c cng kch thc
c th gim c mt phn cc tnh ton chung nh vic tnh h s C ij cho 3 tng (8 = 23),
s cc h s l: 4 +2 + 1 = 7.
Nu vi mt nh 1024 x 1024, php bin i nhanh Cosin mt chiu theo hng
ngang hoc hng dc ta phi qua 10 tng (1024 = 210). S cc h s C ij l: 512 + 256 +
128 + 64 + 8 + 4 + 2 + 1 = 1021. Thi gian tnh ton cc h s C ij vi ton b nh 1024 x
1024 ln gp 150 ln so vi thi gian tnh ton cc h s ny cho cc khi.
Bin i Cosin i vi cc khi c kch thc nh s lm tng chnh xc khi tnh
ton vi s du phy tnh, gim thiu sai s do lm trn sinh ra.
Do im nh hng xm c tng quan cao hn, do php bin i Cosin cho
tng khi nh s tp trung nng lng hn v mt s t cc h s bin i. Vic loi bt
mt s h s nng lng thp trong cc khi ch to ra mt mt thng tin cc b gip nng
cao cht lng nh.
nh s c chia lm B khi:
105
trong nh ban u. Nu nh ban u k hiu Image[i,j] th ma trn biu din khi (m,n) l
x[u, v] c tnh:
x[u,v] = Image[mk + u,nl + v]
Bin i Cosin
Bin i l mt trong nhng cng on ln trong cc phng php nn s dng php
bin i. Nhim v ca cng on bin i l tp trung nng lng vo mt s t cc h s
bin i.
Cng thc bin i cho mi khi l:
IT
Trong :
Thut ton bin i nhanh Cosin hai chiu cho mi khi trong trng hp ny s bao
gm 16 php bin i nhanh Cosin mt chiu. u tin, ngi ta bin i nhanh Cosin mt
chiu cho cc dy im nh trn mi hng. Ln lt thc hin cho 8 hng. Sau em
bin i nhanh Cosin mt chiu theo tng ct ca ma trn va thu c sau 8 php bin
i trn. Cng ln lt thc hin cho 8 ct. Ma trn cui cng s l ma trn h s bin i
ca khi tng ng.
Trong s gii nn ta phi dng php bin i Cosin ngc. Cng thc bin i
ngc cho khi 88:
trong :
Lng t ha
Khi lng t ha trong s nn ng vai tr quan trong v quyt nh t l nn
ca chun nn j. u vo ca khi lng t ha l cc ma trn h s bin i Cosin ca cc
khi im nh.
106
IT
107
IT
108
Thnh phn cc h s xoay chiu C1(m, n) vi 1m7, 1n7 cha cc thng tin
chi tit ca nh. nng cao hiu qu nn cho mi b h s trong mt khi, ngi ta xp
chng li theo th t ZigZag.
Tc dng ca sp xp li theo th t ZigZag l to ra nhiu loi h s ging nhau.
Chng ta bit rng nng lng ca khi h s gim dn t gc trn bn tri xung gc di
bn phi nn vic sp xp li cc h s theo th t ZigZag s to iu kin cho cc h s
xp x nhau (cng mc lng t) nm trn mt dng.
Mi khi ZigZag ny c m ha theo phng php RLE. Cui mi khi u ra
ca RLE, ta t du kt thc khi EOB (End Of Block). Sau , cc khi c dn li v
m ha mt ln bng phng php m Huffman. Nh c du kt thc khi nn c th phn
bit c hai khi cnh nhau khi gii m Huffman. Hai bng m Huffman cho hai thnh
phn h s tt nhin s khc nhau.
c th gii nn c, chng ta phi ghi li thng tin nh: kch thc nh, kch
thc khi, ma trn Y, lch tiu chun, cc mc to li, hai bng m Huffman, kch
thc khi nn mt chiu, kch thc khi nn xoay chiu v ghi ni tip vo hai file
nn ca thnh phn h s.
IT
Ci t gii thut cho nn thc s phc tp. Chng ta phi nm c cc kin thc
v nn RLE, Huffman, bin i Cosin, xy dng b lng t ha Lloyd-MaxNn v gii
nn hi chm nhng b li, thi gian truyn trn mng nhanh hn do kch thc tp
nn nh.
(7.31)
109
IT
110
IT
111
7.4. CU HI N TP CHNG
Cu 1: Thc hin m ha nh sau bng thut ton Huffman. c bit nh c
chia lm cc khi kch thc 2x2 lm n v m ha (Mi khi ny s nh l mt ch
ci ca bc nh).
1
1
1
I
0
1
1 1 0 1 1 1 1 1 1 1 0 1 1 1 1 1 0 0 1
1 0 1 1 1 1 1 0 0 1 0 1 1 1 0 1 0 0 1
0 1 0 1 1 1 1 1 0 0 1 1 1 0 0 1 1 0 0
1 0 1 1 0 0 0 1 0 0 1 1 0 1 1 1 1 0 0
1 1 1 1 1 1 1 1 1 1 0 0 0 1 0 0 0 1 1
0 1 1 1 1 1 0 1 1 0 1 1 1 0 1 0 0 1 1
0
1
0
1
0
0
0
1
1
0
1
1
1
1
1
0
0
1
0
0
0
1
1
IT
1
1
I
1
112
[1]. Nng Ton, Phm Vit Bnh (2008), Gio trnh x l nh H Thi Nguyn,
Nxb Khoa hc v k thut, 2008.
[2]. Phm Vit Bnh, Cao L Mnh H, Nng Ton (2005), Mt cch tip cn mi
trong pht hin bin ca nh a cp xm, K yu Hi tho Quc gia ln th 8 - Mt
s vn chn lc ca Cng ngh Thng tin v Truyn thng, Hi Phng 25-27/08
/2005, Nxb KH&KT, H Ni 2006, 92-102.
[3]. Nguyn Quc Trung (2004), X l tn hiu v lc s, Nxb v K thut, 2004.
[4]. Lng Mnh B, Nguyn Thanh Thy (2003), Nhp Mn X l nh s, Nxb Khoa
hc v K thut, 2003.
[5]. Nguyn Kim Sch (1997), X l nh v Video s, Nxb Khoa hc v K thut, 1997.
[6]. J.R.Paker (1997), Algorithms for Image processing and Computer Vision. John
Wiley & Sons, Inc.
[7]. Randy Crane (1997), A simplified approach to image processing, Prentice-Hall, Inc.
IT
[8]. John C.Russ (1995), The Image Procesing Handbook. CRC Press, Inc.
[9]. Adrian Low (1991), Introductory Computer Vision and Image Processing, Copyright
(c) 1991 by McGrow Hill Book Company (UK) Limited.
[10]. Anil K.Jain (1989), Fundamental of Digital Image Processing. Prentice Hall,
Engwood cliffs.
[11]. T. Pavlidis (1982), Algorithms for Graphics and Image Processing, Computer
Science Press.
113