TRNG I HC BCH KHOA H NI

VIN O TO SAU I HC

TIU LUN
K THUT TRI PH V NG DNG
ti: GIU THNG TIN BN VNG S DNG K

THUT TRI PH TRONG C S D LIU KHNG GIAN

Ging vin hng dn H c vin MSHV Lp : : : : PGS.TS NGUYN HU TRUNG NGUYN NGC ANH CB111487 KTTT1B

H Ni, thng 02/2012

Giu thng tin bn vng s dng k thut tri ph trong c s d liu khng gian
A Robust Watermarking Algorthm for Space Data Using Spread Spectrum Technic

Abstract: This paper proposes a digital watermarking algorithm for space data using spread spectrum technic. A watermark bit is embedded by changing a parity of the pseudo-random noise vector. The algorithm is established for robust resistance against additive random noise, similarity transformation, and vertex insertion/removal, and, to some extent, cropping. Same experimental results are expounded in order to illustrate practicability of the method.

I. T VN Nhiu phng php giu thng tin ang c nghin cu, mi phng php c nhng u im, nhc im v ng dng khc nhau. Phng php s dng cc bt trng s nh [4,6] n gin tuy nhin thng tin giu khng bn vng trc nhiu hnh thc tn cng. Phng php s dng cc h s bin i (chng hn bin i t min khng gian sang min tn s nh DCT [3], wavelet [2], DFT [5]...) ni chung c tnh bn vng cao, tuy nhin kh phc tp trong ci t v kh kim sot cht lng d liu s dng lm mi trng giu thng tin. Phng php gn v s dng thuc tnh chn l [9] c mt s u im nh n gin trong ci t, d kim sot cht lng mi trng giu tin, c bn vng cao trc nhiu hnh thc tn cng. Phng php ny c hiu qu cao khi p dng cho mi trng giu tin khng chu nn tn hao, c cho php sai s, l mi trng ang c p dng rt rng ri hin nay (cc nh bitmap, cc thit

k k thut, bn s 2 chiu, 3 chiu...) Trong bi ny chng ti trnh by mt phng php mi, c s dng k thut tri ph giu thng tin trong c s d liu khng gian vi mc ch tng cng bn vng v mt ca tin giu. Mc II gii thiu khi nim v thng tin tri ph, ng dng k thut tri ph trong giu thng tin. Mc III trnh by khi nim d liu khng gian, thuc tnh chn l v kh nng mang tin giu ca d liu khng gian. Mc IV trnh by phng php giu thng tin tri ph trong m hnh d liu khng gian. Mc V minh ha mt s kt qu th nghim trn mi trng bn s 2D. II. K THUT THNG TIN TRI PH Tri ph c bit n trong k thut thng tin lin lc nh mt phng thc truyn tin. c im ca h thng truyn thng tri ph l rng ph ca tn hiu b "tri" ra, ln hn nhiu ln so vi tc bit ca thng tin cn truyn. d tha ca bng thng c s dng nh mt tim nng cho cc phng php lp m t sa sai, dn n kh nng chng nhiu cao ca h thng thng tin tri ph so vi cc phng php truyn tin khc. Mt thnh phn quan trng trong k thut truyn tin tri ph chnh l chui gi ngu nhin. V chui ny mang c trng ca nhiu nn tn hiu tri ph c u th v bo mt. Cc u im trn c khai thc trong cc h thng truyn tin trong mi trng c nhiu v i hi tnh bo mt cao

ca thng tin, c bit trong cc h thng a truy nhp nh in thoi di ng, mng truyn d liu khng dy. u th ny c mt s tc gi khai thc trong k thut giu thng tin trong mi trng d liu multimedia [1]. Vn c bn cn gii quyt trong k thut truyn thng tri ph l tnh ng b. Qu trnh gii iu ch tng quan s khng cn ngha nu tn hiu thu c v chui gi nhiu khng ng b vi nhau. M hnh d liu khng gian v phng php giu tin n gin s dng thuc tnh chn l c xut trong [9] v c tm tt trong mc III. III. M HNH D LIU KHNG GIAN . 1. Khi nim v d liu khng gian Quy c s dng cc k t c gch ngang trn v hai k hiu i v i (khng c du gch ngang trn) l cc vect. Ch s di k hiu th t cc phn t ca mt tp hp, ch s trn (nu c) k hiu cc thnh phn ca vect. Ta quy c gi c s d liu (CSDL) m trong mi bn ghi l mt vect thuc khng gian n chiu R(n) ( R ( n) ) l c s d liu khng gian. V mt hnh hc, mi vect ny c biu din thng qua mt "im" thuc khng gian R (n ) . Vi 1 R (n) ,

thuc c s d liu khng gian. Mc ch ca chng ta l xy dng phng php giu mt bit thng tin vo khi hp m , M mi j{1..n}. Chia khng gian thnh cc khi hp n v nh sau: Chn gi tr R , = f ( K ) , (f l mt hm c bin ph thuc kho K), . Vi mi i R ( n)
j xy dng vect i = xi vi mi j{1..n}- tc l

ni trn, vi gi thit r j vi

i Z (n) hay i thuc khng gian vect vi cc ta

nguyn, ni cch khc, i l nh ca i khi nh

x i vo khng gian vect ta nguyn. K hiu (khng c ch s) nh tp hp mi vect thuc khng gian vect ta thc v (khng c ch s) nh tp hp mi vect thuc khng gian vect ta nguyn. trnh s dng qu nhiu k hiu, ta cng quy c dng cc cm t "vect " hay " " ch mt vect ta nguyn v "khng gian " ch khng gian ta nguyn n-chiu. To mt phn hoch ca khng gian

2 R (n) v R, 0, ta xy dng mt -quan h

( ) nh sau:

= U{ c , l }, trong :
nu - { c }

i i 1 2 i = 1..n; 1 2 .

l s chn;
j =1 l s l. j =1
n j x

n j x

- { l } nu

Khi mang ngha ca sai s cho php. K hiu

r m , M m ,M = m + r

l mt

Nhn xt: Tnh chn l ca thay i khi c mt

khi hp n-chiu c gii hn bi im di tri

2 n 2 n v im trn phi M ( x1 m ( x1 M , xM ,..xM ) , m , xm ,..xm )

ta no thay i mt n v - hay mt bc .
Trng hp tng qut, tnh chn l ca thay i khi thay i t 1 sang 2 nu tng s bc thay i ca mi ta ca l:

j j trong xM = xm + r j . Ta ni nh i m , M

nu

j j j { 1..n}, xm xij xM

. Gi thit trong khi hp

ny c cha D nh (hay node) - l cc bn ghi

j j n x2 x1 l mt s l. = j =1

(1)

dng lm mi trng cha tin giu). Gi thit i V c phn phi chun, c lp thng k. Chn gi tr R tho iu kin:

Khng gian c chia thnh cc khi n-chiu chn l xen k nhau (theo mi chiu ca khng gian). Ta gi mi khi ny l mt khi chn l n v, hay khi hp n v, k hiu l .

= l. ; l N + ; 2
Chn cc cnh ca khi m , M c cha s nguyn ln cc on :
j = 1..n k j = rj

(2)

sao cho mi cnh

tp { c }), vi bc . Bng cch ny, ta gn cho

v hiu rng i thuc tp { l } (tng ng, i thuc

l } (tng ng i { c }), Ta quy nh vit i {

N+

(3)

Khi ta c th chia siu khi hp m , M thnh

i mt thuc tnh chn l ng vi mt n v (hay

mt bc) .

= k j siu khi vung c kch thc .

j =1

K hiu siu khi vung ny l v tp

2. Th tc thay i tnh chn l trn khng gian vect vi cc ta nguyn

Ta c nhn xt sau:

{ ij }, i = 1..n, j = 1..k j l tp c th t cc siu

khi thuc r . iu kin ca l trong (2) m bo cho mi siu khi c cha l n siu khi chn l n v . Nh vy trong mi siu khi r c cha khi vung v h = .l n khi n v . 2) Dng kho giu tin lm mm (seed) sinh mt vect gi ngu nhin wr { 1} ,
( )

i v , k {1..n} : xk xk = min xj xj . ,j { 1..n)}

Th tc Parity_Change (i , v

k If ( xik = xM ) then xik ( xik )

Else: xik ( xik + )

Th tc ny thay i tnh chn l ca i trong khi vn gi cho i v v c s dng trong thut

N + , s

c s dng vi vai tr ca h s tri ph bc 3. 3) Thng tin cn giu b c "tri ph" thng qua php bin i wm b wr :

ton giu thng tin trnh by di y.

IV. K THUT GIU THNG TIN TRI PH TRONG C S D LIU KHNG GIAN 1. Giu thng tin

wm = wr nu (b = 0 )
"tri" thnh bit.

wm = wr nu (b = 1)

(4) (5)

D thy wm { 1}( ) , mi bit thng tin c 4) Xy dng vect c quan h 1/1 vi wm :

s nhm ln, s dng k hiu D = {i i = 1..D} l tp cc ch s ca { } ; V= {i }i m , M , i D (V l tp khng c th t cc vect thuc khi r , c s

1) K hiu thng tin cn giu l b, b {0,1} ; Khng

wm nh sau:

k k { 1.. }, i { 1..n}, j 1..k j , k ij = wm

{ }

Bng cch ny ta gn cho mi thnh phn

( ) k , ni cch khc: { 1} . k mt gi tr ca wm
5) Vi r , to phn hoch

5) Tnh zlc ( , wr ) = 1 .wr = 1 j .w j . j =1

{ }=

+ . Trong + nu:

{ }

Trong zlc , wr l tch v hng (tng quan tuyn tnh) ca v w , n nhn gi tr -1 nu b=0 v nhn gi tr +1 nu b=1 nu khng c tn cng. Khi c tn cng [9], tc l cc i b dch chuyn ngu nhin trong phm vi :

= 1 v

{ }

nu

= 1 .

6) Vi j r , i j , bin i vector

i V nh sau: If

j j j j + j l } j c } i i + i ; i ; i { 1,2,..D}; j { 1,2,..n} i { i { Ta c th vit: 0 + . Theo cch xy dng : Parity_Change , (6)

i i + i

(i

Tn hiu watermark c thnh lp qua cc bc 1, 2 v 3. Bc 5, 6 thc hin giu 1 bit thng tin vo khi m , M .
2. Khi phc thng tin

trong cc bc 2,3,4 ca thut ton giu tin v gi thit v tn cng [9], , l cc bin ngu nhin, c
phn b chun, c lp thng k. Theo l thuyt xc sut ta c:
zlc ( , w r ) = 1

Ti thi im khi phc thng tin, ta c

( 0 .w r + .w r ) =

( 0 .w r ) + N 0,
(7a) (7b) (7c)

m , M , kho K, cc tham s r , , .
1) Thc hin nh bc 2 ca thut ton giu tin ta ( ) nhn c w { 1} .
r

T y ta nhn c kt qu: T 0 :

2) Gi J = j j = 1.. phn ca wr .

} l tp ch s cho cc thnh

T zlc ( , wr ) T : b khng xc nh.

zlc ( , wr ) < T : b = 0 ;

zlc ( , wr ) > T : b = 1;

3) Thc hin nh bc 5 ca thut ton giu tin, ta nhn c phn hoch:

Vn xc nh ngng T v li bit vt qu khun kh bi bo ny, s c trnh by trong bi vit tip theo.

V. KT QU CI T V TH NGHIM

{ } = {
i = 1 .

vi cc gi tr i = 1 v

4) Xy dng vect { 1} nh sau:

( )

j J : j = 1 nu
i i
+ i c

{ } { } { } { };
i i l

j = 1 nu
i i
+

{ } { } { } { }.
i l i

Thut ton giu thng tin trong c s d liu khng gian s dng thuc tnh chn l theo phng php kim sot chnh lch s lng cc bt chn l c trnh by trong [9]. Trong bi ny thut ton giu tin vo d liu khng gian c s dng k thut tri ph c cp vi mc tiu tng cng mt ca bn tin giu ng thi vn gi c tnh bn vng trc cc tn cng. Thut ton c ci t v th nghim trn CSDL bn s t l 1:50.000 (2D) vi gi thit cc ta kinh v v c php sai s di =0.025km, sai s ta cho php , c

tnh theo cng thc (1) v (2) trnh by trong [9]. Ly = . min{ , } = . vi l h s quyt nh kh nng che giu (undetectability) ca thng tin. Thc nghim c tin hnh trn 10.000 mu giu bit 0; 10.000 mu giu bit 1 v 10.000 mu khng giu thng tin. iu kin tn cng: =0.1; =1.59*10-5.

khng gian l phng php kh thi. Kt qu bi bo c th tip tc c pht trin cho cc ng dng giu thng tin trong mi trng d liu khng gian ni ring cng nh cc ng dng giu tin trong mi trng d liu s ni chung.
TI LIU THAM KHO
[1] I.J.COX ET. AL., Secure Spread Spectrum Watermarking of Images, Audio and Video, Proc IEEE International Conf on Image Processing, ICIP96, Vol.3, pp 243-246. [2] D. KUNDUR, D. HATZINAKOS, A Robust Digital Image Watermarking Method using Wavelet-Based Fusion, Toronto, Ontario, Canada M5S 3G4. [3] DICKINSON B., TAO B., Adaptive Watermarking in DCT Domain, Proc. of IEEE International Conf. on Acoustics Speech and Signal Processing, ICASSP-97, Vol.4, pp.1985-2988, 1997. [4] MARTIN KUTTER, FREDRIC JORDAN, FRANK BOSSEN, Digital Signature of Color Images using Amplitude Modulation, 1015 Lausanne Switzerland, nm 2000. [5] M. RAMKUMAR, ALI N. AKANSU, A Robust Data Hiding Scheme for Images Using DFT, New Jersey Institute of Technology, Newark, NJ 07102. [6] R. Z. WANG, C. F. LIN, AND J. C. LIN. Image Hiding by LSB Substitution and Genetic Algorithm, Proceedings of International Symposium on Multimedia Information Processing, Chung-Li, Taiwan, R.O.C, December 1998, 671-683. [7] V BA NH, NGUYN XUN HUY, O THANH TNH, nh gi kh nng giu d liu trong bn s, Tp ch Tin hc v iu khin hc, s 4/2000, 347-353. [8] V BA NH, NGUYN XUN HUY, O THANH TNH, K thut giu d liu trong bn s, Chuyn san Bu chnh Vin thng, s 8/2002, 8592. [9] V BA NH, Giu thng tin trong c s d liu khng gian, Tp ch nghin cu khoa hc k thut v cng ngh Qun s, s 4, 30-37.

Hnh 1: Kt qu th nghim trn mu bn s t l 1:50.000 kch thc (0.01x0.01)0

Bc 2 trong thut ton giu tin nhm m bo tnh bo mt, bc 3 m bo kh nng t sa sai khi mi trng giu tin b tn cng, cc bc 4 v 5 cho php ng b qu trnh giu v hi phc thng tin - mt trong nhng vn kh khn v quan trng cn gii quyt trong k thut truyn tin tri ph. Khi kch thc khi tng ln (s nh khong 1000) li bit s gim ng k. Hnh 1 trnh by kt qu th nghim vi khi khng gian kch thc (0.01x0.01) (khong 1km2 trn bn phng t l 1:50.000), c cha 909 nh, s mu th nghim l 10.000. Kt qu cho thy li bt trung bnh khng qu ba phn vn. (0.027%) cho c 3 trng hp (khng giu, giu bit 0 v giu bit 1).
VI. KT LUN

Phng php v cc kt qu th nghim c trnh by trong bi ny cho thy giu thng tin bn vng s dng k thut thng tin tri ph trong d liu