A Visual Hiding Algorithm Based on Human Visual System

2014 ◽  
Vol 989-994 ◽  
pp. 2393-2397
Author(s):  
Rui Dong ◽  
Dao Shun Wang

Image information hiding is a way of concealing secret information within another image or file. The previous researches of image information hiding extract secret by calculating. An algorithm based on HVS (Human Visual System) is proposed in this paper. We first decide the embedding region and embedding strength of secret image based on edge and texture information. Then, a pair of invert images is chosen as the cover images, and the stego images are constructed by modifying the pixels of the cover images through the proposed criterion. Correspondingly, the secret image can be recovered through overlaying the two stego images.

Author(s):  
Chin-Chen Chang ◽  
Kuo-Feng Hwang

A simple image hiding scheme in spatial domain is proposed in this chapter. The main idea is to utilize a threshold mechanism to embed as much information of the secret image into the cover image as possible. The changing of the cover image is hard to be discovered by the human eyes because the threshold mechanism is setup especially to fit the human visual system. The experimental results show that the human visual system has improved the quality in terms of perceptibility. On the hiding capacity issue, the proposed method has capability to embed two times the size of the secret image of previous work. A partial encryption strategy is used for the security of the secret image. In addition, a two-dimensional permutation function, torus automorphism, is also introduced in this chapter.


Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 838 ◽  
Author(s):  
Peng Li ◽  
Liping Yin ◽  
Jianfeng Ma

Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows printed on transparencies. Stacking shadows can visually decode the secret image without computational resources. Specifically, a (k, n) threshold VCS ((k, n)-VCS) shares a secret image into n shadows, stacking any k shadows can reveal the secret image by human visual system, while any less than k shadows cannot decode any information regarding the secret image. In practice, some participants (essentials) play more important roles than others (non-essentials). In this paper, we propose a (t, s, k, n) VCS with essential participants (so called (t, s, k, n)-EVCS). The secret image is shared into n shadows with s essentials and n-s non-essentials. Any k shadows, including at least t essentials, can reveal the secret image. The proposed scheme is constructed from a monotonic (K, N)-VCS. The condition and optimal choice of (K, N)-VCS to construct (t, s, k, n)-EVCS are given by solving integer programming model. The experimental results are conducted to verify the feasibility of our scheme.


2017 ◽  
Vol 9 (2) ◽  
pp. 45-56 ◽  
Author(s):  
Xuehu Yan ◽  
Yuliang Lu ◽  
Lintao Liu ◽  
Song Wan ◽  
Wanmeng Ding ◽  
...  

In this paper, homomorphic visual cryptographic scheme (HVCS) is proposed. The proposed HVCS inherits the good features of traditional VCS, such as, loss-tolerant (e.g., (k, n) threshold) and simply reconstructed method, where simply reconstructed method means that the decryption of the secret image is based on human visual system (HVS) without any cryptographic computation. In addition, the proposed HVCS can support signal processing in the encrypted domain (SPED), e.g., homomorphic operations and authentication, which can protect the user's privacy as well as improve the security in some applications, such as, cloud computing and so on. Both the theoretical analysis and simulation results demonstrate the effectiveness and security of the proposed HVCS.


2021 ◽  
Vol 13 (4) ◽  
pp. 57-70
Author(s):  
Xintao Duan ◽  
Baoxia Li ◽  
Daidou Guo ◽  
Kai Jia ◽  
En Zhang ◽  
...  

Steganalysis technology judges whether there is secret information in the carrier by monitoring the abnormality of the carrier data, so the traditional information hiding technology has reached the bottleneck. Therefore, this paper proposed the coverless information hiding based on the improved training of Wasserstein GANs (WGAN-GP) model. The sender trains the WGAN-GP with a natural image and a secret image. The generated image and secret image are visually identical, and the parameters of generator are saved to form the codebook. The sender uploads the natural image (disguise image) to the cloud disk. The receiver downloads the camouflage image from the cloud disk and obtains the corresponding generator parameter in the codebook and inputs it to the generator. The generator outputs the same image for the secret image, which realized the same results as sending the secret image. The experimental results indicate that the scheme produces high image quality and good security.


Steganography is an information security technique that consists of concealing secret data into digital medias including videos, texts, network protocols and images. In this paper, a steganography method to dissimulate the secret information in gray-scale images is proposed; the dissimulation is adapted to the cover image’s texture, data is hidden in the edge areas. The edge pixels are selected by over-segmentation using Modified Simple Linear Iterative Clustering (M-SLIC). This algorithm allows to decompose the cover image into K regions which we call superpixels. The image’s texture and the amount of the secret data are the factors that help to determine the value of the parameter K. Choosing the pixels of complex regions to conceal secret information is due to the fact that the human visual system is designed to notice changes in the pixels of smooth areas. Therefore, edge areas tolerate larger changes than smooth areas without causing detectable distortions. Experiment on a large set of images were carried out; results illustrate the good performance of the proposed work in terms of capacity, security and imperceptibility in comparison to recent works.


Cryptography ◽  
2020 ◽  
pp. 416-427
Author(s):  
Xuehu Yan ◽  
Yuliang Lu ◽  
Lintao Liu ◽  
Song Wan ◽  
Wanmeng Ding ◽  
...  

In this paper, homomorphic visual cryptographic scheme (HVCS) is proposed. The proposed HVCS inherits the good features of traditional VCS, such as, loss-tolerant (e.g., (k, n) threshold) and simply reconstructed method, where simply reconstructed method means that the decryption of the secret image is based on human visual system (HVS) without any cryptographic computation. In addition, the proposed HVCS can support signal processing in the encrypted domain (SPED), e.g., homomorphic operations and authentication, which can protect the user's privacy as well as improve the security in some applications, such as, cloud computing and so on. Both the theoretical analysis and simulation results demonstrate the effectiveness and security of the proposed HVCS.


Sign in / Sign up

Export Citation Format

Share Document