• April 25, 2019

Request PDF on ResearchGate | Halftone visual cryptography via error diffusion. | Halftone visual cryptography (HVC) enlarges the area of visual cryptography. Request PDF on ResearchGate | Halftone Visual Cryptography Via Error Diffusion | Halftone visual cryptography (HVC) enlarges the area of. Halftone visual cryptography (HVC) enlarges the area of visual cryptography by the addition of digital halftoning techniques. In particular, in.

Author: Taukasa Mocage
Country: Bermuda
Language: English (Spanish)
Genre: Science
Published (Last): 24 November 2009
Pages: 488
PDF File Size: 5.59 Mb
ePub File Size: 1.80 Mb
ISBN: 596-3-66306-667-4
Downloads: 35330
Price: Free* [*Free Regsitration Required]
Uploader: Zulmaran

The secret image is encoded into two cies of the shares and no cryptographic computation is needed.

Error diffusion errir proposed in this paper as the halftoning al- VIII. To this end, a constant-value grayscale image of gray levelhaving the same size of a share image is first diffusino.

However, the shares For method 2, the requirement of a complementary pair is generated by EVC is basically based on pixels expansion. Improvement of Image Quality The robustness of the proposed scheme to the contrast loss As stated previously, the quality index heavily affects the attributes to the fact that shares have well-defined local struc- image quality of the halftone shares. We extend our previous work on halftone visual cryptography and propose a new method that can encode the secret pixels into the shares via simple error diffusion.

If is white, it results in one white and one black subpixel, corresponding to a gray level Manuscript received June 24, ; revised April 22, Furthermore, ABPs should be dis- troduction of ABPs also brings additional quantization error that tributed as homogenously as possible and maximally separated should be diffused away.

Dithering with Blue Noise. The perceived error is calcu- whose image quality is not consistent over the whole image.

Skip to search form Skip to main content. The matrix collections can be obtained qualified sets and call members of forbidden sets.

The zation block in halftone error diffusion. In such a complementary pair, one of the shares simply replacing the thresholding block by a multilevel quanti- is called the primary share which shows a natural image. Multitone error diffusion can complementary share are determined by the underlying VSS al- generate multitone images where the pixels of each tone are gorithm, as in other shares. If a sufficient number of black pixels good image quality of the halftone share. As shown in 9and no operation is needed.


Formally, the two collectionsobtained by extracting rows from each matrix 3 inare indistinguishable.

Halftone Visual Cryptography Through Error Diffusion

If decoded digitally, we can measure the local intensity of pleasing halftone shares, but it also introduces higher contrast the reconstructed image by filtering the visial through a running loss in the reconstructed images. Method 1 tend to be complimentary to those of the others. However, by simple linear filtering, the For ease of comparison, we replicate Fig.

See [7] for construction structed image [7].

For example, is desirable for applications where the complementary share is if there is one bright white region on one image, there should acceptable and does not raise suspicion of secret encoding. The reconstructed image is shown in Fig.

Then example, in visual authentication, the complementary share is the halftoning of the grayscale images will generate most of the kept private to the verifier and is not accessible to the adversary. Given a secret halftone visual information and are complementary to each other. The of the decoded image is worse. Here, ages, method 3 can also generate shares with visually pleasing images Tank, Lena, and Baboon are used.

Moreover, using the void The remaining sections of this paper are organized as follows. Ifone forming any cryptographic computation. In method 2, it can be changed. The noise introduced by encoded secret pixels is totally diffused away to neighboring pixels and pleasing halftone shares can be achieved.

Error diffusion is used to Kos, Greece, May Pixels indicated by or are non-SIPs. The distribution of pixels with tone 6 indicates a pixel distribution denoted by. Error diffusion is used in our method as it is a computationally efficient way to generate halftone shares. If the pixel is black, the pixel in Fig. By using optimal number of ABPs in a halftone cell is the blue noise multitone error diffusion, an output image with tones is produced.

Topics Discussed in This Paper. This procedure only de- generated and the halftone share is structured taking meaningful pends on the underlying VC scheme. For the ABPs, they are assigned value As an example, assume the share has size 6 8 and is par- 1 black. Under the same VC [32]. After such a proce- using the algorithm proposed in [23], we obtain homogenous dure, there are exactly SIPs in each halftone cell. The security of the produced tains much less cross interference from the share images.


Share Structure is shown in Fig. Furthermore, there should be a suf- distribution of SIPs and the distribution of ABPs, the distribu- ficient number of ABPs in the shares so that the visual infor- tions of SIPs and ABPs should be optimized jointly to avoid low mation of one share is completely blocked by the ABPs on the frequency spectral interference among them [23].

Halftone Visual Cryptography Through Error Diffusion – Semantic Scholar

Multitone error diffusion is obtained by structed image. It holds that for all if and for all. Then we measure the local intensity of cryptographj data within the error diffusion also affects the image quality of the shares. Finally, conclusions are presented in Section IX.

However, cannot be have not yet been generated, black pixels are deliberately in- arbitrarily large both in method 1 and method 2. The construction of the matrix is as follows.

By carefully selecting the grayscale im- is and the size of errorr halftone cell is 4 4. A visually pleasing halftone method using method 1 achieves better image quality when the image share can be obtained if and is small, and if underlying VSS scheme and the HVC expansion are the same the HVC expansion is sufficiently large.

The secret image will be encoded into three halftone algorithm for multitoning can also be used to generate the dis- shares which include a complementary pair. As another example, consider a 2-out-of-3 halftone VSS scheme where a secret image pixel is encoded into a halftone the visual information of the other shares.