You are on page 1of 209

X L NH

Trn Quang c
Thng tin ging vin
Thng tin lin h
Phng B1-801 (2 pm - 3 pm Th Ba Hng Tun)
B mn Truyn Thng v Mng My Tnh
Vin Cng Ngh Thng Tin v Truyn Thng
i hc Bch Khoa H Ni
E-mail: ductq@soict.hust.edu.vn
in thoi: (+84) (4) 38682596
Ni dung
Chng 1: Gii thiu chung
Chng 2: Hnh thnh v biu din nh
Chng 3: Thu nhn v s ha nh
Chng 4: C s l thuyt x l nh
Chng 5: Ci thin v nng cp nh
Chng 6: Pht hin v tch bin nh
Chng 7: Phn vng nh
Chng 8: X l nh nh phn
Chng 9: M ha v nn nh
Ti liu tham kho
R.C. Gonzalez, and R. E. Woods, Digital Image Processing,
vol. 2, Prentice Hall, 2002.

A. K. Jain, Fundamentals of Digital Image Processing, vol. 3,


Englewood Cliffs, Prentice Hall, 1989.

L. M. B, N. T. Thy, Nhp mn x l nh, Trng i hc


Bch Khoa H Ni, 2008.

R.C. Gonzalez, R. E. Woods, Digital Image Processing using


Matlab,
GII THIU CHUNG
Trn Quang c
Cc khi nim
nh: Thng tin v vt th hay quang cnh c chiu sng
m con ngi quan st v cm nhn bng mt v h thn kinh
th gic.

i tng ca x l nh l x l cc nh t nhin, nh chp,


d liu nh c ngun gc t tn hiu nh c trng bi bin
v di tn s. C s phn bit gia x l nh vi ha.

H thng x l nh thu nhn khung cnh hoc nh u vo,


thc hin cc php x l to ra mt nh u ra tha mn
cc yu cu v cm th hoc trch rt cc c trng ca nh.
nh tnh v chui nh
nh tnh (Still Image): Biu din bi hm chi ca cc
bin ton trong mt phng nh I(x,y).

Chui nh (Sequence of Images): Hm chi ca cc


bin ta mt phng v bin thi gian I(x,y,t).

x x t

y y
nh tnh
nh nh phn: 1 bit/pixel
nh xm: 8 bits/pixel
nh mu: 16-24 bit/pixel
RGB, YUV, HSL, YCbCr

Pixel (RGB)
Chui nh
Video: Chui cc nh (khung hnh), quan h thi gian gia
cc khung hnh biu din nh ng.

Tn s v phn gii
NTSC (525 dng, 30 khung hnh/giy)
PAL (625 dng, 25 khung hnh/giy)
SECAM (625 dng, 25 khung hnh/giy)
Phim (24 khung hnh/giy)
HDTV (16:9, 720 dng, 60 khung hnh/giy)
SVGA: 72 khung hnh/giy, 1024x720 pixel
Cc v d v nh s
H thng x l nh
Khung cnh, Miu t nh,
i tng Tn hiu D liu i tng nh
nh quang hc Thit b nh nh X l c trng nh
cm bin S ha nh phn tch
Camera) nh lin nh s nh
tc

Nn, lu tr v truyn nh
Cc vn ca x l nh
Thu nhn nh, chp nh v s ha nh
H thng chp nh v tn hiu nh
H thng s ha nh: Ly mu,Lng t ha

Phn tch nh v th gic my tnh


Ci thin nng cp nh, sa li, khi phc nh
Phn tch c trng: tch bin, phn vng nh
Biu din v x l c trng hnh dng i tng nh
Nhn dng i tng nh, phn tch cnh v hiu cnh

M ha, nn nh
Cc phng php nn v cc chun nn
ng dng ca x l nh
Thng tin nh, truyn thng nh

X l nh v tinh, vin thm

Thin vn, nghin cu khng gian, v tr

Ngi my, t ng ha

My thng minh, th gic my nhn to

Sinh hc, y hc

Gim st kim sot, Qun s


ng dng ca x l chui nh
Nn video, truyn thng video, truyn hnh s

Gim st theo di pht hin chuyn ng

iu khin lu lng chuyn ng

Ngi my chuyn ng

Quc phng an ninh

Y hc, ha hc
HNH THNH V BIU DIN NH
Trn Quang c
nh sng v sng in t
Bc sng

Gamma-Ray X-Ray Ultraviolet Visible Infrared Microwaves Radio

10-3 nm 1nm 1000nm 1000 m


H thng th gic
H thng th gic
T bo que
C t 75-150 triu
Rt nhy cm vi nh sng
Cm nhn trn di rng
Cung cp kh nng nhn m
Cm nhn chi
phn gii cao
T bo nn
C t 6-7 triu
Tp trung ch yu ti im vng ti trung tm vng mc
Cm nhn trn di hp
Ba loi t bo cm nhn mu xanh lam, xanh lc v
Cm nhn v biu din mu
chi (Radiance)
Tng nng lng ca chm tia t ngun

ri (Luminance)
o nng lng nh sng thu thp c t ngun sng
Bin thin theo khong cch t ngun sng, bc sng
Khng ph thuc vo mi trng

L(x, y) = f (x, y, )V ( )d
0

f(x,y,) Phn b nh sng trong khng gian


V() Hm hiu sut ri tng i ca h thng th gic
Mu sc
Cm nhn mu sc ph thuc vo ph ca nh sng. nh sng
nhn thy vi di ph rt hp. nh sng vi tt c cc thnh
phn ph nhn thy c nng lng bng nhau s c cm
nhn l nh sng trng.

Mt mu c th to nn bng cch trn 3 mu c bn tng


ng vi 3 dng t bo cm nhn mu sc (, Lc, Lam).
Phn bit mu sc da trn sng, sc v bo ha.
sng, sc v bo ha
sng (Brightness)
Thuc tnh ch quan, c trng cho kh nng cm nhn ri
Ph thuc vo ri ca mi trng xung quanh

c trng mu (Chrominance)
Sc (Hue) l thuc tnh lin quan n bc sng ch yu trong
hn hp ca cc bc sng nh sng. Sc c trng cho mu
sc ch o c cm nhn.
bo ha (Saturation) c trng cho thun khit tng i.
bo ha ph thuc vo rng ca ph nh sng v th hin
lng mu trng c trn vi sc .
Sc v bo ha gi l c trng mu.
Cc m hnh mu

HSV YCbCr (Y=0.5)

RGB CMYK
Cc m hnh mu
Red, Green, Blue ti 3 trc nhn gi tr [0 255]. M hnh RGB
c th biu din hn 16 triu mu. Trong , R (255, 0, 0), G
(0, 255, 0) v B (0, 0, 255).

CMYK (Cyan, Magenta, Yellow, Black) vi C = 255-R, M =


255-G, v Y = 255-B.

YCbCr
Y = 16+219(0.299R+0.587G+0.114B)/255
Cb = 128+224(-0.169R-0.331G+0.5B)/255
Cr = 128+224(0.5R-0.419G-0.081B)/255
Biu din nh s
9 7 1 1 1 2 2 1 nh l mt mng hai chiu gm M
hng v N ct vi f(x,y) l gi tr
8 9 9 7 1 1 1 1 mc xm ti ta (x,y).
7 5 195 7 2 3 1 1
8 6 5 6 3 1 2 3 N4(p), ND(p), N8(p)

9 7 6 9 1 2 2 1 Quan h 4-ln cn (4-adjacency)


5 8 7 9 1 1 2 1 Quan h 8-ln cn (8-adjacency)
8 9 8 9 1 2 1 2 Quan h m-ln cn (m-adjacency)

0 1 1 0 1 1 0 1 1
0 1 0 0 1 0 0 1 0
0 0 1 0 0 1 0 0 1
sai khc
1 N 1
L2-norm error MSE = E (| X i X i |2 )
N i =0

N 1
1
L1-norm error MAD = E (| X i X i |)
N i =0

L -norm error MaxError = max E (| X i X i |)


i

M2
PSNR PSNR = 10 log10
MSE
THU NHN V S HA NH
Trn Quang c
H thng s ha nh

Thit b
Ly mu Lng t ha
cm bin

Thng lng Tn hiu S liu


nh sng nh nh

Thit b cm bin: Charge Coupled Device >4000x4000 phn t.

Ly mu c xy dng da trn t s Nyquist

Lng t ha: Lng t ha Lloyd-Max


Ly mu
nh vi di gii hn (Band limited images): Mt hm f(x,y)
gi l gii gii hn nu khai trin Fourier F(u,v) ca n l 0
bn ngoi min bao, c th F(u,v) = 0 nu |u|>u0 v |v|>v0.

T s Nyquist: Tn s ly mu theo x v y tng ng hoc


ln hn 2 ln di gii hn u0 v v0
x

1 1 y
2u0 2v0
x y
Hin tng rng ca
Lng t ha
Lng t ha u
Lng t ha Lloyd-Max
011 tk: Mc quyt nh
010 rk: Mc dng li

001

000

100

101

110

111
Lng t ha Lloyd-Max
u l mt bin thc ngu nhin vi hm mt lin tc p(u).
Gi tr tk v rk ca b lng t ha L mc c xc nh sao
cho sai s trung bnh bnh phng l nh nht.
tL
2 2
= [u ri ] = [u r ]
i p(u)du
t1

L1 ti+1
2
= [u ri ] p(u)du
i=1 ti
Lng t ha Lloyd-Max
tnh rk, ta thc hin o hm cp mt theo tk v rk, v cho
gi tr o hm bng 0.
tk+1

(tk rk1 )2 p(tk ) (tk rk )2 p(tk ) = 0 2 [u rk ] p(u)du = 0


tk

T , ta c
tk+1

up(u)du
rk + rk1 tk
tk = rk = tk+1
2
p(u)du
tk
Lng t ha u
Lng t ha u l l tng vi hm mt lin tc u.
Mc quyt nh v mc khi phc c tnh nh sau

# 1
% aub rk + rk1 tk+1 + tk
p(u) = $ b a tk = rk =
% 0 2 2
& otherwise

Sai s lng t
q q = rk rk1 = tk+1 tk
12
Thay i kch thc nh
Gim kch thc nh
Gim s lng mu c th dn n hin tng rng ca nu tn
s ly mu khng tha mn iu kin ca t s Nyquist.
S dng b lc thng thp loi b nhng thnh phn tn s
cao (thnh phn c tn s khng tha mn iu kin v t s
Nyquist). Tuy nhin s dng b lc thng thp c th dn n m
nh.

Tng kch thc nh


Tng kch thc nh bng cc phng php ni suy nh Nearest
Neighbor, Bilinear hoc Bicubic.
Tng kch thc nh
Nearest Neighbor
Bilinear b
a
F[m, n'] = (1 a)I[m, n]+ aI[m, n +1]
O[m', n'] = (1 b)F[m, n']+ bF[m +1, n']
Bicubic
F[m, n'] = a(1 a)2 I[m, n 1]+ (1 2a 2 + a 3 )I[m, n]
+a(1+ a a 2 )I(m, n +1) a 2 (1 a)I[m, n + 2]
O[m', n'] = b(1 b)2 F[m 1, n']+ (1 2b 2 + b3 )F[m, n']
+b(1+ b b 2 )F(m +1, n') b 2 (1 b)F[m + 2, n']
C S L THUYT X L NH
Trn Quang c
Tng quan
Ton t tuyn tnh

Tch chp (2D Convolution)

Bin i Fourier (Fourier Transform)

Bin i KL (Karhunen-Loeve Transform)

Bin i Wavelet (Wavelet Transform)


Ton t tuyn tnh
X l im nh bng nh x bin i

g(m, n) = T ( f (m, n)), m [1, M ]v n [1, N ]

H thng c gi l tuyn tnh khi v ch khi t hp tuyn


tnh ca hai tn hiu u vo f1(m,n) v f2(m,n) tao nn t hp
tuyn tnh ca tn hiu u ra g1(m,n) v g2(m,n).

T (1 f1 (m, n) + 2 f2 (m, n))= 1T ( f1 (m, n)) + 2T ( f2 (m, n))

= 1g1 (m, n) + 2 g2 (m, n)


Tch chp
Tch chp - Trng hp lin tc
g ( x, y ) = f ( x, y ) * h ( x , y )
+ +
= f ( , 1 2 )h( x 1 , y 2 )d 1d 2

1 = 2 =

Tch chp - Trng hp ri rc


g[x, y] = f [x, y]* h[x, y]
+ +
= f [n1, n2 ]h[x n1, y n2 ]
n1 = n2 =
Tch chp
Tnh giao hon

f (x, y)* g(x, y) = g(x, y)* f (x, y)


Tnh kt hp
f (x, y)* [ g(x, y)* h(x, y)] = [ f (x, y)* g(x, y)] * h(x, y)
Tnh phn phi

f (x, y)* [ g(x, y) + h(x, y)] = [ f (x, y)* g(x, y)] + [ f (x, y)* h(x, y)]
Bin i Fourier
Bin i Fourier ri rc cho tn hiu mt chiu
M 1 M 1
1 2jux / M
F (u ) = f ( x)e f ( x) = F (u )e 2jux / M
M x =0 u =0

e j = cos + j sin
Bin i Fourier ri rc cho tn hiu hai chiu
1 M 1 N 1 2j ( ux / M + vy / N )
F (u, v) = f ( x, y )e
MN x =0 y =0
M 1 N 1
f ( x, y ) = F (u, v)e 2j (ux / M + vy / N )
u =0 v =0
Bin i Fourier
Nu f(x,y) ch cha gi tr thc, th ph ca f(x,y) s i xng
qua gc ta
F(u, v) = F * (u, v) | F(u, v) |=| F(u, v) |
F(u,v) l hm tun hon vi chu k M v N

F(u, v) = F(u + M, v) = F(u, v + N ) = F(u + M, v + N )


Lin h vi tch chp

f ( x, y ) * g ( x, y ) F (u, v)G(u, v)
f ( x, y ) g ( x, y ) F (u, v) * G(u, v)
Bin i Fourier
1/2
abs [ F(u)] = !" R 2 (u) + I 2 (u)#$

2
P(u) = [ F(u)]
-M/2 M/2 M

" I(u) %
1
(u) = tan $ '
# R(u) &
abs [ F(u M / 2)]
#$ f (x)(1) x %&

-M/2 M/2 M
Bin i Fourier

(a) (b) (c)

(a) nh gc f(x,y)
(b)Bin i Fourier ca f(x,y), F(u,v)
(c) Bin i Fourier ca (-1)x+yf(x,y), F(u-M/2,v-N/2)

[
F (u M / 2, v N / 2) = f ( x, y)(1) x+ y ]
Bin i KL
Bin i KL c s dng trong cc h thng nhn dng hoc
nn nh. N cho php gim lng thng tin d tha trong
nh thng qua qu trnh gim tnh tng quan gia cc im
nh nm ln cn nhau. Cho mt khi nh gm N im nh.
Gi x l vc t cha gi tr ca cc im nh trn

! x1 %
# #
# x2 #
x=" & mx = [ x ]
# ... #
# x N #'
$
Bin i KL
T , ta c ma trn hip phng sai
Cx = #$(x mx )(x mx )T %& = #$xx T %& #$mx mxT %&
Gi tr ci,j ca Cx th hin mi tng quan gia hai im nh xi
v xj. Gi U l ma trn ca bin i tuyn tnh y=UT(x-mx)
sao cho ma trn hip phng sai Cy l ma trn cho.

Gi s ui l vc t c s ca khng gian bin i. Cc phn t


ca y c th xc nh nh sau

yi = uiT (x mx )
Bin i KL
gim hon ton tnh tng quan gia cc im nh trong
khng gian bin i, U phi l ma trn trc giao

UT U = I = UUT
T , c th chng minh c nng lng ca khi nh
c bo ton trc v sau khi thc hin bin i
2
y = yT y
= (x mx )T UUT (x mx )
2
= x mx
Bin i KL
Do ma trn hip phng sai Cy l ma trn cho

! 1 0 ... 0 $
# & C = #(y m )(y m )T%
= # yy T%
y $ y y & $ &
# 0 2 ... 0 &
Cy = # & = # U T
(x m )(x m )T
U%&
... ... ... ... & $ x x
#
#" 0 0 ... N &% = UT Cx U

C th thy rng

Cx U = UCy Cx ui = i ui
Bin i KL
Trong biu thc trn, ui l vc t ring ca Cx v i l gi tr
ring tng ng ca ui. Vc t x c th khi phc da trn
php bin i
y = U T (x mx ) x = Uy + mx
Qu trnh nn nh ch lu K (K<<N) phn t u tin ca y.
Vc t x ban u c th c xp x nh sau
x! = Uy! + mx
Vi
y! = [y1, y2 ,..., yK , 0,..., 0]T
Bin i KL
Trung bnh bnh phng ca sai s c xc nh bi
$1 N ' 1 $ 2'
!
& (xi xi ) ) = % x x (
2
!
% N i=1 ( N
1 $ 2'
= % Uy Uy! (
N
1 $ 2' 1 N 2
= % y y! ( = i
N N i=K+1
Bin i KL
Nng lng ca khi nh trc v sau khi bin i c bo
ton.

Ma trn hip phng sai Cy l ma trn cho. Do vy cc im


nh trong khng gian bin i khng tng quan vi nhau.
Lng thng tin d tha trong khi nh ban u b gim mt
cch ti a.

Nn nh da trn bin i KL c t l nn cao. Tuy nhin vic


tnh ton vc t ring v gi tr ring tng ng rt phc tp
vi kch thc khi nh ln. Bin i KL cng ph thuc vo
c trng ring ca tng nh.
Bin i Wavelet
Bin i Wavelet (Wavelet Transform) c s dng trong x
l a phn gii v nn nh JPEG2000. Bin i Wavelet da
trn qu trnh m ha di tn con (sub-band coding).

Low-pass Low-pass
Analysis 2 2 Synthesis
Filter Filter
x(n) x! (n)
High-pass High-pass
Analysis 2 2 Synthesis
Filter Filter

h0(n): Low-pass Analysis Filter g0(n): Low-pass Synthesis Filter


h1(n): High-pass Analysis Filter g1(n): High-pass Synthesis Filter
Bin i Wavelet
nh ngha bin i Z:
+
X(z) = x(n)z n

Gim mu 2 ln trn min thi gian


1
xdown (n) = x(2n) X down (z) = #$ X(z1/2 ) + X(z1/2 )%&
2

Tng mu 2 ln trn min thi gian


!# x(n / 2) n = 0, 2, 4,...
xup (n) = " Xup (z) = X(z 2 )
#$ 0 Otherwise
Bin i Wavelet
Gim mu v tng mu trn min thi gian:
= 1 [ X(z) + X(z)]
X(z)
2
Qu trnh m ha bng tn con c th c minh ha nh sau
= 1 G (z) [ H (z)X(z) + H (z)X(z)]
X(z) 0 0 0
2
1
+ G1 (z) [ H1 (z)X(z) + H1 (z)X(z)]
2
1
X(z) = [ H 0 (z)G0 (z) + H1 (z)G1 (z)] X(z)
2
1
+ [ H 0 (z)G0 (z) + H1 (z)G1 (z)] X(z)
2
Bin i Wavelet
T , ta c
H 0 (z)G0 (z) + H1 (z)G1 (z) = 0
H 0 (z)G0 (z) + H1 (z)G1 (z) = 2

Biu din di dng nhn ma trn


! H (z) H (z) #
! G (z) G (z) #& 0 0
'=! 2 0 #
" 0 1 $& H (z) H (z) ' " $
" 1 1 $
Quadrature mirror filters (QMF)
H1 (z) = H 0 (z) G0 (z) = H 0 (z) G1 (z) = H 0 (z)
CI THIN V NNG CP NH
Trn Quang c
Tng quan
Ci thin v nng cp nh

Ton t Ton t trn Ton t


trn im nh min khng gian trn min tn s

nh m bn Lc trung bnh Lc thng thp


Bin i s dng hm log Lc trung bnh trng s Lc thng cao
Bin i s dng hm m Lc trung v Lc High-boost
Dn v co tng phn Lc cc i Laplace trn min tn s
Ct theo mc Lc cc tiu
Trch chn bit Lc sc nt
Cn bng Histogram Lc High-boost
Histogram c trng
Tr nh
Trung bnh nh
TON T TRN IM NH
Trn Quang c
Phc ha ni dung
Ci thin v nng cp nh

Ton t Ton t trn Ton t


trn im nh min khng gian trn min tn s

nh m bn Lc trung bnh Lc thng thp


Bin i s dng hm log Lc trung bnh trng s Lc thng cao
Bin i s dng hm m Lc trung v Lc High-boost
Dn v co tng phn Lc cc i Laplace trn min tn s
Ct theo mc Lc cc tiu
Trch chn bit Lc sc nt
Cn bng Histogram Lc High-boost
Histogram c trng
Tr nh
Trung bnh nh
nh ngha Histogram
Histogram (Lc mc xm) biu din bng mt hm ri
rc h(rk)=nk, trong rk l mc xm th k v nk l s lng
im nh c mc xm rk. Thng thng histogram c tiu
chun ha bng cch chia h(rk) cho n, vi n=nk.
1000

900

800

700

600

500

400

300

200

100

0 50 100 150 200 250


nh m bn

g (m, n) = L 1 f (m, n)
Bin i s dng hm log

(a) (b) (c)

(a) nh gc f(x,y)
(b)Bin i Fourier ca f(x,y), F(u,v)
(c) Bin i s dng hm log (c=1)

g (m, n) = c log[1 + f (m, n)] G(u, v) = c log[1 + F (u, v) ]


Bin i s dng hm m
L-1

Gamma
Correction
=1/2.2

CRT
Gamma
=2.2

L-1
1/
g (m, n) = cf (m, n)
g (m, n) = cf (m, n)
Dn v co tng phn
#
r r<a L-1
%
T (r) = $ (r a) + sa ar<b sb
%
& (r b) + sb br
T(r)
Di tn nhy sng l gii hn
di mc xm xut hin trong nh.
Di tn nhy sng c o bng sa
tng phn.
a b L-1

nh c tng phn thp, di tn nhy sng hp, vic chuyn tip gia cc sc
mc xm khng c sng ng v linh hot. Hm T(r) c dng tng
tng phn. V d, vi ,,>1, T(r) thc hin dn tng phn.
Dn v co tng phn
1600

1400

1200

1000

800

600

400

200

0 50 100 150 200 250

1600

1400

1200

1000

800

600

400

200

0 50 100 150 200 250

a b
nh (b) thu c sau khi thc hin tng cng tng phn nh (a). Histogram ca
nh (a) v (b). nh (a) c mc xm trong di [74,224], nh (b) c mc xm trong di
[0,255].
Ct theo mc
L-1 L-1
T(r)
sH
T(r)
sH

sL

a b L-1 a b L-1

"$ s arb "$ s arb


H
T (r) = # T (r) = # H
$% sL Otherwise $% r Otherwise
Ct theo mc

a b c

a) nh gc
b) Ct theo mc khng nn vi a=100 v b=200
c) Ct theo mc c nn vi a=100 v b=200
Trch chn bit
b=7
Mi im nh c biu din
b=6
bng 8 mt phng bit t 0 n
7, xp chng ln nhau theo b=5


th t t cao xung thp.

b=0

Nhng mt phng bit pha trn tp trung phn ln d liu ngha ca nh. D
liu chi tit nh tp trung nhng mt phng bit pha di. Phn tch s dng
phng php trch chn bit cho php xc nh nhng mt phng bit quan trng
v s lng bit yu cu ca qu trnh lng t ha.
Trch chn bit

Minh ha 8 mt phng bit. (a), (b), (c), (d), (e), (f), abcd
(g), (h) tng ng mt phng bit t 7 n 0 ef gh
Cn bng Histogram
Gi s r c chun ha 0r1, s=T(r) vi T(r) l hm mt
bin n iu tng v 0T(r) 1. iu kin trn m bo s
tn ti ca nh x ngc ca r=T-1(s) v 0s1.

Nu ps v pr l hm mt 1
xc sut ca hai bin s v r. Do
s lng im nh l khng
i, nn ps(s)ds=pr(r)dr. Gi
sk=T(rk)
s
r
s = T (r) = 0
p r (w)dw
rk 1
Cn bng Histogram
Nh vy ds=pr(r)dr. T , ps(s)=1 vi 0s1 v l hm phn
b u. Cn bng histogram cho php to ra histogram mi c
phn b u.

nk k k
nj
pr (rk ) = sk = T (rk ) = pr (rj ) =
n j=1 j=1 n

Trn thc t, gi tr mc xm mi c xc nh nh sau

" sk min{sk } %
sk = round $ (L 1)'
# max{sk } min{sk } &
Cn bng Histogram
1000

900
ab
800 cd
(a) nh gc
700

600

500
(b) Histogram ca nh gc
400 (c) nh vi cn bng Histogram
300 (d) Histogram ca nh (c)
200

100

0 50 100 150 200 250

1200

1000

800

600

400

200

0 50 100 150 200 250


Histogram c trng
Phng php histogram c trng c p dng to nh
u ra vi histogram c hnh dng cho trc. Gi s pr v pz
l hm mt xc sut ca nh u vo v nh u ra. Gi
T(r) v G(z) l php bin i sao cho
r z
s = T (r) = 0
p r (w)dw G(z) = 0
p z (t)dt = s

T(r) thc hin cn bng histogram ca nh u vo, trong khi


G(z) c th xc nh da trn pz. T , ta c

s = T (r) = G(z) z = G 1 (T (r))


Histogram c trng
1) Xy dng histogram ca nh u vo

2) Thc hin cn bng histogram ca nh u vo

3) Xc nh G(z) da trn pz

4) Tm gi tr zk nh nht ng vi sk sao cho

[G(zk ) sk ] 0
5) Mi im nh c mc xm rk, tm sk tng ng (bc (2)).
T sk c th tm zk da trn kt qu ca bc (4).
Tr nh
g(x, y) = f (x, y) h(x, y)
ab
cd
(a) f(x,y)
(b) h(x,y)
(c,d) g(x,y)=f(x,y)-h(x,y)
Trung bnh nh
f (x, y) = g(x, y) + (x, y) Trung bnh nh c s dng gim nhiu
bng cch tng t l SNR. nh (b) thu c
da trn trung bnh nh. Lu : nhiu l
1 K mt qu trnh ngu nhin.
g(x, y) = gi (x, y)
K i=1

"#g(x, y)$% = f (x, y)

1
g( x,y) = ( x,y)
K
a b
TON T TRN MIN KHNG GIAN
Trn Quang c
Phc ha ni dung
Ci thin v nng cp nh

Ton t Ton t trn Ton t


trn im nh min khng gian trn min tn s

nh m bn Lc trung bnh Lc thng thp


Bin i s dng hm log Lc trung bnh trng s Lc thng cao
Bin i s dng hm m Lc trung v Lc High-boost
Dn v co tng phn Lc cc i Laplace trn min tn s
Ct theo mc Lc cc tiu
Trch chn bit Lc sc nt
Cn bng Histogram Lc High-boost
Histogram c trng
Tr nh
Trung bnh nh
Nhiu
nh thng b bin dng do nhiu ngu nhin. Nhiu xut
hin trong qu trnh thu nhn nh hoc truyn tin. Cc yu t
mi trng, v d iu kin nh sng yu, nhit ca thit b
cm bin cng nh hng n s xut hin ca nhiu.

Nhiu c th ph thuc hoc c lp vi ni dung nh v


thng c biu din bng cc thuc tnh thng k. X l
nhiu ph thuc vo ni dung nh thng c phc tp cao
(ngoi chng trnh).

Nhiu c th l nhiu trng, nhiu Gauss, nhiu u, nhiu


xung hoc nhiu mui tiu.
Nhiu lng t ha
Nhiu lng t ha c to ra trong qu trnh lng t ha
(s dng chui nh phn xp x gi tr bin ca tn hiu
thu nhn). Nhiu lng t c th xp x bi phn b u nn
cn c gi l nhiu u.
# 1
% azb
p(z) = $ b a
% 0 Otherwise
&
Nhiu lng t c c trng sau
2
a+b (b a)
= 2 =
2 12
Nhiu trng
Nhiu trng l nhiu c ph nng lng khng i. Nu nhiu
c ph nng lng nhiu hn mt vi tn s, nhiu c
gi l nhiu mu. Hm tng quan ca nhiu trng l Diracs
delta. Do , nhiu trng khng tng quan hai mu bt k.

imnoise(I,localvar, V)
Nhiu Gauss
Nhiu Gauss l m hnh ph bin xp x nhiu trong nhiu
ng dng khc nhau. Mt phn b xc sut ca nhiu l
hm Gauss, c c trng bi gi tr trung bnh v
phng sai 2.
1 (z )2 /2 2
p(z) = e
2
[ , + ]

[ 2 , + 2 ]

imnoise(I,gaussian,M,V)
Nhiu Poisson
Trong qu trnh thu nhn, nu s lng ln ht photon tp
trung vo mt im, chng s to ra nhiu ti im . Nhiu
c c trng bi hm mt phn b xc sut Poisson,
nn c gi l nhiu Poisson.

imnoise(I,poisson)
Nhiu mui tiu
Nhiu xung c trng bi mt im nh c gi tr mc xm
khc bit ln so vi nhng im ln cn. Xung ca nhiu c
th m hoc dng. Xung nhiu m i din cho im nh
en (pepper), trong khi xung nhiu dng i din cho im
nh trng (salt). Nhiu mun tiu xut hiu khi nh b bo
ha bi nhiu xung.

imnoise(I,salt & pepper, 0.02)


Lc trung bnh
Lc trung bnh

1 1 1
1
1 1 1
9
1 1 1

Lc thng thp

1 2 1 1 b 1
1 1
2 4 2 b b 2
b
16 (b + 2) 2
1 2 1 1 b 1
Lc trung bnh

a b c

(a) nh b nhiu mui tiu


(b)Lc trung bnh
(c) Lc thng thp (Lc trung bnh trng s)
Lc trung v, cc tiu v cc i
g ( x, y) = median{ f (m, n)}
m , nW

8 89 8 8
g ( x, y) = min { f (m, n)}
m, nW

8 7 8 8 g ( x, y) = max{ f (m, n)}


m, nW

7 7 8 8
0 0 0 8 89 8 8 7 8
8 8 8 8

W: 3x3, 5x5, 7x7 0 0 0 7 8 8 8 8 89

min max
Minh ha lc trung v

a b c

(a) nh b nhiu mui tiu


(b)Lc trung v ca s 3x3
(c) Lc trung v ca s 7x7
Lc sc nt
o hm bc nht o hm bc hai

f 2 f
= f (x +1) f (x) 2
= f (x +1) + f (x 1) 2 f (x)
x x

5 5 4 3 2 1 0 0 0 6 0 0 0 1 3 1 0 0 0 0 7 7 7 7

o hm bc nht

0 -1 -1 -1 -1 -1 0 0 6 -6 0 0 0 1 2 -2 -1 0 0 0 7 0 0 0

o hm bc hai

-1 0 0 0 0 1 0 0 6 -12 6 0 0 1 1 -4 1 1 0 0 7 -7 0 0
Lc sc nt
2 2
2 f f
f= 2+ 2
x y
= f (x +1, y) + f (x 1, y) + f (x, y +1) + f (x, y 1) 4 f (x, y)

" 0 1 0 % " 0 1 0 % " 1 1 1 % " 1 1 1 %


$ ' $ '$ '$ '
$ 1 4 1 ' $ 1 4 1 ' $ 1 8 1 ' $ 1 8 1 '
$ 0 1 0 ' $ 0 1 0 ' $ 1 1 1 ' $ 1 1 1 '
# & # &# &# &
Lc sc nt
#
% f (x, y) 2 f (x, y) If centercoefficientisnegative
g(x, y) = $ 2
%& f (x, y) + f (x, y) If centercoefficientis positive

" 0 1 0 %
$ '
$ 1 5 1 '
$ 0 1 0 '
# &
" 1 1 1 %
$ '
$ 1 9 1 '
$ 1 1 1 '
# &
Lc High-boost
Nguyn tc c bn
fhb (x, y) = Af (x, y) f (x, y) = (A 1) f (x, y) fs (x, y)

" 0 1 0 %
$ '
$ 1 A + 4 1 '
$ 0 1 0 '&
#

" 1 1 1 %
$ '
$ 1 A + 8 1 '
$ 1 1 1 '
# &
TON T TRN MIN TN S
Trn Quang c
Phc ha ni dung
Ci thin v nng cp nh

Ton t Ton t trn Ton t


trn im nh min khng gian trn min tn s

nh m bn Lc trung bnh Lc thng thp


Bin i s dng hm log Lc trung bnh trng s Lc thng cao
Bin i s dng hm m Lc trung v Lc High-boost
Dn v co tng phn Lc cc i Laplace trn min tn s
Ct theo mc Lc cc tiu
Trch chn bit Lc sc nt
Cn bng Histogram Lc High-boost
Histogram c trng
Tr nh
Trung bnh nh
Lc trn min tn s
Nhng thnh phn tn s thp i din cho d liu nh ti
nhng vng trn mn, trong khi nhng thnh phn tn s cao
i din cho d liu chi tit nh nh bin nh v nhiu.

Lc thng thp ch cho nhng thnh phn tn s thp i qua


v loi b nhng thnh phn tn s cao. V vy, nh sau khi
lc s trn mn nhng khng c sc nt bng nh u vo.

Lc thng cao ch cho nhng thnh phn tn s cao i qua v


loi b nhng thnh phn tn s thp. Do , nh sau khi lc
s c di mc xm khng a dng ti nhng vng trn mn,
nhng sc nt hn so vi nh u vo.
H thng lc trn min tn s

Bin i Bin i
Tin X L H(u,v) Hu X L
Fourier Fourier Ngc

f ( x, y ) g ( x, y )

Lin h vi tch chp

f ( x, y ) * g ( x, y ) F (u, v)G(u, v)
f ( x, y ) g ( x, y ) F (u, v) * G(u, v)
Lin h vi tch chp

1 1 1
1
1 1 1
9
1 1 1
Lc thng thp l tng
"$ 1 if D(u, v) D H(u,v)
0
H (u, v) = #
$% 0 if D(u, v) > D0 1

1/2
D(u, v) = "#(u M / 2)2 + (v N / 2)2 $%
Do D(u)
M 1 N 1
PT = P (u , v)
u =0 v =0

" %
= 100 $ P(u, v) / PT '
# u=0 v=0 &
Lc thng thp l tng

a b

(a) nh gc
(b)Lc thng thp l tng
(c) Lc thng thp l tng vi D0=5,,230
c
Lc thng thp Butterworth

a b c

(a) nh gc 1
(b)Lc thng thp l tng vi D0=5 H (u, v) =
1+ (D(u, v) / D0 )2n
(c) Lc thng thp Butterworth vi D0=5
Lc thng thp Gauss

a b c

(a) Lc thng thp l tng vi D0=15


D 2 ( u ,v ) / 2 D0
(b)Lc thng thp Butterworth vi D0=15 H (u, v) = e
(c) Lc thng thp Gauss vi D0=15
Lc thng cao
H hp (u, v) = 1 H lp (u, v) F(u, v)H hp (u, v) = F(u, v)"#1 H lp (u, v)$%

F(u, v)H hp (u, v) = F(u, v) F(u, v)H lp (u, v)

fhp (x, y) = f (x, y) flp (x, y)

0 1 0
1 5 1

0 1 0
Lc thng cao
Lc thng cao l tng
"$ 0 if D(u, v) D
0
H (u, v) = #
$% 1 if D(u, v) > D0
Lc thng cao Butterworth
1
H (u, v) =
1+ (D0 / D(u, v))2n
Lc thng cao Gauss

D 2 (u,v)/2 D0
H (u, v) = 1 e
Lc thng cao
(a) Lc thng cao Gauss vi D0=15
(b)Lc thng cao Gauss vi D0=30
(c) Lc thng cao Gauss vi D0=80
Lc High-boost
fhb (x, y) = Af (x, y) flp (x, y)
" 0 1 0 %
$ '
fhb (x, y) = (A 1) f (x, y) + f (x, y) flp (x, y) $ 1 A + 4 1 '
$ 0 1 0 '&
fhb (x, y) = (A 1) f (x, y) + fhp (x, y) #

Vi A=1, nh u ra tng ng vi nh sau lc sc nn. Nu gi


tr ca A tng, vai tr ca fhp gim dn. Gi tr A ln, fhb s
tng ng vi nh u vo nhn vi mt hng s. T ta c

fhb (x, y) = (A 1) f (x, y) + hhp (x, y)* f (x, y)

H hb (u, v) = (A 1) + H hp (u, v)
Laplace trn min tn s
Bin i Fourier ca o hm bc hai
# 2 f (x, y) 2 f (x, y) & 2 2
% 2
+ 2 ( = ( ju) F(u, v) + ( jv) F(u, v)
$ x y '
Ton t Laplace trong min tn s

2 f (x, y) [(u M / 2)2 + (v N / 2)2 ]F(u, v)

nh sau lc sc nt

g(x, y) = 1 { [1+ (u M / 2)2 + (v N / 2)2 ]F(u, v)}


KHI PHC NH
Trn Quang c
H thng khi phc nh
g(x, y)
f (x, y) h(x,y) + w(x,y) f (x, y)

(x, y)
G(u, v) = F(u, v)H (u, v) + N(u, v) v) = G(u, v)W (u, v)
F(u,

Trong h thng trn, ta c f(x,y) l nh u vo, f (x, y) l nh


khi phc tng ng, h(x,y) l hm suy hao v (x,y) l
nhiu, xut hin trong qu trnh thu nhn hoc truyn nh.
Khi phc nh thng qua c on hm suy hao h(x,y) cn
c tn khc l gii chp m.
c on hm suy hao
c on da trn quan st nh c on hm suy hao
bng thng tin thu nhn trc tip t nh. V d, khi phc
nh b nhe v nhiu, ngi ta tin hnh quan st mt vng
nh c cu trc n gin vi gi thit vng nh sau khi khi
phc c nhiu khng ng k.

c on da trn thc nghim s dng thit b tng


t nh thit b thu nhn nh. Thc nghim c lp li nhiu
ln vi cc thng s khc nhau cho n khi nh khi phc gn
tng t vi nh u vo.

c on da trn m hnh ha s dng m hnh ton


hc c on hm suy hao.
Minh ha v m hnh ton hc
nh b nhe do chuyn ng tng i ca vt th so vi thit
b cm ng trong qu trnh thu nhn. Gi thit T l thi gian
m v ng ca trp, x0(t) v y0(t) l cc thnh phn chuyn
ng theo phng x v y. Vi f(x,y) l nh u vo, ta c
T
g(x, y) = f (x x (t), y y (t))dt
0 0
0

Thc hin bin i Fourier biu thc trn,


T
j 2 [ux0 (t )+vy0 (t )]
G(u, v) = F(u, v)e dt
0
Minh ha v m hnh ton hc
T , hm suy hao c th vit nh sau
T
j 2 [ux0 (t )+vy0 (t )]
H (u, v) = e dt
0

Do chuyn ng u y0(t)=bt/T v x0(t)=at/T , nn


T
H (u, v) = sin [ (ua + vb)] e j (ua+vb)
(ua + vb)
Ta c phng php lc ngc vi nh khi phc c dng

G(u, v)
F(u, v) =
H (u, v)
Lc Weiner
Lc Weiner tm W(u,v) sao cho nh khi phc c sai s trung
bnh bnh phng nh nht so vi nh u vo
2
{ v)%
= #$ F(u, v) F(u, & }
2
{
= [ F(u, v) W (u, v)(F(u, v)H (u, v) + N (u, v))] }
Gi thit nhiu c lp vi tn hiu, ta c
2
*
{
= [1 W (u, v)H (u, v)] [1 W (u, v)H (u, v)] [ F(u, v)] }
2
*
{
+W (u, v)W (u, v) [ N(u, v)] }
Lc Weiner
Thc hin o hm v cho gi tr o hm bng 0, ta c

* 2
H (u, v) 1 H (u, v)
W (u, v) = 2
= 2
2 N (u, v) H (u, v) 2 N (u, v)
H (u, v) + H (u, v) +
F(u, v) F(u, v)

Ch rng khi khng c nhiu,


2
N(u, v) 1 1
= = 0 W (u, v) =
F(u, v) SNR H (u, v)
Minh ha lc Weiner
(a) nh gc
(b) nh b nhe
(c) Khi phc nh (b)
(d) nh b nhe v nhiu
(e) Khi phc nh (d) (khng nhiu)
(f) Khi phc nh (d) (c nhiu)

a b c

d e f
PHT HIN V TCH BIN NH
Trn Quang c
Tng quan
Bin nh l tp hp ca nhng im ti gi tr mc xm
thay i cc b t ngt

S bin thin ca mt hm lin tc c xc nh thng qua


o hm.

nh s l mt hm ri rc vi bin l ta trong mt phng


nh. S bin thin v vy phi xc nh thng qua cc o hm
ri rc, gm o hm bc nht (Gradient) v o hm bc hai
(Laplace).
o hm bc nht
Gradient theo hai hng
f f
Gx = Gy =
x y
Bin ca gradient
1/2
)# f &2 # f &2 , # f f &
mag(f ) = +% ( + % ( . mag(f ) = % + (
+*$ x ' $ y ' .- $ x y '

Tnh gradient ri rac

Gx = f (x +1, y) f (x, y) Gy = f (x, y +1) f (x, y)


o hm bc nht

" 1 0 % " 0 1 %
Ton t Robert Gx = $ ' Gy = $ '
# 0 1 & # 1 0 &

" 1 0 1 % " 1 1 1 %
$ ' $ '
Ton t Prewitt Gx = $ 1 0 1 ' Gy = $ 0 0 0 '
$ 1 0 1 ' $ 1 1 1 '
# & # &

" 1 0 1 % " 1 2 1 %
$ ' $ '
Ton t Sobel Gx = $ 2 0 2 ' Gy = $ 0 0 0 '
$ 1 0 1 ' $ 1 2 1 '
# & # &
o hm bc nht

(a) nh gc (b) Ton t Robert

(c) Ton t Prewitt (d) Ton t Sobel


o hm bc nht
Ton t Robert nhy cm vi nhiu v nhng bin thin nh
bin v s dng t im ln cn xp x o hm bc nht.
Ton t Robert p ng cc i vi bin to gc 45o.

Ton t Prewitt v Sobel p ng cc i vi bin ngang hoc


thng ng. Bn cnh tch bin ton t Prewitt v Sobel cn
c th lm trn nhiu.
" 1 0 1 % " 1 %
$ ' $ '"
Gx = $ 1 0 1 ' = $ 1 '# 1 0 1 %&
$ 1 0 1 ' $ 1 '
# & # &
o hm bc nht
Ton t la bn (Kirsch)
c lng gradient ca 8 hng theo mt n tng chp
Kt qu ca tng chp cc i ch hng ca gradient

" 5 5 5 % " 3 5 5 % " 3 3 5 % " 3 3 3 %


$ ' $ ' $ ' $ '
$ 3 0 3 ' $ 3 0 5 ' $ 3 0 5 ' $ 3 0 5 '
$ 3 3 3 ' $ 3 3 3 ' $ 3 3 5 ' $ 3 5 5 '
# & # & # & # &

" 3 3 3 % " 3 3 3 % " 5 3 3 % " 5 5 3 %


$ ' $ ' $ ' $ '
$ 3 0 3 ' $ 5 0 3 ' $ 5 0 3 ' $ 5 0 3 '
$ 5 5 5 ' $ 5 5 3 ' $ 5 3 3 ' $ 3 3 3 '
# & # & # & # &
o hm bc nht

(a) nh gc (b) Ton t Kirsch

" Gy %
1
= tan $ ' Ton t Kirsch c th tm trc tip hng ca Gradient
# Gx &
o hm bc hai
2 2
f f 2 f
2 f = 2 + 2 2
= f (x 1, y) + f (x +1, y) 2 f (x, y)
x y x

2 f
2
= f (x, y 1) + f (x, y +1) 2 f (x, y)
y

" 0 1 0 % " 0 1 0 % " 1 1 1 % " 1 1 1 %


$ ' $ '$ '$ '
$ 1 4 1 ' $ 1 4 1 ' $ 1 8 1 ' $ 1 8 1 '
$ 0 1 0 ' $ 0 1 0 ' $ 1 1 1 ' $ 1 1 1 '
# & # &# &# &
o hm bc hai
Ton t Laplace nhy cm vi nhiu v khng h
tr tm c hng ca ng bin. Ton t
Laplace c s dng xc nh v tr ca mt
im nh thuc vng ti hoc vng sng ca bin.
Laplace of Gaussian
r2
2
h(r) = e 2 vi r2=x2+y2 v c gi l lch chun

2
# 2 2& r
r
2 h(r) = % 4 ( e 2 2

$ '

0 0 1 0 0
0 1 2 1 0

1 2 16 2 1

0 1 2 1 0
0 0 1 0 0
Phng php Canny
1) Lc lm trn nhiu vi mt n Gauss (5x5)
! 2 4 5 4 2 $
# &
r2 4 9 12 9 4 &
h(r) = e

2 2 1 ##
H= 5 12 15 12 5 &
159 #
# 4 9 12 9 4 &&
#" 2 4 5 4 2 &%

2) Tnh bin v hng ca gradient


" Gy %
1
G = Gx + Gy = tan $ '
# Gx &
Phng php Canny
3) Xa im bin khng phi cc i theo hng gradient
4) Phn loi im bin (r, m, rt m) da theo ngng
5) Kt ni cc im bin m thuc ln cn im bin r

2 3 5 4 6 2 3 5 4 6 2 3 5 4 6

6 5 18 18 16 6 5 18 18 16 6 5 18 18 16

5 11 4 3 2 5 11 4 3 2 5 11 4 3 2

16 4 4 4 3 16 4 4 4 3 16 4 4 4 3

5 4 3 2 12 5 4 3 2 12 5 4 3 2 12
Phng php Canny

a b c

(a) Phng php Canny


(b)Laplace of Gaussian
(c) Ton t Sobel
PHN VNG NH
Trn Quang c
Tng quan
Mt vng nh l tp hp ca cc im nh c cng chung mt
hoc nhiu thuc tnh v i tng trong nh.

Phn vng nh l mt trong nhng nhim v kh khn nht


ca x l nh. Trong mt s trng hp, ngi ta s dng cc
thit b c bit, v d my chp nh hng ngoi tng hiu
qu ca qu trnh phn vng.

Qu trnh phn vng da trn hai tnh khng lin tc v tnh


ng nht ca im nh. Cc phng php gm phn vng
da trn bin nh, phn vng da trn ngng v phn vng
da trn min nh.
Phn vng da trn bin nh
Bin nh l tp hp ca nhng im nh nm trn ranh gii
gia hai vng nh. Bin nh c xc nh da trn cc
phng php o hm bc nht (gradient) v o hm bc hai
(laplace).

Tm bin thng qua o hm thng to ra bin khng khp.


Nhiu cng to ra cc im bin gi, gy kh khn cho qu
trnh phn vng nh.

Kt ni cc im bin c th da trn cc phng php x


l cc b hoc x l ton cc s dng bin i
Hough.
Phng php x l cc b
Cho im bin (x0,y0), im nh (x,y) thuc ln cn ca
(x0,y0) c kt ni vi (x0,y0) nu

f (x, y) f (x0 , y0 ) E (x, y) (x0 , y0 ) A

Vi E v A l cc gi tr ngng. Qu trnh trn c lp li


vi tt c cc im nh. Cc ln cn c xem xt thuc mt
n kch thc 3x3 hoc 5x5.

K thut x l cc b khng tnh n lch s tm kim nn c


th to ra cc im bin gi.
Phng php x l ton cc
K thut x l ton cc tm ng thng xp x i qua n im
nh. Gi s ng thng i qua im nh (xi,yi) c dng
yi=axi+b, ta c th vit b=yi-axi. T , ng thng c tm
kim trn mt phng tham s ab.
b bmin bmax
amin
(xi,yi)

y=ax+b a
amax
(xjyj)
Phn vng da trn ngng
1) Chn gi tr khi to T0
2) Chia vng nh da theo T0 (G1 v G2)
3) Tnh 1 v 2 tng ng ca G1 v G2
4) Tnh ngng mi T1 = (1 + 2)/2
5) Lp li cc bc 2-4 n khi Ti-Ti-1<Th

"$ 1 If f (x, y) > T


g(x, y) = #
$% 0 If f (x, y) T

T
Phn vng da trn hm xc sut
p(z) = P1 p1 (z) + P2 p2 (z)

P1 + P2 = 1
T T
E1 (T ) = p (z)dz
2 E2 (T ) = p (z)dz
2
T

(zi )2

1 2 i2
E(T ) = P2 E1 (T ) + P1E2 (T ) pi (z) = e
2 i
E 1 + 2 2 " P2 %
= 0 P2 p1 (T ) = P1 p2 (T ) T= + ln $ '
T 2 1 2 # P1 &
Phng php ci thin Histogram
Nhn xt: Ngng thng c chn da trn lc mc
xm. Do , ci thin lc mc xm c th tng hiu qu
ca qu trnh phn vng.

Ci thin lc mc xm bng cch ch xem xt nhng im


nh nm ln cn bin gim s chnh lch s lng im
nh gia cc vng.

Nhc li: o hm bc nht (gradient) cho php xc nh


bin nh trong khi o hm bc hai (laplace) xem xt mt
im nh thuc vng ti hay vng sng ca bin.
Phng php ci thin Histogram
$ 0 If f < T
&&
s(x, y) = % + If f T and 2 f 0
& 2
&' If f T and f < 0

im nh khng thuc bin nh hoc ln cn ca bin nh


c k hiu 0. im nh ln cn ca bin nh thuc vng ti
c k hiu +. im nh ln cn ca bin nh thuc vng
sng c k hiu -.

Bin nh ti nhng im c bc chuyn (-,+) hoc (+,-).


Phn vng da trn min nh
Vng nh l tp hp ca cc im nh c cng chung mt
hoc nhiu thuc tnh v i tng trong nh

Phn vng nh l qu trnh chia tp cc im nh thnh


nhng tp con Ri tha mn cc iu kin sau

X = Ri Ri R j = i, j , i j

P( Ri ) = TRUE P( Ri R j ) = FALSE

Ri
Phng php gia tng vng
Phng php gia tng vng xt ln cn ca nhng im nh
ht ging. Nu chng tha mn iu kin v tng ng
th hp li thnh mt vng.

9 9 1 1 1 2 2 1 f (x, y) f (x0 , y0 ) 2
8 9 9 8 1 1 1 1
7 9 9 8 1 2 1 1 S dng quan h 4-ln cn
8 9 9 6 1 1 2 1
9 8 8 9 1 2 2 1
8 8 8 9 1 1 2 1
8 9 8 9 1 2 1 2
Phng php chia v hp vng
Phng php chia v hp vng s dng phng php phn tch
cy t phn chia nh thnh vng nh. Nhng vng nh ln cn
c hp li nu chng tha mn iu kin v tng ng.

R1 R2 R3 R4

R21 R22 R23 R24


X L A PHN GII
Trn Quang c
Bin din a phn gii
Bin din a phn gii biu din chui
nh c phn gii gim dn theo quy lut
da trn cu trc thp.
1x1 Mc 0
Biu din a phn gii c ng dng trong
Mc 1
phn vng nh v nn nh.
2x2
nh ti mc j kch thc 2jx2j, 0jJ

Dung lng lu tr J+1 mc


Mc J
2 1 1 4 2
N (1+ +... + J ) N NxN
4 4 3
Biu din a phn gii

Analysis
2 Mc j-1
Filter

Synthesis
Filter

Mc j +- Mc j
Bin i Haar
Bin i Haar c tnh i xng v phn tch T=HFH. to
ra H, ta nh ngha s nguyn k, k=2p+q-1,vi 0pn-1, q=0
hoc 1 nu p=0 v 1q2p nu p0.

1
h0 (z) = h00 (z) = ,z [0,1]
N
$ p/2
&& 2 (q 1) / 2 p z < (q 0, 5) / 2 p
1
hpq (z) = % 2 p/2 (q 0, 5) / 2 p z < q / 2 p
N&
&' 0 Otherwise, z [0,1]
Bin i Haar
Nu N=4, gi tr k, p, q nh sau

k p q
1 " 1 1 %
0 0 0 H2 = $ '
2 # 1 1 &
1 0 1
2 1 1
3 1 2 " 1 1 1 1 %
$ '
1 $ 1 1 1 1 '
H2 ~ B lc phn tch QMF H4 =
4$ 2 2 0 0 '
$ '
G0 (z) = H 0 (z) G1 (z) = H 0 (z) $# 0 0 2 2 '&
Bin i Wavelet ri rc
Gi tr ca mt hm ri rc c th biu din thnh chui cc h s

1 1
W ( j0 , k) =
M
f [n] j0 ,k [n] W ( j, k) = f [n] [n]
j,k
n M n


1 1
f [n] =
M
W ( j0, k) j0 ,k [n] + M W ( j, k) j,k [ n ]
k j= j0 k

M=2J, x=0,1,2,, M-1; j=0,1,2,, J-1 v k=0,1,2,,2j-1.

V d: f(0)=1, f(1)=4, f(2)=-3, f(3)=0


Bin i Wavelet nhanh
Trong bin i Wavelet nhanh, cc h s c th xc nh nh sau

W ( j, k) = h (n)W ( j +1, n) W ( j, k) = h (n)W ( j +1, n)

vi n=2k (k0)

h(-n) 2 W(j,n)
W(j+1,n)

h(-n) 2 W(j,n)
Minh ha
V d: f(0)=1, f(1)=4, f(2)=-3, f(3)=0

h(-n) 2 1
h(-n) 2
h(-n) 2 4

f [ n ] = [1, 4, 3, 0 ]
h(-n) 2
"3 2, 3 2 $
# %
Bin i Wavelet nhanh 2 chiu

h(-m) 2 LL

h(-n) 2

h(-m) 2 LH
f(m,n)

h(-m) 2 HL

h(-n) 2

h(-m) 2 HH
X L NH NH PHN
Trn Quang c
Khi nim
nh nh phn gm nhng im nh c gi tr 0 v 1. Gi tr 0
biu din im nh thuc i tng nh (im nh en). Gi
tr 1 biu din im nh thuc nn (im nh trng).

"$ 1 If f (x, y) T
g(x, y) = #
%$ 0 If f (x, y) < T
L thuyt tp hp
A l mt tp hp thuc khng gian Z2. Mt phn t a=(a1,a2)
thuc A c k hiu
aA
Tng t, nu phn t a khng thuc A, ta k hiu

aA
Nu A khng cha mt phn t no, A l tp rng
A=
L thuyt tp hp
A l tp con ca B AB
Hp ca hai tp hp A v B C = AB

Giao ca hai tp hp A v B C = AB
Phn b ca tp hp A A c = {w | w A}
Hiu ca hai tp hp A v B A B = {w | w A, w B}

Phn chiu ca tp hp A A = {w | w = a, a A}
Dch tp hp A vi z=(z1,z2) (A)z = {c | c = a + z, a A}
L thuyt tp hp

A
B AB AB

z1

z2

AB (A)z
c
A
Ton t Logic

A B AANDB AXORB

NOT A AORB [ NOT A]ANDB


Ton t hnh thi
Ton t hnh thi l cng c ton hc x l hnh dng
trong nh. Ton t hnh thi s dng hng tip cn l
thuyt tp hp.

Ton t hnh thi bao gm php co (erosion), php dn


(dilation), php m (opening), php ng (closing).

Ton t hnh thi c ng dng trong tch bin nh,


lp y vng nh, to kt ni gia cc vng nh hoc lm
xng nh.
Php dn v php co
Php dn Php co

A B = {z | ( B)z A } A!B = {z | (B)z A}

AB A!B
Php m
Php m xa b nhng on mnh, loi b nhiu nhng lm tng s on t gy

A ! B =B
(A!B)

A!B A!B
Php ng
Php ng c th lm trn bin nh v kt ni cc vng ca cng mt i tng.

A B = (A B)!B

A!B A!B
Tch bin nh
(A)=A - (A!B)
Lp y vng nh

X k = (X k1 B) A c ,k = 1, 2, 3...
Lp qu trnh trn n khi Xk-1=Xk

B A Ac X0

X1 X2 X7 X7 A
Lp y vng nh

nh gc Lp y mt vng nh Lp y vng nh
M HA V NN NH
Trn Quang c
Dung lng thng tin
Mt trang vn bn: 2 KB.

Mt nh mu (800x600x24): 1,4 MB

30 pht m thanh thoi s (8 kHz, 8 bits): 14 MB

30 pht audio CD (44,1 kHz, 16 bits, stereo): 316 MB

30 pht video (800x600x24, 25 khung hnh/s): 64,8 GB


Khi nim
Nn d liu nh: Bin i dng thng tin nh thnh t m
nhm gim d tha thng tin. Cc phng php nn khc
nhau do nh ngha cc kiu d tha thng tin khc nhau.

Cc kiu d tha thng tin gm: s phn b mc xm (M


Huffman), s lp li ca cc mc xm (RLC), nhng mu s
dng tn xut cao (LZW) hoc d tha v tr (m ha d
on)

T l nn=1/r (%) trong r l kch thc d liu gc chia


cho kch thc d liu sau nn
Phn loi phng php nn
Cch 1 (Da trn nguyn l nn)
Nn khng mt mt thng tin
Nn mt mt thng tin

Cch 2 (Da trn cch thc thc hin nn)


Phng php khng gian
Phng php da trn bin i

Cch 3 (Da trn trit l m ha)


Phng php nn th h th nht
Phng php nn th h th hai
M lot di
Thay bng vic truyn i mt chui 0 hoc 1, c th truyn
di ca chui.

Trong d liu fax, 70%-80% khng gian l cc im nh c gi


tr 0 (im nh trng). V th m lot di hot ng rt hiu
qu. C th thay th di chui bng mt s nguyn c kch
thc c nh.

M lot di t ra km hiu qu nu tn sut xut hin ca gi


tr 1 (im nh mu en) tng.

11111111111000000000000011111 11,1,13,0,5,1
M Huffman
M Huffman: Phng php nn d trn m hnh thng k
xem xt sc xut phn b ca k t. M hnh xc nh sc xut
c th l m hnh tnh, thch nghi hoc bn thch nghi (semi-
adaptive).

M hnh tnh c tch hp sn trong thit b nn v thit


b gii nn.

M hnh bn thch nghi l m hnh c nh c xy dng


t d liu c nn.

M hnh thch nghi thay i trong qu trnh nn.


Thut ton c bn
Cc k t c tn sut xut hin khc nhau.

Cc k t chim khng gian biu din khc nhau.

K t vi di t m nh phn c nh trong bng m ASCII


c thay bng t m c di thay i.

T m ngn c gn cho cc k t vi tn sut xut hin cao


trong vn bn hoc tp vn bn.

B m to ra c tnh cht tin t.


Thut ton c bn
1) Qut vn bn thng k tn sut xut hin ca cc k t.

2) Xy dng cy m Huffman da trn thng k tn sut. Mi


k t c biu din bng mt nt l. Nt l xa gc c
gn cho k t t xut hin.

3) T m biu din k t c ly thng qua ng dn t gc


n nt l tng ng. Nhnh r tri v nhnh r phi c
k hiu bi bit 0 v 1.
Minh ha
BCAACADBDCADAEEEABACDBACADCBADABEABEAAA

(39)
0 1

A(15) (24)
0 1

(13) (11)
0 1 0 1

B(7) C(6) D(6) E(5)


M s hc
Chui k t c gn bi mt t m s hc duy nht. di
ca t m t l thun vi di ca chui k t. M s hc
cn phi c bn tin c bit phn bit gia cc t m.

1 0.2 0.08 0.072 0.0688


a4 a4 a4 a4 a4
0.06752

a3 a3 a3 a3 a3

a2 a2 a2 a2 a2

a1 a1 a1 a1 a1
0 0 0.04 0.056 0.0624
M t in Lempel-Ziv
M t in xy dng t m mi cho mt chui cc t m.

V d: Bng m ASCII mi t m c di 8 bit, cho php


m ha 256 k t.

M t in m rng th vin vi t m c di t 9 n 12
bit. T m mi l chui cc t m xut hin.

M t in hot ng khng hiu qu vi vn bn gm nhng


chui k t ngn v khc nhau.
Minh ha
Xt chui k t sau: ABCBCABCABCD
Previous Input Output Symbol Index Previous Input Output Symbol Index
Input Input
NIL A NIL A A
A B A AB 256 A B B AB 256
B C B BC 257 B C C BC 257
C B C CB 258 C 257 BC CB 258
B C BC 256 AB BCA 259
BC A BC BCA 259 AB C C ABC 260
A B C 260 ABC CA 261
AB C AB ABC 260 ABC D D ABCD 262
C A C CA 261
A B
AB C
ABC D ABC ABCD 262
D EOL D
Minh ha
M t in c s dng trong nn nh graphic interchange
format (GIF), tagged image file format (TIFF) v portable
document format (PDF). nh a mc xm s dng 8 bit/
pixel.

39 39 126 126
39 39 126 126 39-39-126-126-256-258-260-259-257-126
39 39 126 126
39 39 126 126
NN NH FAX
Trn Quang c
Chun nn
ITU-T Nhm 1,2
K thut iu ch: FM, AM, PM
Mu trng: 1300 Hz, 1500 Hz
Mu en: 2100 Hz, 2400 Hz

ITU-T Nhm 3: my fax c thit k hot ng trong


mng PSTN (9600 baud).

ITU-T Nhm 4: My fax c thit k hot ng trong


mng ISDN (64K baud).
ITU-T Nhm 3
Hng qut: Tri sang phi, Trn xung di

rng ng qut: 215 (255, 303)

S lng pixel trn mt ng: 1728 (2048, 2432)

M ha: RLC+MH (MMR - Nhm 4, Ty chn nhm 3)

T l nn: 5%-20% ca kch thc ban u (n 95%)


M Huffman hiu chnh
Lot im nh trng c di 1664 c thay th bng
t m ngn 011000.

M Huffman c hiu chnh m ha nhng lot


im nh c di l bi s ca 64.

di ca lot im nh c th biu din bng mt t


m hoc mt vi t m (trong trng hp lot qu di).
M Huffman hiu chnh
Run Length White Code Word Black Code Word

0 00110101 0000110111

1 000111 010

2 0111 11

3 1000 10

4 1011 011

5 1100 0011

61 00110010 000001011010

62 00110011 000001100110

63 00110100 000001100111
M Huffman hiu chnh
Run Length White Code Word Black Code Word

64 11011 0000001111

128 10010 000011001000

192 010111 000011001001

256 0110111 000001011011

320 00110110 000000110011

384 0110111 000000110100

2432 000000011101 Same as white

2496 000000011110 Same as white

2560 000000011111 Same as white


M Huffman hiu chnh
Lot gm 5 im nh trng c m ha 1100

Lot gm 69 im nh trng c m ha: 64+5

Lot gm 64 im nh trng c m ha: 64+0

Lot gm 2561 im nh trng c m ha: 2560+1

T m EOL: 000000000001
M Huffman hiu chnh
Khng c lot c di 0. Ti sao vn c t m cho lot gm 0
im nh trng v 0 im nh en?

Thng mt dng qut c kch thc 8.5 inch tng ng


1728 im nh, ti sao vn c m cho nhng lot c di
2561?

Lot gm 5 im nh en c m 0011, cng l tin t ca lot


gm 61, 62 hoc 63 im nh trng. Gii thch l do!

Tm t s nn ca nh gm cc im nh en v trng nm
xen k nhau.
NN NH JPEG
Trn Quang c
Gim mu knh mu
Gim mu knh mu
4:4:4 (1:1)
Thit b qut phim cao cp
in nh
4:2:2 (3:2)
inh dng video cao cp
4:1:1 (2:1)
DVCPRO (v d NTSC, PAL )
4:2:0 (2:1)
MPEG, m ha video H.26X
DVD, Blue-ray
JPEG, MJPEG
Chun JPEG
JPEG l chun nn nh, c pht trin bi Joint
Photographic Experts Group.

JPEG l nh dng thng c s dng trong lu v


truyn nh.

JPEG nn c trn c nh mu v en trng

T l nn 1:10 nhng khng nh hng nhiu n cm


nhn ca mt ngi.
Chun JPEG
JPEG l k thut nn mt mt thng tin da trn bin
i 2D-DCT (Discrete Cosine Transform).

Nhn nh 1: Ni dung nh thay i tng i chm trn


b mt ca nh.

Nhn nh 2: Mt ngi nhy cm hi vi nhng mt


mt thuc v thnh phn tn s thp.

Nhn nh 3: Mt ngi cm nhn tt hn s thay i v


chi so vi mu sc.
Chun JPEG
88 blocks

Entropy Compressed Image


FDCT Quantization Encoding

Source Image
Quant. Table Huffman Table

88 blocks

Entropy
IDCT Dequantization Decoding

Source Image
Quant. Table Huffman Table
Bin i DCT
DCT bin i tn hiu nh t min khng gian sang min tn
s. Nng lng nh tp chung ch yu cc thnh phn tn
s thp, nm gc trn cng bn tri ca DCT. Cc thnh phn
tn s cao thng c gi tr thp trong bin i DCT nn c
th loi b tng hiu qu ca qu trnh nn.

M 1 N1
4Ck Cl ! (2k +1)u $ ! (2l +1)v $
F(u, v) =
MN
f (x, y)cos #" 2M &% cos #" 2N &%
k=0 l=0

!# !#
1/ 2 If k = 0 1/ 2 If k = 0
Ck = " Cl = "
#$ 1 Otherwise #$ 1 Otherwise
Bin i DCT
52 55 61 66 70 61 64 73 -145 -30 -61 27 56 -20 -2 0

63 59 55 90 109 85 69 72 4 -22 -61 10 13 -7 -9 5

62 59 68 113 144 104 66 73 --47 7 77 -25 -29 10 5 -6

63 58 71 122 154 106 70 69 DCT -49 12 34 -15 -10 6 2 2

67 61 68 104 126 88 68 70 12 -7 -13 -4 -2 2 -3 3

79 65 60 70 77 68 58 75 -8 3 2 -6 -2 1 4 2

85 71 64 59 55 61 65 83 -1 0 0 -2 -1 -3 4 -1

87 79 69 68 65 76 78 94 0 0 -1 -4 -1 0 1 2

Thnh phn DC (i.e., F(0,0)) v AC (i.e., F(u,v) (u,v0)) u


l s nguyn, c gi tr nm trong khong t -1024 n 1023.
Lng t ha
Lng t ha loi b nhng thng tin tha trong nh. Lng t ha
l nguyn nhn ch yu dn n mt mt thng tin trong cc k
thut da trn bin i DCT.

FQ(u,v)=Integer Round (F (u,v)/Q(u,v))

Quantization step size

Bc lng t ha c chn da trn cm nhn ca mt ngi.


N l hm vi cc bin gm c trng nh, c trng hin th v
khong cch hin th.

Trong ng dng, bc lng t ha thng c xc nh da trn


thc nghim.
Lng t ha
16 11 10 16 24 40 51 61 -26 -3 -6 2 2 -1 0 0

12 12 14 19 26 58 60 55 0 -2 -4 1 1 0 0 0

14 13
Tn
16
s 24tng40dn57 69 56 -3 1 5 -1 -1 0 0 0

14 17 22 29 51 87 80 62 -4 1 2 -1 0 0 0 0

18 22 37 56 68 109 103 77 1 0 0 0 0 0 0 0

24 35 55 64 81 104 113 92 0 0 0 0 0 0 0 0

49 64 78 87 103 121 120 101 0 0 0 0 0 0 0 0

72 92 95 98 112 100 103 99 0 0 0 0 0 0 0 0

Nhng thnh phn tn s cao thng c gi tr bng 0 hoc


rt nh (k c gi tr m v gi tr dng) nn c th c
biu din bng mt vi bit.
M ha Entropy
DC DPCM
Huffman
FQ(u,v) coding 01101
AC RLC

M ha Entropy l dng c bit ca nn khng mt mt


thng tin.

M ha Entropy gm cc bc sau: (1) sp xp cc thnh


phn nh theo ng dc dc; (2) m ha cc thnh phn nh
bng m lot di (RLC) v Huffman.
ng dc dc
-26 -3 -6 2 2 -1 0 0 -26 -3 -6 2 2 -1 0 0

0 -2 -4 1 1 0 0 0 0 -2 -4 1 1 0 0 0

-3 1 5 -1 -1 0 0 0 -3 1 5 -1 -1 0 0 0

-4 1 2 -1 0 0 0 0 -4 1 2 -1 0 0 0 0

1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Tt c cc h s u nm trn ng dc dc. Cc thnh phn


tn s thp (thng khc 0) c xp trc cc thnh phn
tn s cao.
DPCM v M lot di
Cc thnh phn DC ca cc khi nh ln cn c tnh
tng quan cao. V vy, m ha s sai khc gia cc
thnh phn trn lm tng tnh hiu qu ca qu trnh
nn.

DCi-1 DCi

DIFF = DCi - DCi-1

M lot di c s dng m ha cc thnh phn AC


DPCM v M lot di
Thnh phn DC: +3 (2),(3) -26 -3 -6 2 2 -1 0 0

Thnh phn AC: 0 -2 -4 1 1 0 0 0

(0,2) (-3) -3 1 5 -1 -1 0 0 0
(1,2) (-3) -4 1 2 -1 0 0 0 0
(0,2) (-2)
1 0 0 0 0 0 0 0
(0,3) (-6)
0 0 0 0 0 0 0 0
(0,2) (2)
0 0 0 0 0 0 0 0

(0,0) EOB 0 0 0 0 0 0 0 0

Cc thnh phn AC c m t bi mt cp k hiu (lot di, kch


thc) (bin ). Lot di c tnh bng s lng 0 gia hai thnh
phn khc 0. Kch thc biu din s lng bit dng m ha gi
tr bin .
M Huffman
Thc hin tng hiu qu nn bng vic thay th nhng
chui k t di bng nhng t m ngn.

di ca mi t m c xc nh da trn tn sut
xut hin ca cc k t.

JPEG cung cp bng m Huffman chun, nhng bng


m Huffman cng c th c nh ngha ring ty
thuc vo ng dng v c trng ca cc nh s dng
trong ng dng.
M Huffman
Category Values Bits for the value
1 -1,1 0,1
2 -3,-2,2,3 00,01,10,11
3 -7,-6,-5,-4,4,5,6,7 000,001,010,011,100,101,110,111
4 -15,...,-8,8,...,15 0000,...,0111,1000,...,1111
5 -31,...,-16,16,...31 00000,...,01111,10000,...,11111
6 -63,...,-32,32,...63 000000,...,011111,100000,...,111111
7 -127,...,-64,64,...,127 0000000,...,0111111,1000000,...,1111111
8 -255,..,-128,128,..,255 ...
9 -511,..,-256,256,..,511 ...
10 -1023,..,-512,512,..,1023 ...
11 -2047,..,-1024,1024,..,2047 ...

Gi tr v s lng bit cho mi gi tr


M Huffman
Run, category Code Length Codeword
0,0 4 1010
0,1 2 00
0,2 2 01
...
0,10 16 1111111110000011
1,1 4 1100
1,2 5 11011

15,10 16 1111111111111110

Bng m Huffman chun cho cc thnh phn AC ca knh chi


M Huffman
Category Code Length Codeword
0 2 00
1 3 010
2 3 011
3 3 100
4 3 101
5 3 110
6 4 1110
7 5 11110
8 6 111110
9 7 1111110
10 8 11111110
11 9 111111110

Bng m chun cho cc thnh phn DC ca knh chi


M Huffman
Thnh phn DC: +3 (2),(3)

T m ca thnh phn DC: 011 11

Thnh phn AC: (0,2) (-3), (1,2) (-3) EOB

T m ca thnh phn AC: 01 00 11011 00 00


Minh ha

1 2 3

1. Q = 100 - 83,2 bytes


2. Q = 50 - 15,1 bytes
3. Q = 25 - 9,5 bytes
4. Q = 10 - 4,7 bytes
5. Q = 5 - 1,5 bytes

4 5
NN NH JPEG2000
Trn Quang c
Chun nn khc?
Vi t l nn cao (v d 0.25 bpp), mo ca chun JPEG l
khng th chp nhn.

JPEG c 44 cch thc, rt nhiu trong s khng c s


dng trong b m ha JPEG.

Cht lng ca nh gim i r rt nu xut hin li trong qu


trnh truyn nh.

JPEG c ti u ha cho nh t nhin nhng khng ph


hp vi nh ha.

JPEG khng p dng c cho nh nh phn.


Chun JPEG2000
c trng
Bin i sng con Wavelet
Cht lng tt vi t l nn cao
Nn nh nh phn
Nn mt mt v khng mt mt thng tin
Linh hot vi li trong qu trnh truyn
C kh nng m rng
Chn vng quan tm ROI
Mt vi ng dng
Website
Camera k thut s
nh y hc
nh vin thm
Chun JPEG2000
Lossless
5.2 bpp

Lossy
b
Original image it
s
t
r
e
a
m

1.89 bpp
Chun JPEG2000

0.125 bpp

JPEG vs. JPEG2000

0.25 bpp
Chun JPEG2000
Nhc im
Thit b m ha v gii m phc tp, thi gian tnh ton lu.

Khi t l nn khong 1:25, JPEG2000 so vi JPEG c th


to ra nh nn t b chia nhng gim ang k cc chi tit
nh.

You might also like