A Novel SecureVideo Watermarking Scheme using DWT &Random Frame Selection

Size: px

Start display at page:

Download "A Novel SecureVideo Watermarking Scheme using DWT &Random Frame Selection"

Lily Tucker
5 years ago
Views:

1 A Novl ScurVido Watrmarking Schm using DWT &Random Slction Pavnt K Athwal Dpartmnt of Computr Scinc Enginring RIMT, M.G.G, Punjab,India Ranprt Kaur Dpartmnt of Computr Scinc Enginring RIMT, M.G.G, Punjab,India Anuj K Gupta HOD, Dpartmnt of Computr Scinc Enginring RIMT,M.G.G, Punjab, India Abstract - Digital vidowatrmarking is th nabling tchnology to prov ownrship of copyrightd matrial, to solv th problm of piracy and to dtct th originator of illgally mad copis.in this papr, to solv th authntication problm an ffctiv, imprcptibl and scur blind vido watrmarking algorithm is proposd which uss an ncryption ky to slct th random frams of vido in which watrmark information is mbddd uniformly throughout th vido. To kp th algorithm imprcptibl DWT tchniqu is usd for mbdding.th prformanc of algorithm is tstd using MATLAB softwar on vido of traffic and watrmark imag of 256 X 256.Th xprimntal rsults show that th proposd schm is highly imprcptibl, lss tim consuming, mor scur and highly robust against various attacks. Gnral Trms - Vido Watrmarking, Scurity, Imprcptibility, Robustnss Kywords - Vido Watrmarking, PSNR,MSE, BER I. INTRODUCTION In th past duplicating art work was quit complicatd and rquird a high lvl of xprtis for th countrfit to look lik th original. Howvr, in th digital world this is not tru. Now it is possibl for almost anyon to duplicat or manipulat digital data and not los data quality. So watrmarking has bcom a major fild to solv th problms of illgal manipulation, distribution and piracy of digital vidos [1, 2].Vido watrmarking is th procss of mbdding copyright information or vrification mssags in vido bit strams.vido watrmarking rsarch rcivd lss attntion than imag watrmarking du to its inhrit difficulty, howvr, many algorithms hav alrady bn proposd [3,4,5,6]. Th information which is mbddd is calld watrmark. It can b txt or an imag.two typs of digital watrmarks may b distinguishd, dpnding upon whthr th watrmark appars visibl or invisibl to th casual viwr.visibl watrmarks can b a logo or txt on frams of vidos ithr in all frams or in just a fw slctd frams. If it is prsnt in slctd frams thn it passs off without bing noticd, du to high fram rat. Invisibl watrmarks or Hiddn watrmarks on othr hand ar prsnt in th fil in such a way that thy cannot b sightd but hav to b xtractd. Watrmarking algorithm should b imprcptibl i. mbdding should not affct th quality of vido. It should also b robust to various signal procssing oprations i.. watrmark could not b dstroyd or dgradd aftr any typ of vido manipulations. Watrmarking algorithm can b blind or non blind. If th xtraction procss ndd th original data for th rcovry of watrmark from watrmarkd vido thn it is said to b non blind schm of watrmarking. If watrmark can b rcovrd from only watrmarkd vido without any nd of original data thn it is calld blind schm of watrmarking. This schm applid to vidos shows that it consums vry small tim to mbd th watrmark information and it is highly imprcptibl, xhibits high robustnss againstvarious attacks& mor scur schm du to us of scrt ky and random fram slction. Volum 4 Issu 4 Dcmbr ISSN:

2 II. PROBLEM STATEMENT As digital vido-basd application tchnologis grow, such as Intrnt vido, wirlss vido,vidophons, and vido confrncing, th problm of illgal manipulation, copying, distribution and piracy of digitalvido riss mor and mor. Th problm of this papr rsarch work is to solv th authntication problm and mbd th watrmark in such a way that it could not b rmovd or dgradd from th vido using th proposd algorithm of random fram slction through scrt ky. III. THEORETICAL BACKGROUND Th proposd work rquirs crtain thortical considrations rlatd to th concpt of Entropy &its prformanc paramtrs. Th following sctions contain a brif dscription of ths concpts. 3.1 Discrt Wavlt Transform (DWT) Wavlt transform is a multi-rsolution dcomposition of a signal. Th low pass filtr applid along a crtain dirction xtracts th low frquncy (approximation) cofficints of a signal. On th othr hand, th high pass filtr xtracts th high frquncy (dtail) cofficints of a signal. In 2D applications, for ach lvl of dcomposition, first prform th DWT in th vrtical dirction, followd by th DWT in th horizontal dirction. Aftr th first lvl of dcomposition, thr ar 4 sub-bands: LL1, LH1, HL1, and HH Prformanc masurs Imprcptibility, robustnss, scurity, complxity &data payload ar considrd as prformanc paramtrs for th proposd watrmarking Algorithm Imprcptibility Imprcptibility mans that th prcivd quality of th vido should not b distortd by th prsnc of th watrmark.as a masur of th quality of a watrmarkd vido, Bit Error Rat (BER), Pak Signal tonois Ratio (PSNR),and Man Squard Error (MSE) is calculatd btwn th original vido fram and th corrsponding watrmarkd fram [8] Man squard rror (MSE) To masur th similarity btwn th original vido fram and watrmarkd fram an rror signal is computd by subtracting th watrmarkdfram from th original fram,and thn computing th avrag nrgy of th rror signal. Th MSE is givn by quation Whr x(i,j) is rprsnts th pixl valus of originalvido fram andy(i, j)rprsnts th corrsponding pixl valus of watrmarkd fram and i and j ar th pixlposition of th M N vido fram. MSE is zro whn x(i, j) = y(i, j) Pak signal to nois ratio (PSNR) Th PSNR is valuatd in dcibls and is invrsly proportional th Man Squard Error. It is givn by th quation (3) Highr th valu of PSNR bttr is th quality of th watrmarkd fram Bit rror rat (BER) (2) Volum 4 Issu 4 Dcmbr ISSN:

3 BER is th rciprocal of th PSNR. Th valu of BER which is closr to zro rprsnts mor quality of th watrmarkd fram Scurity Scuritydscribs if th mbddd watrmarking information cannot b rmovd byond rliabl dtction Complxity Complxitydscribs th ffort and tim w nd for watrmark mbdding and rtrival vido. Anothr aspct addrsss if w nd th original data in th rtrival procss or not i.. th watrmarking algorithm is non-blind or blind which influnc th complxity Capacity/Payload Itdscribs how many information bits can b mbddd Robustnss Robustnssdscribs if th watrmark can b rliably xtractd from th watrmarkd vido [3, 5]. W can say Robustnss of a watrmarking algorithm is a masur of th immunity or rsistanc of th watrmark against attmpts to rmov or dgrad it from th vido manipulations by diffrnt typs of digital signal procssing attacks. Th similarity btwn th original watrmark and th xtractd watrmark from th watrmarkd vido can b masurd by using th corrlation factor, which is computd using th following Equation: (4) Whr is a pixl of original watrmark and is a pixl of th rcovrd watrmark of siz M X N. Th corrlation factor ρ may tak valus btwn 0 and1. Th valu closr to 1 rprsnts th mor similarity btwn th original watrmark and xtractd watrmark. IV. PROPOSED ALGORITHM In proposd algorithm, th input vido squnc is dividd into its constitutd frams. Thn 10 random frams ar slctd through th functions gnratd using a scrt ky ntrd by ownr of th vido. Thn thsslctd framsar usd to mbd th watrmark using Discrt Wavlt Transform (DWT). Th mbdding and xtraction procss of watrmark is givn in Figur 1. Th mbdding and xtraction algorithm is givn blow in dtail. 4.1 Watrmark Embdding Algorithm Stp 1:Extract all th frams N from input vido fil. Stp 2:Entr 10 digit scrt ky for random fram slction whr ach digit of ky is 8bit. Stp 3:Calculat an offst valu using total numbr of frams in vido for uniform slction of frams. (12) Stp 4: Using th ASCII valus of 10 digits of th ky ntrd in stp 2 & offst valu calculatd in stp 3 to gnrat 10 random functions to slct 10 random frams from th vido for watrmarking.if th digits of ky ar a, b, c, d,, f, g, h, i, j thn th 10 functions will b (5) Volum 4 Issu 4 Dcmbr ISSN:

4 If addition of ASCII valus of two digits is gratr than th offst valu, thn offst valu is subtractd from thir sum to gt a numbr which is lss than offst valu.ths 10 valus of to rprsnt th fram numbrs. s with ths fram numbrs ar slctd for watrmarking. Stp 5: Slct th blu componnt from th slctd RGB fram in which th watrmark is to b mbddd. Stp 6:Apply discrt wavlt transform (DWT) to this blu componnt and gt approximation, horizontal, vrtical, and diagonal dtails A, H, V & D rspctivly. Stp 7: Rscal th watrmark imag as pr th siz of th diagonal dtails D. Stp 8:Th watrmark (W matrix) is addd to th diagonal dtails (D matrix) and gt watrmarkd diagonal dtails (Dw)Dw = D + kw Whr k is th scal factor that controls th strngth of th watrmark mbddd to th original imag. Stp 10:Th watrmarkd blu componnt is obtaind by applying th invrs DWT using original approximation A, horizontal dtails H, vrtical dtails V, and watrmarkd diagonal dtails Dw. Stp 11:Intgrat this modifid blu componnt with rd and grn componnts to gt th watrmarkd RGB. Stp 12: Rpat stp 5 to stp 11 for all th slctd frams for watrmarking to gt th watrmarkd frams. Stp 13:Gnrat th chcksum from th ky usd in stp 2 and stor th chcksum into th rd componnt of fram 1. St th first pixl valu to zro in th rd componnt of fram 2. Stp 14:Dvlop th watrmarkd vido using th modifid frams by placing thm to thir rspctiv position. 4.2 Watrmark Extraction Algorithm Stp 1: Extract all th N frams from watrmarkd vido fil. Stp 2:Ask th usr to ntr th scrt ky. Stp 3:Gnrat th chcksum from th ky ntrd by th usr in stp 2. Stp 4: Extract th chcksum of original ky stord in th rd componnt of fram 1. Stp 5: Compar both th chcksums from stp 3 & stp 4. And incrmnt th first pixl valu in th rd componnt of fram 2 vry tim chcksum gos wrong. Stp 6: Whn this pixl valu rachs four thn corrupt th vido fil by writing zro to all pixl valus of vido. And stop th xtraction procss. Stp 7: If chcksum matchs thn us th ky ntrd in stp 2 for finding th watrmarkd frams in th vido. Follow stp 4 of mbdding procss to find th watrmarkd frams. Stp 8: Slct th blu componnt of watrmarkd fram from which th watrmark is to b xtractd. Stp 9:Apply DWT to this blu componnt and gt approximation, horizontal, vrtical, and watrmarkd diagonal dtails Dw rspctivly. Stp 10:Extract th watrmark matrix from th Dw using th W = (Dw D)/k V. EXPERIMENTAL RESULTS AND PERFORMANCE EVALUATION MATLAB is usd as th platform for implmnting th proposd work & conducting xprimnts. Th prformanc of th proposd vido watrmarking algorithm is valuatd using many colord vidos containing diffrnt numbr of frams at various fram rats. But hr rsults ar discussd for a 8 sconds vido clip of traffic at a fram rat of 15fps constituting of 120 frams. Th watrmark usd in our xprimnts was a grayscal imag of siz 256 X 256. Scrt ky usd is Pavnt@12 basd on which random frams ar slctd. A vido fram, watrmark imag & corrsponding watrmarkd fram is shown in figur 2. Volum 4 Issu 4 Dcmbr ISSN:

5 Figur 2: (a) Original Vido (b) Watrmark Imag (c) Watrmarkd Volum 4 Issu 4 Dcmbr ISSN:

6 Figur 1: Watrmark Embdding and Extraction Procss Volum 4 Issu 4 Dcmbr ISSN:

7 5.1 Imprcptibility prformanc: To prov th proposd algorithm imprcptibl, as a masur of quality of th watrmarkd vido Man Squard Error (MSE), Pak Signal to Nois Ratio (PSNR), and Bit Error Rat (BER) is calculatd using quations (2), (3), (4) rspctivly for all th watrmarkd frams. Th valus for ths paramtrs for all th frams & thir avrag valus ar tabulatd in tabl 1. Figur3, 4, 5 shows th valus of MSE, PSNR, and BER rspctivly for all th watrmarkd frams.highr avrag valu of PSNR (64 db), smallr valus of MSE (0), and BER (8) shows th imprcptibility of proposd algorithm. 5.2 Scurity Th proposd algorithm is mor scur than th convntional algorithms du to th us of anscrt ky for th slction of th frams to b watrmarkd. And at tim of xtraction procss sam ncryption ky is ndd and if ky is wrong thn nobody can find th watrmarkd frams. And if somon tris for xtraction with wrong ky thn h will b givn only thr chancs of xtraction, aftr that watrmarkd vido will b damagd du to illgal procssing and vido will b of no us for that prson. 5.3 Complxity Th proposd algorithm is vry simpl and smi blind algorithm. 5.4 Embdding Tim: Tim consumd by th proposd watrmarking algorithm is vry small and is indpndnt of th total vido tim bcaus th frams to b watrmarkd ar fixd. In proposd algorithm w ar slcting 10 frams for watrmarking. Th considrd vido of traffic is of 8 sconds. Th fram xtraction tim is 5.01 sconds, fram rassmbling tim is 5.01 sconds and tim consumd for watrmarking of 10 frams is 4.25 sconds so total tim consumd for whol mbdding procss is sconds. If th vido siz is incrasd thn th fram xtraction & fram rassmbling tim incrass but th watrmarking tim rmains sam which is approximatly 4-10 sconds. 5.5 Data Payload In proposd algorithm, watrmark of siz half th siz of th fram can b mbddd into th vido. Exprimnts ar prformd on a fram siz of 512 X 512. So a watrmark of siz 256 X 256 can b mbddd. 5.6 RobustnssPrformanc Similarity btwn th original watrmark and th xtractd watrmarks from all th watrmarkd vido frams is masurd by computing corrlation factor ρ using th quation (5). Random watrmarkd fram numbrs ar listd in tabl 1 & th xtractd watrmarks from rspctiv frams ar shown in figur 8. Original watrmark & thir corrlation factor is also shown in figur 8. Th proposd algorithm is mor robust to fram dropping as wll as othr attacks than th convntional mthods. Bcaus to dstroy th watrmark from watrmarkd frams, th watrmark frams should b known. And th watrmarkd frams cannot b found out asily du to random & uniform fram slction for watrmarking using th ncryption ky. Watrmark is not mbddd in th frams of on chunk but it is sprad uniformly throughout th vido to avoid th clustring of watrmarkd frams in on chunk. Also in proposd algorithm sam watrmark imag is mbddd in all th frams du to which if watrmark is dstroyd in som watrmarkd frams by any manipulation or som watrmarkd frams ar droppd thn it can b rcovrd from th othrs and probability of maintaining th watrmark in manipulatd watrmarkd vido incrass. Th Proposd algorithm is robust to various attacks lik poisson nois attack and Salt & pppr nois attack as shown in figurs Volum 4 Issu 4 Dcmbr ISSN:

8 Watrma rkd Random Numbr 1 MSE 086 PSNR BER 2 Tabl 1: Valus of MSE, PSNR, BERfor all th s & thir avrag Avr ag Valu NA Figur 3: MSE Valus for all th watrmarkd frams Figur 4: PSNR Valus for all th watrmarkd frams Volum 4 Issu 4 Dcmbr ISSN:

9 Figur 5: BER Valus for all th watrmarkd frams Figur 6: original watrmark, xtractd watrmarks from all th 10 watrmarkd frams with fram numbr & thir corrlation factors Volum 4 Issu 4 Dcmbr ISSN:

9054) Figur 8: Extractd watrmarks Aftr salt & pppr nois attack Figur 9(a)

10 Figur 7 (a) salt & pppr nois Attackd fram (b) Original watrmark (c) Extractd watrmark (CC: ) Figur 8: Extractd watrmarks Aftr salt & pppr nois attack Figur 9(a) poisson nois Attackd fram (b) Original watrmark (c) Extractd watrmark (CC: ) Volum 4 Issu 4 Dcmbr ISSN:

11 Figur 10: Extractd watrmarks Aftr poisson nois attack VI. CONCLUSIONS In this papr, a blind vido watrmarking algorithm is proposd in which random frams from th whol vido frams ar slctd for watrmarking using an ncryption ky.to prsrv th quality of th vido, a particular slctd fram is dividd into blocks and th blocks of high ntropis ar slctd for watrmarking. Thn watrmark information is mbddd at LSB of ach pixl of th slctd block. Th algorithm is valuatd in trms of imprcptibility, scurity, tim consumption, data payload and robustnss. To masur th imprcptibility of algorithm PSNR, MSE, and BER ar computd. Th calculatd valus of ths paramtrs show th high imprcptibility of th algorithm. Also th algorithm is simpl smi blind algorithm, lss tim consuming, mor scur and highly robust against various manipulations lik fram dropping and noiss. REFERENCES [1] L. Qiao and K. Nahrstdt, "Watrmarking Schms and Protocols For Protcting Rightful Ownrship and Customr's Rights", Journal of Visual Commun. and Imag Rprsnt 9, pp , [2] M. Arnold, M. Schumuckr, and S. Wolthusn, Tchniqus and Applications of Digital Watrmarking and Contnt Protction. Artch Hous, [3] Lama Rajab, Tahani Al-Khatib, Ali Al-Haj, Vido Watrmarking Algorithms Using th SVD Transform Europan Journal of Scintific Rsarch, Vol.30 No.3, pp , [4] Mankandan. GRS, Franklin Rajkumar. V, A Robust Watrmarking Schm for Digital Vido Squnc using Entropy and Hadamard Transformation Tchniqu, Intrnational Journal of Computr Applications, Volum 41 No.18,pp.24-31, March [5] AngshumiSarma, Amrita Ganguly, An Entropy basd Vido Watrmarking Schm, Intrnational Journal of Computr Applications, Volum 50 No.7, pp.24-31, July [6] JigarMadia, Kapil Dav, VivkSampat, ParagToprani, Vido Watrmarking using Dynamic Slction Tchniqu, National Confrnc on Advancmnt of Tchnologis Information Systms & Computr Ntworks (ISCON 2012), pp.31-34, [7] JassimMohmmd Ahmd, ZulkarnainMd Ali, Information Hiding using LSB tchniqu, Intrnational Journal of Computr Scinc and Ntwork Scurity, VOL.11 No.4, pp.18-25, April [8] C.Sasivarnan, A.Jagan, JasprtKaur, DivyaJyoti, Dr.D.S.Rao, Imag Quality Assssmnt Tchniqus on Spatial Domain, IJCST Vol. 2, Issu 3, pp , Sptmbr 2011 Volum 4 Issu 4 Dcmbr ISSN:

Computing and Communications -- Network Coding

89 90 98 00 Computing and Communications -- Ntwork Coding Dr. Zhiyong Chn Institut of Wirlss Communications Tchnology Shanghai Jiao Tong Univrsity China Lctur 5- Nov. 05 0 Classical Information Thory Sourc