www..org 3 Informaton Hdng Watermarkng Detecton Technque by PSNR and RGB Intensty 1 Neha Chauhan, Akhlesh A. Waoo, 3 P. S. Patheja 1 Research Scholar, BIST, Bhopal, Inda.,3 Assstant Professor, BIST, Bhopal, Inda. Abstract There has been many technques for hdng messages n mages. We propose a new regon-adaptve watermarkng algorthm whch wll be used for the novel applcaton to detect watermark attacks. One of the major advantages of the proposed watermarkng detecton technque s PSNR and RGB Intensty value that t allows tamper detecton usng lnear classfer by provdng these dscrmnatng features. The watermark data s embedded on dfferent regons of the host mage usng a combnaton of dscrete wavelet transform and sngular value decomposton technque. In addton, there s a novel use the regon-adaptve watermarkng technque as a means to detect f certan types of attack have occurred. As wll be elaborated, the technque to mproves the speed of detecton, and also test the robustness of the proposed watermarkng scheme. They are Gaussan nose, salt and pepper nose, sharpen, smoothng, hstogram equalzaton and JPEG compresson attack. At the same tme, rotaton, translaton and scalng belongs to geometrc attacks are also appled. The severty of these attacks can be adjusted by modfyng ther correspondng parameter values. Expermental results wll detected the hdng data on the orgnal mage and has lttle relaton to secret message fle. It helps, for provdng more securty to the nformaton Keywords- RGB Color Intensty, PSNR, Image steganography, Image encrypton, Lnear Classfer, Message Encrypton.. 1. INTRODUCTION Dgtal audo watermarkng has been wdespread concerned n the academc cycles, whch s an effectve way to protect audo product property rghts, meanwhle, dgtal audo watermarkng technology faces greater challenges than the dgtal mage and vdeo watermarkng technology now. As one of the most popular and vable technques n protectng copyrghts n dgtal meda, watermarkng technology has receved enormous level of attenton of researchers and practtoners alke. Unfortunately, due to the same reason, watermarkng technology has also attracted the attentons of hackers and crmnals alke who are nterested n breakng the watermarks n order to crack the copyrght protecton system. As a result, there s a constant challenge on the researchers to keep mprovng the robustness of the watermarkng technque whle at the same tme mantanng ts transparency as to not ntrudng any legtmate use of the meda. Progress n ths area has been steady as can be seen from a healthy number of publcatons n the feld and the sheer number of nsttutes around the world that deal wth the ssue [1]. In the more specfc feld of dgtal mage watermarkng, one of the most notable technques s regonbased mage watermarkng []. The paper descrbed a method for embeddng and detectng chaotc watermarks n large mages. An adaptve clusterng technque s employed n order to derve a robust regon representaton of the orgnal mage. The robust regons are approxmated by ellpsods, whose boundng rectangles are chosen as the embedded area for the watermark. The drawback of ths technque s due to lmted number of sutable regons for storng the watermark the watermark storng capacty can be low. In ths paper, we present a novel watermarkng technque whch works by adaptvely embeddng the watermark data nto dfferent regon of the host mage. The ratonale of our approach s based on the research fndng we came nto n our prevous work [3][4]. Ths fndng wll be descrbed n detaled n ths paper for convenence. Most frst generaton dgtal watermarkng algorthm embedded the watermarkng nto the tme doman samples or transform doman to transform coeffcents, but ths leads to a poor robustness of tme doman algorthms to the sgnal processng lke compresson, nose and flterng, transform doman watermarkng uses the dea of audo maskng effect and spreads spectrum technology to mprove the robustness, smultaneous reduces the performance of antsynchronzaton attack. The core dea of the second generaton watermarkng s to embed n the meda to dentfy the mportant part of the meda tself, whch s proposed by Cox et al. [5], and extended by Kutter et al. [6]. It ndcates that some mportant data feature of the meda should be taken full advantage. of the process of embeddng the watermark. In the feld of dgtal audo watermarkng, the dea s to use the stable feature ponts of the audo to mark the embedded poston of the watermarkng, and use the stable performance of these feature ponts ant-synchronzed attacks to mprove the ablty of the watermark ant-synchronzaton attack. Feature
www..org 4 ponts should have the feature such as stablty, more unform dstrbuton and the ablty to accommodate the watermarkng [7].. RELATED WORK In ths Research paper [8] here they advancement of dgtal mage watermarkng technology have revewed an analyss of on a number of attack types on mage watermarkng. The analyss was carred out usng two mage analyss tools namely Image Hstogram and Fourer Spectrum for frequency doman analyss. Usng the results of the experments, they argue that exstng technques have dfferent senstvty and robustness levels to dfferent attacks. The results also uncover a number of common smlartes between dfferent types of watermark attack. (a) (c) (b) Fgure 1. (a) MRF segment ted host mage, (b) watermark nserton regon and (c) watermarked mage They have presented a novel dgtal mage watermarkng technque that takes nto account the results of prevous analyss and testng of the hypothess. There technque utlzes a number of technologes namely dual watermarkng, mage segmentaton and parttonng, and DWT-SVD to fulfll the desgn crtera set to prove the hypothess. The experment results show that the technque s more robust to attacks than the orgnal DWT-SVD technque. In addton to the mprovng the robustness of the watermark to attacks, they can also show a novel use the regon-adaptve watermarkng technque as a means to detect f certan type of attacks have occurred. Ths s a unque feature of watermarkng algorthm whch separates t from other state-of-the-art watermarkng technques. The watermark detecton process uses coeffcents derved from the Regon-Adaptve Watermarkng algorthm n a lnear classfer. The experment conducted to valdate ths feature shows that n average 94.5% of all watermark attacks can be correctly detected and dentfed. A watermarkng technque based on the frequency doman s presented n ths research work [9]. The JPEG s a usually fle format for transmttng the dgtal content on the network. Thus, the proposed algorthm can used to resst the JPEG attack and avod the some weaknesses of JPEG quantfcaton. And, the nformaton of the orgnal host mage and watermark are not Needed n the extractng process. In ths research work [9], a modfed algorthm s presented to mprove the defect of the JPEG quantfcaton n order to reduce the bt error rate (BER) of the retreved watermark. Addton, two parameters are regarded as the controllng factors. They are used to adjust the value of the DCT coeffcent n order to trade-off the qualtes between the Watermarked mages and retreve watermark. Moreover, the proposed algorthm s desgn as a blnd mechansm. Thus, the orgnal mage and watermark are not needed for extractng watermark. To demonstrate the robustness of the proposed scheme, the algorthm has been smulated usng C++ program. The host mages of sze 56 56 are 8-bt gray level mages and the watermarks of sze 18 18 are bnary mages. And, one watermark and fve host mages (.e. Lena, F16, Pepper, Baboo, and Grl) are used to test. The peak sgnal to nose rate (PSNR) s used to estmate the qualty between the orgnal mage and the watermarked mage. Ths research work [10] presents a novel and robust color watermarkng scheme of embeddng color watermark nto color host mage. The technque shows effcent extracton of Watermark wth hgh PSNR of embedded mage. The proposed algorthm s expermented n frequency doman n whch combnaton of DWT and DCT s appled on the host mage. The Hgh energy content of color watermark.e. low frequency DCT coeffcents are embedded nto md frequency DCT coeffcents of hgh frequency components of mult resolved host color mage. The proposed algorthm s more secure, robust and effcent because of use of DWT and DCT. Performance evaluaton and testng of the proposed algorthm usng standard benchmarks Reveals that t s farly robust aganst a wde range of sgnal and mage processng operatons. In the presented research work, combned DWT-DCT method s used where frst level or second level DWT decomposton of host mage s carred out followed by
www..org 5 DCT of the hgh frequency coeffcents of these DWT coeffcents. The color watermark s converted nto approprate lumnance plane on whch block wse DCT s appled and low frequency DCT coeffcents are embedded nto hgh frequency coeffcents of the host mage. The method can be made blnd as well as non-blnd watermarkng. Dgtal mages are easy to manpulate and modfy for ordnary people [11]. Ths makes t more and more dffcult for a vewer to check the authentcty of a gven dgtal mage. Copy-move forgery s a specfc type of mage tamperng where a part of the mage s coped and pasted on another part generally to conceal unwanted portons of the mage. Ths research work present an mproved algorthm based on Dscrete Wavelet Transform (DWT) and Dscrete Cosne Transform Quantzaton Coeffcents Decomposton (DCT-QCD) to detect such clonng forgery. The proposed scheme accurately detects such specfc mage manpulatons as long as the coped regon s not rotated or scaled and coped area pasted as far as possble n specfc poston from orgnal porton. Malcously manpulate, and tamper dgtal mages wthout leavng any obvous clues became very easy wth the wdely avalable, easy to use and extremely powerful dgtal mage processng tools such as Photoshop and Freehand. As a result, there s a rapd ncrease of the dgtally manpulated forgeres n manstream meda and on the nternet. The necessty of algorthms For effcently verfyng the ntegrty of mages cannot, therefore, s overemphaszed n ths dgtal era. The prmary task of a copy-move mage forgery detecton algorthm s to determne f a gven mage contans cloned regons wthout pror knowledge of ther shape and locaton. An obvous approach s to exhaustvely compare every possble par of regons. However, such an approach s exponentally complex. The drawback wth schemes based on watermarkng s that the water mark must be embedded rght durng the mage formaton to avod the possblty of watermarkng an already forged mage. Ths s practcally dffcult as most dgtal cameras and other mage acquston devces do not have nstantaneous watermarkng facltes. G, B and convertng t n to sngle array vectors, we get 3 vectors of dmenson 1 5065. For encrypton we frst generate elements from chaos map equal to the dmenson of 3 M N matrx. b. PSNR In order to better compare ths new technque wth the exstng algorthm based on 8 bts bnary nformaton, the hdng capacty of an mage along wth the PSNR value (Peak Sgnal to Nose Rato). The PSNR value gves the measurement of the dstorton of carrer mage after hdng nformaton. The sgnal n ths case s the orgnal data, and the nose s the error ntroduced by compresson. The PSNR s defned as: PSNR 10log 10 ( MAX I) ( MSE) Here, MAXI s the maxmum possble pxel value of the mage. When the pxels are represented usng 8 bts per sample, ths s 55. More generally, when samples are represented usng B bts per sample, MAXI s B 1.And MSE stands for Mean Square Error. For two m n monochrome mages I and K where one of the mages s consdered a nosy approxmaton of the other. The hgher the PSNR, the better the qualty of the compressed or reconstructed mage. When the two mages are dentcal, the MSE wll be zero. For ths value the PSNR s undefned.e.. 3. PREDEFINE TECHNIQUE a. RGB ntensty Consder an mage (Io) wth dmenson M N P, Where, P represents color combnaton (3 for a color mage); M, N represents rows and column of ntensty level. Separate R, G, B matrx of Image and convert each R, G, B matrx nto sngle array (1 mn). For example, Lena mage whch s one of the common mage used for mage processng algorthms has a dmenson of 5 5 3 and after separaton of R, Fgure Lena mage and RGB ntensty plots c. Lnear Classfer Lnear classfcaton belongs to the feld of statstcal classfcaton; the goal of statstcal classfcaton s to use an object s characterstcs to dentfy whch class or group t belongs to. A lnear classfer acheves ths by makng a classfcaton decson based on the value of a lnear combnaton of the characterstcs. Suppose some gven data ponts each belong to one of two classes, and the goal s to
www..org 6 decde whch class a new data pont wll be n. for example, a data pont s vewed as a p-dmensonal vector, and we want to know whether we can separate such ponts wth a (p- 1) dmensonal hyper-plane. There are many hyper-planes that mght classfy the data. One reasonable choce as the best hyper-plane s the one that represents the largest separaton, or margn, between the two classes. So we choose the hyper-plane so that the dstance from t to the nearest data pont on each sde s maxmzed. If such a hyper-plane exsts, t s known as the maxmum-margn hyper-plane and the lnear classfer t defnes s known as a maxmum margn classfer. d. Correlaton coeffcent Correlaton coeffcent r s the measure of extent and drecton of lnear combnaton of two random varables. If two varables are closely related, the correlaton coeffcent s close to the value 1. On the other hand, f the coeffcent s close to 0, two varables are not related. The coeffcent r can be calculated by the followng formula. r ( X Xm)( Y Ym) ( X Xm) Where X - pxel ntensty of orgnal mage Xm- mean value of orgnal mage ntensty Y- pxel ntensty of encrypted mage Ym - mean value of encrypted mage ntensty ( Y Ym) The correlaton values are calculated for orgnal and encrypted. 4. PROPOSED ALGORITHM In Fgure shows the proposed watermark attack detecton scheme. The scheme requres the certan threshold n addton mage equatons. The scheme start wth calculate PSNR values between orgnal watermarked mage and tested watermarked mage. If PSNR value s hgher than certan threshold, t represents orgnal watermarked mage and tested watermarked mage are almost dentfed. However, f PSNR s lower than certan threshold, t means that tested watermarked mage suffer from attack. Then calculate RGB Intensty values. If RGB Intensty values are Match wth tested watermarked mage, t represents orgnal watermarked mage and tested watermarked mage are almost dentfed. If RGB Intensty values are No Match wth tested watermarked mage, t means that tested watermarked mage suffer from attack after that, we wll sgnfy what type of attack has been appled to the tested watermarked mage. Orgnal Watermarked Image If PSNR s lower If RGB Intensty No Match PSNR PSNR < RGB ntensty levels Coeffcents Calculate Tested Watermarked Image If PSNR s hgher If RGB Intensty Match Lnear Classfcaton Result Plottng No Attack Fg 3 Block dagram of propose Algorthm Ths process wll use lnear classfer. In addton, a number of dscrmnatng features wll apply whch s descrbed below. The embeddng process of the proposed technque wll be llustrated by the block dagram shown n Fgure. 5. TEST RESULTS AND ANALYSIS To detect the watermarked attacked we test the robustness of the proposed watermarkng scheme, seven watermark removal attacks are appled to the watermarked mage. They are Gaussan nose, salt and pepper nose, sharpen, smoothng, medan flter, hstogram equalzaton and JPEG compresson attack. The severty of these attacks can be adjusted by modfyng ther correspondng parameter values. Defntons of these parameters can be found s gven n [1]. Dfferent watermark attacks have dfferent coeffcent to detect. Some of the attacks only requre one coeffcent whch nclude Gaussan nose and salt and pepper nose, moreover, the rest of them need factors. And also we propose to check The PSNR values between the unmodfed watermark mage and the attacked watermarked mage are then averaged. After PSNR we compare RGB ntensty of both mage orgnal and attacked watermarked mage.
www..org 7 S. No Attackers 1 Gaussan nose Salt and pepper nose 3 Sharpen 4 Smoothng 5 Medan flter 6 Hstogram equalzaton 7 JPEG compresson Table 1 Show Dfferent Attacker Here theoretcal t s clear that after check RGB ntensty and PSNR technque In addton to the mprovng the robustness of the watermark to attacks, they can also show a novel use the watermarkng technque as a means to detect f certan type of attacks have occurred. Ths s a unque feature of watermarkng algorthm whch separates t from other state-of-the-art watermarkng technques. The watermark detecton process uses coeffcents derved from the Watermarkng algorthm n a lnear classfer. The experment conducted to valdate ths feature wll shows that n average 96% of all watermark attacks can be correctly detected and dentfed. They show a novel use the regon-adaptve watermarkng technque as a means to detect f certan type of attacks has occurred. Ths s a unque feature of our watermarkng algorthm whch separates t from other state-of-the-art watermarkng technques. The watermark detecton process uses coeffcents derved from the Regon-Adaptve Watermarkng algorthm n a lnear classfer. The experment conducted to valdate ths feature shows that n average 94.5% of all watermark attacks can be correctly detected and dentfed. Our Proposed Algorthm s able to detect any type of attack f appled n watermarks mage. And mproves the speed of detecton, and also test the robustness of the watermarked mages. 6. CONCLUSION We have proposed n ths Research paper a novel dgtal mage watermarkng detecton technque usng RGB ntensty and PSNR Value approach. The technque s derved from our prevous work [8]. Our hypotheses are: 1. By Calculatng RGB color ntensty value of the host data and the nserted watermark data.. In order to counter both hgh frequency and low frequency type attacks by calculatng PSNR value. f we found PSNR value of watermarked mage s lower ts mean n host was attacked by attackers. Our RGB ntensty and PSNR Value watermarkng technque s realzed by usng two watermark mages, each wth a strong Hgh Frequency or Low Frequency components. Non overlappng regons of these watermark mages are nserted nto the host mage usng a combnaton of mage segmentaton. The expermental results wll performed and analyze of dfferent mages fle s mplemented n matlab tool. REFERENCE [1 ]Pettcolas, F.A.P., Anderson, R.J., Kuhn, M.G., Informaton Hdng A survey, Proceedng of the IEEE, Specal Issue on Protecton of Multmeda Content, 106-1078, July 1999. [] A. Nkolads and I. Ptas, "Regon-based mage watermarkng," Image Processng, IEEE Transactons on, vol. 10, no. 11, pp. 176-1740, 001. [3 ]Cl.Song, S.Sudrman and M.Merabt, A Spatal and Frequency Doman Analyss of the Effect of Removal Attacks on Dgtal Image Watermarks, Proc 11th of PostGraduate Network Symposum, 119-14, June, 010. [4] C.Song, S. Sudrman, M.Merabt and D.L.Jones, Analyss of Dgtal Image Watermark Attacks, 6th IEEE Internatonal Workshop on Dgtal Rghts Management, 010. [5] J. Ingemar Cox, J. Klan, F. Thomson Leghton et al. Secure spread spectrum watermarkng for multmeda. IEEE Transactons on Image Processng, 6(1), 1997, 1673-1687. [6] M. Kutter, S. K. Bhattacharjee, T. Ebrahm. Towards second generaton watermarkng schemes, In Proceedngs of IEEE Internatonal Conference on Image Processng ICIP (1999). 1999, 30-33. [7 ]H. X. Wang Overvew of content based adaptve audo watermarkng. Journal of Southwest Jao tong Unversty. 44(3), 009, 430-437 (n Chnese). [8] s.sudrman, m.merabt, d.aljumely, Regon-Adaptve Watermarkng System and Its Applcaton, Developments n E- systems Engneerng, PP-15-0, IEEE 011 [9] Huang-Ch Chen, Yu-Wen Chang, Rey-Chue Hwang, "A watermarkng technque based on the frequency doman", journal of multmeda, vol. 7, no. 1, February 01. [10]Satshkumar Chavan, Rohan Shah, Roshan Poojary, Jasel Jose and Glora George, A Novel Robust Color Watermarkng Scheme for Color watermark mages n Frequency Doman, Internatonal Conference on Advances n Recent Technologes n Communcaton and Computng IEEE 010. [11]Mehd Ghorban, Mohammad Frouzmand, Ahmad Faraah, DWT-DCT (QCD) Based Copy-move Image Forgery Detecton, IEEE 011. [1]Cl.Song, S.Sudrman and M.Merabt, A Spatal and Frequency Doman Analyss of the Effect of Removal Attacks on Dgtal Image Watermarks, Proc 11th of PostGraduate Network Symposum, 119-14, June, 010.