104 JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010Our experiments show that for group <strong>of</strong> attacks likeJPEG compression, resiz<strong>in</strong>g, add<strong>in</strong>g noise the proposedmethod can be able to extract the copyright image withless loss <strong>in</strong> the quality.Figure 3(a)Reconstructed image us<strong>in</strong>g shadowimage 1 and shadow image 2Figure 5(a) Resized Embedded ImageFigure 3(b)Reconstructed image us<strong>in</strong>g shadowimage 1 and shadow image 3Figure 5(b)Extracted Copyright image when the embeddedimage is resizedFig 5 shows the Resized embedded image <strong>in</strong> part(a) andthe extracted copyright image when the embedded imageis resized <strong>in</strong> part(b)Figure 3(c)Reconstructed image us<strong>in</strong>g shadowimage 2 and shadow image 3Fig 3 shows the Reconstructed image us<strong>in</strong>g shadowimages 2(a) and 2(b) <strong>in</strong> part(a) Reconstructed imageus<strong>in</strong>g shadow images 2(a) and 2(c) <strong>in</strong> part(b) andReconstructed image us<strong>in</strong>g shadow images 2(a) and 2(c)<strong>in</strong> part(c).Watermark extraction processFigure 6(a) Compressed Embedded ImageFigure 6(b)Extracted Copyright image when the embeddedimage is CompressedFig 6 shows the compressed embedded image <strong>in</strong> part (a)and the extracted copyright image when the embeddedimage is compressed <strong>in</strong> part (b)Figure 4(a) Embedded imageFigure 7(a) Embedded Image with added noiseFigure 4(b)Extracted copyright imageFig 4 shows the embedded image <strong>in</strong> part (a) and theextracted copyright image <strong>in</strong> part (b)Attacks on the Proposed MethodFigure 7(b)Extracted Copyright image when the embeddedimage is added with noise© 2010 ACADEMY PUBLISHER
JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010 105Fig 7 shows the embedded image with added noise <strong>in</strong>part (a) and the extracted copyright image when theembedded image is added with noise <strong>in</strong> part (b)IV. PSNR MEASUREMENTOne commonly used measure to evaluate theimperceptibility <strong>of</strong> the watermarked image is the peaksignal to noise ratio (PSNR) which is given byPSNR = 10 * log10( ( 255 )^2 / mean_square_error )WhereOrig<strong>in</strong>alImage_x_size = size( Orig<strong>in</strong>alImage, 2);Orig<strong>in</strong>alImage_y_size = size( Orig<strong>in</strong>alImage, 1);CopyrightImage_x_size = size( CopyrightImage, 2);CopyrightImage_y_size = size( CopyrightImage, 1);mean_square_error = sum( sum( sum( ( CopyrightImage– Extracted CopyrightImage ).^2 ) ) ) / double(CopyrightImage_x_size * CopyrightImage_y_size * 3);[4]Johnson, N.F. & Jajodia, S., “Explor<strong>in</strong>g Steganography:See<strong>in</strong>g the Unseen”, Computer <strong>Journal</strong>, February 1998 .[5]“Reference guide: Graphics Technical Options andDecisions”, http://www.devx.com/projectcool/Article/1997[6] Owens, M., “A discussion <strong>of</strong> covert channels andsteganography”, SANS Institute, 2002.TABLE I.PSNR VALUESType <strong>of</strong> Operation on ImagePSNROrig<strong>in</strong>al Embedded Image 32.6737After resiz<strong>in</strong>g embedded Image 29.0508After compress<strong>in</strong>g the Embedded image to a .jpg 28.4083After add<strong>in</strong>g random noise to the Embedded image 33.4338Table I illustrates PSNR values between the Orig<strong>in</strong>alCopyright Image and the Extracted Copyright Imagetaken from various operationsV. CONCLUSIONSWe have demonstrated a new watermark<strong>in</strong>gtechnique that uses (n,n) secret shar<strong>in</strong>g scheme to embeda copyright image <strong>in</strong>to orig<strong>in</strong>al image . This techniqueworks well with images <strong>of</strong> all sizes. This techniqueprovides two layers <strong>of</strong> security. In the first step, acopyright image is embedded <strong>in</strong>to orig<strong>in</strong>al image forcopyright protection. Also, the embedded image is sharedamong n participants where all the n shares must be usedto reconstruct the embedded image. This makes thesystem more secure. The method can with stand attackslike JPEG compression, resize and add<strong>in</strong>g noise with lessloss <strong>in</strong> quality <strong>of</strong> the image. Further this work can beextended by calculat<strong>in</strong>g the hash value <strong>of</strong> the image andencrypt the hash value us<strong>in</strong>g either symmetric key orpublic key and embed the hash value <strong>in</strong>side the image sothat at the receivers end the authentication and <strong>in</strong>tegrity<strong>of</strong> the image can be verified by recalculat<strong>in</strong>g the hashand verify<strong>in</strong>g it. Similarly digital signatures can begenerated for images and can be verified. Also (k,n)threshold secret shar<strong>in</strong>g schemes can be implemented formuch security.VI. REFERENCES[1] Adrian Perrig Andrew Willmott, ”Digital ImageWatermark<strong>in</strong>g <strong>in</strong> the Real World" Extended Abstract, March 9,1998.[2] DaoshunWang, Lei Zhang, N<strong>in</strong>g Ma, Xiaobo Li,“Two secretshar<strong>in</strong>g schemes based on Boolean operations”, Science Direct–Pattern Recognition 2007.[3] A. Shamir, “How to share a secret”, Commun. Assoc.Comput. Mach. 22 (11) (1979) 612–613.© 2010 ACADEMY PUBLISHER