Secure grayscale image communication using significant visual cryptography scheme in real time applications

2019 ◽  
Vol 79 (15-16) ◽  
pp. 10363-10382 ◽  
Author(s):  
G. Selva Mary ◽  
S. Manoj Kumar
Author(s):  
Rahul Sharma ◽  
Nitesh Kumar Agrawal ◽  
Ayush Khare ◽  
Arup Kumar Pal

In this paper, the authors have presented a (n, n) extended visual cryptography scheme where n numbers of meaningful shares furnish a visually secret message. Initially they have converted a grayscale image into binary image using dithering method. Afterwards, they have incorporated pixel's eight neighboring connectivity property of secret image during formation of meaningful shares. The scheme is able to generate the shares without extending its size. This approach has enhanced the visual quality of the recovered secret image from n numbers of shares. The scheme has been tested with some images and satisfactory results are achieved. The scheme has improved the contrast of the recovered secret image than a related (n, n) extended visual cryptography scheme.


2018 ◽  
pp. 886-904
Author(s):  
Abul Hasnat ◽  
Santanu Halder ◽  
Debotosh Bhattacharjee ◽  
Mita Nasipuri

The proposed work is a novel grayscale face image colorization approach using a reference color face image. It takes a reference color image which presumably contains semantically similar color information for the query grayscale image and colorizes the grayscale face image with the help of the reference image. In this novel patch based colorization, the system searches a suitable patch on reference color image for each patch of grayscale image to colorize. Exhaustive patch search in reference color image takes much time resulting slow colorization process applicable for real time applications. So PSO is used to reduce the patch searching time for faster colorization process applicable in real time applications. The proposed method is successfully applied on 150 male and female face images of FRAV2D database. “Colorization Turing test” was conducted asking human subject to choose the image (close to the original color image) between colorized image using proposed algorithm and recent methods and in most of the cases colorized images using the proposed method got selected.


Cryptography ◽  
2020 ◽  
pp. 449-457
Author(s):  
Rahul Sharma ◽  
Nitesh Kumar Agrawal ◽  
Ayush Khare ◽  
Arup Kumar Pal

In this paper, the authors have presented a (n, n) extended visual cryptography scheme where n numbers of meaningful shares furnish a visually secret message. Initially they have converted a grayscale image into binary image using dithering method. Afterwards, they have incorporated pixel's eight neighboring connectivity property of secret image during formation of meaningful shares. The scheme is able to generate the shares without extending its size. This approach has enhanced the visual quality of the recovered secret image from n numbers of shares. The scheme has been tested with some images and satisfactory results are achieved. The scheme has improved the contrast of the recovered secret image than a related (n, n) extended visual cryptography scheme.


2017 ◽  
Vol 1 (1) ◽  
pp. 72-89 ◽  
Author(s):  
Abul Hasnat ◽  
Santanu Halder ◽  
Debotosh Bhattacharjee ◽  
Mita Nasipuri

The proposed work is a novel grayscale face image colorization approach using a reference color face image. It takes a reference color image which presumably contains semantically similar color information for the query grayscale image and colorizes the grayscale face image with the help of the reference image. In this novel patch based colorization, the system searches a suitable patch on reference color image for each patch of grayscale image to colorize. Exhaustive patch search in reference color image takes much time resulting slow colorization process applicable for real time applications. So PSO is used to reduce the patch searching time for faster colorization process applicable in real time applications. The proposed method is successfully applied on 150 male and female face images of FRAV2D database. “Colorization Turing test” was conducted asking human subject to choose the image(close to the original color image) between colorized image using proposed algorithm and recent methods and in most of the cases colorized images using the proposed method got selected.


1989 ◽  
Author(s):  
Insup Lee ◽  
Susan Davidson ◽  
Victor Wolfe

Author(s):  
Ekta Y

As IT sector is ruling the world now,confidentiality and security of information has become the most important inseparable aspect in information communication system. Keeping in view the same, a new approach called Visual Cryptography (VC) has been suggested by many researchers but there are some limitations with this scheme and cheating is one of the main problem among them. This paper intends to show the basis of cheating in VC in terms of cheating process, its detection methods and its prevention methods suggested by various researchers along with their merits and demerits. Finally, a good Cheating Immune Visual Cryptography Scheme (CIVCS) has been discussed which states the properties to be adopted by every Visual Cryptography scheme to make it immune to cheating attacks.


Sign in / Sign up

Export Citation Format

Share Document