12.07.2015 Views

Journal of Emerging Technologies in Web Intelligence Contents

Journal of Emerging Technologies in Web Intelligence Contents

Journal of Emerging Technologies in Web Intelligence Contents

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

140 JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010quality can be decoded from the same set <strong>of</strong> shares. Ifonly the stack<strong>in</strong>g operation is allowed (i.e. nocomputations), then our scheme recovers the orig<strong>in</strong>alvisual cryptographic quality. If the XOR operation isprovided (<strong>in</strong>stead <strong>of</strong> the OR operation <strong>of</strong> stack<strong>in</strong>g), thenwe can fully restore the orig<strong>in</strong>al quality image.B. For Colored Images (Halftone-based Grayscale andColor Visual Cryptography)Digital halfton<strong>in</strong>g has been extensively used <strong>in</strong>pr<strong>in</strong>t<strong>in</strong>g applications where it has been proved to be veryeffective. For visual cryptography, the use <strong>of</strong> digital halfton<strong>in</strong>g is for the purpose <strong>of</strong> convert<strong>in</strong>g the grayscaleimage <strong>in</strong>to a monochrome image. Once we have a b<strong>in</strong>aryimage, then the orig<strong>in</strong>al visual cryptography techniquecan be applied. However, the concomitant loss <strong>in</strong> qualityis unavoidable <strong>in</strong> this case.For color images, there are two alternatives forapply<strong>in</strong>g digital halfton<strong>in</strong>g. One is to split the color image<strong>in</strong>to channels <strong>of</strong> cyan, magenta and yellow. Then eachchannel is treated as a grayscale image to whichhalfton<strong>in</strong>g and visual cryptography are applied<strong>in</strong>dependently. After the monochrome shares aregenerated for each channel, channels are comb<strong>in</strong>edseparately to create the color shares. This is the approachpresented <strong>in</strong> [9]. The alternative approach would be todirectly apply color halfton<strong>in</strong>g, then perform theseparation <strong>in</strong>to color channels followed by the application<strong>of</strong> visual cryptography to each channel <strong>in</strong>dependently.Actually, these two approaches lead to the same resultsf<strong>in</strong>ally. There are many mature halfton<strong>in</strong>g techniquesavailable for selection like dispersed-dot dither<strong>in</strong>g,clustered-dot dither<strong>in</strong>g and error diffusion techniques.Halfton<strong>in</strong>g based visual cryptographic scheme can besummarized as follows:a) Encryption: This stage is for the creation <strong>of</strong>shares. This can be further divided <strong>in</strong>to the follow<strong>in</strong>gsteps:i. Color halfton<strong>in</strong>g: Standard algorithms such as theones described <strong>in</strong> [2], [13] and [14] can be usedfor this step. One could do the color channelsplitt<strong>in</strong>g first and then do the grayscale halfton<strong>in</strong>gfor each channel:ii.Or one could do color halfton<strong>in</strong>g first followed bythe splitt<strong>in</strong>g:Creation <strong>of</strong> shares: Consider<strong>in</strong>g the case <strong>of</strong>(2,2)-VCS, the steps areb) Decryption: This stage is for the reconstruction<strong>of</strong> the orig<strong>in</strong>al secret image. This can be further divided<strong>in</strong>to the follow<strong>in</strong>g steps:i. Stack<strong>in</strong>g <strong>of</strong> shares: The follow<strong>in</strong>g stack<strong>in</strong>g (OR)operation needs to be performed:ii. Subsampl<strong>in</strong>g for reconstruction: Theseoperations need to be performed where everyblock <strong>of</strong> f our pixels is sub-sampled <strong>in</strong>to onepixel <strong>of</strong> the f<strong>in</strong>al image. This step is optional andshould be used only with the XOR recoverydescribed <strong>in</strong> Section III-B.1 to achieve betterquality.Then, for every 2*2 block B(i; j) <strong>of</strong> I, whereIt is clear that our technique, though <strong>in</strong>dependentlydeveloped, is quite similar <strong>in</strong> spirit to the one described <strong>in</strong>[9]. So both share the same drawback that digitalhalfton<strong>in</strong>g always leads to permanent loss <strong>of</strong> <strong>in</strong>formationwhich means that the orig<strong>in</strong>al image can never beperfectly restored. Inverse halfton<strong>in</strong>g is a possiblesolution that can attempt to recover the image. The bestresults can obta<strong>in</strong> a restoration quality <strong>of</strong> 30 dB measured<strong>in</strong> PSNR, which is quite good. But this is not sufficientfor applications which require that the orig<strong>in</strong>al image befaithfully recovered. In fact, <strong>in</strong> all other cryptographictechniques, it is taken for granted that the decryption <strong>of</strong> aciphertext perfectly recovers the pla<strong>in</strong>text. But visualcryptography has been a glar<strong>in</strong>g exception so far.© 2010 ACADEMY PUBLISHER

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!