Image hiding scheme with modulus function and dynamic programming strategy on partitioned pixels

In this paper, we shall propose a novel image-hiding scheme. Our new scheme classifies the host image pixels into two groups of pixels according to the pixel values. For each group of pixels, the corresponding secret pixel values go through an optimal substitution process and are transformed into other pixel values by following the dynamic programming strategy. Then, we can embed the transformed pixel values in the host pixels by using the modulus functions and obtain the stego-image. Extensive experimental results demonstrate that our new method is capable of offering better stego-image quality than a number of well-accepted schemes.     

A novel data hiding scheme based on modulus function

Four criteria are generally used to evaluate the performance of data hiding scheme: the embedding capacity, the visual quality of the stego-image, the security, and the complexity of the data-embedding algorithm. However, data hiding schemes seldom take all these factors into consideration. This paper proposes a novel data hiding scheme that uses a simple modulus function to address all the performance criteria listed above. According to the input secret keys, the encoder and decoder use the same set-generation functions H_r() and H_c() to first generate two sets Kr and Kc. A variant Cartesian product is then created using Kr and Kc. Each cover pixel then forms a pixel group with its neighboring pixels by exploiting an efficient modulus function; the secret data are then embedded or extracted via a mapping process between the variant of the Cartesian product and each pixel group. The proposed scheme offers several advantages, namely (1) the embedding capacity can be scaled, (2) a good visual quality of the stego-image can be achieved, (3) the computational cost of embedding or extracting the secret data is low and requires little memory space, (4) secret keys are used to protect the secret data and (5) the problem of overflow or underflow does not occur, regardless of the nature of the cover pixels.We tested the performance of the proposed scheme by comparing it with Mielikainen’s and Zhang and Wang’s schemes for gray-scale images. The experimental results showed that our proposed scheme outperforms Mielikainen’s in three respects, namely scalable embedding capacity, embedding rate, and level of security. Our data hiding scheme also achieved a higher embedding capacity than Zhang and Wang’s. The proposed scheme can easily be applied to both gray-scale and color images. Analyses of its performance showed that our proposed scheme outperforms Tsai and Wang’s in terms of its time complexity and memory space requirement.     

Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy

The processing of simple least-significant-bit (LSB) substitution embeds the secret image in the least significant bits of the pixels in the host image. This processing may degrade the host image quality so significantly that grabbers can detect that there is something going on in the image that interests them. To overcome this drawback, an exhaustive least-significant-bit substitution scheme was proposed by Wang et al. but it takes huge computation time. Wang et al. then proposed another method that uses a genetic algorithm to search “approximate” optimal solutions and computation time is no longer so huge. In this paper, we shall use the dynamic programming strategy to get the optimal solution. The experimental results will show that our method consumes less computation time and also gets the optimal solution.     

A reversible data hiding scheme using complementary embedding strategy

Obtaining good visual quality and high hiding capacity with reversible data hiding systems is a technically challenging problem. In this paper, we propose a simple reversible data hiding scheme that uses a complementary hiding strategy. The proposed method embeds one secret bit horizontally and vertically into one cover pixel of a grayscale cover image by decreasing odd-valued pixels and increasing even-valued pixels by one. Experimental results show that the hiding capacity measured by bit per pixel (bpp) of the proposed scheme is at least 1.21 bpp with a PSNR (peak signal-to-noise ratio) value greater than 52 dB for all standard test images. Especially in the case of four-layer embedding, the PSNR value of the proposed method is still greater than 51 dB at a hiding capacity of about 5 bpp for all standard test images. In addition, the proposed method is quite simple because it primarily uses additions and subtractions. These results indicate that the proposed scheme is superior to many existing reversible data hiding schemes introduced in the literature.     

Inverted pattern approach to improve image quality of information hiding by LSB substitution

Capacity and invisibility are two targets of the methods for information hiding. Because these two targets contradict each other, to hide large messages into the cover image and remain invisible is an interesting challenge. The simple least-significant-bit (LSB) substitution approach, which embeds secret messages into the LSB of pixels in cover images, usually embeds huge secret messages. After a large message is embedded, the quality of the stego-image will be significantly degraded. In this paper, a new LSB-based method, called the inverted pattern (IP) LSB substitution approach, is proposed to improve the quality of the stego-image. Each section of secret images is determined to be inverted or not inverted before it is embedded. The decisions are recorded by an IP for the purpose of extracting data and the pattern can be seen as a secret key or an extra data to be re-embedded. The experimental results show that our proposed method runs fast and has better results than that of previous works.     

A reversible information hiding scheme using left-right and up-down chinese character representation

Techniques for text data hiding are different from image data hiding, video data hiding and audio data hiding. To break through the difficulty of text data hiding, Sun, Lou and Huang proposed a novel Chinese text data hiding scheme called the L-R scheme. In the L-R scheme, Sun et al. embedded secrets into Chinese characters that can be divided into left and right components. This paper describes how our proposed scheme extends the component concept to incorporate the up and down components of Chinese characters rather than the left and right components only, to significantly enhance hiding capacity. In addition, this paper adds a reversible function to Sun et al.’s L-R scheme to make it possible for receivers to obtain the original cover text and use it repeatedly for later transmission of secrets after the initial hidden secrets have been extracted. Finally, the extended scheme simplifies the extracting procedure and efficiently reduces the memory required on the receiver side during the secret extracting phase by using a new comparison method. Experimental results confirm the improved functions offered by the proposed scheme.     

基于信息隐藏的监控图像防篡改方法

针对当前监控图像可能被恶意篡改的问题,提出了一种基于信息隐藏的监控图像保存及防篡改方法。首先,通过信息隐藏的手段,将监控图像的来源传感器及摄取时间信息进行隐藏,给出了一种基于信息隐藏的监控图像及现场信息保存的大致流程。然后,采用信息隐藏中典型的最低有效比特位( LSB)替换隐藏算法,给出了现场信息的随机嵌入和提取算法。最后,实验分析结果表明,在图像质量得到较好保持的情况下,所提方法能够实现现场信息的有效嵌入和提取,验证了所提方法的可行性和有效性。     

A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function

This study presents a simple method for high-hiding capacity. The basic concept uses a modulus operation. The proposed method has the following advantages: (1) the proposed method outperforms the simple LSB substitution method given the same range (0–m−1) of data digits in the embedded data; (2) the proposed method achieves good image vision quality without the need for post-processing; (3) the proposed method is almost as simple as the LSB method in both coding and decoding; (4) the smaller error advantage over the simple LSB substitution method can also be mathematically verified; (5) the error is smaller than (m−1)/2 for almost every pixel; (6) the proposed method has high-hiding capacity (for example, the proposed method can hide a 256×256 or 256×512 image in a 512×512 host image).     

Function S-rough sets and security-authentication of hiding law

Function S-rbugh sets are defined by R-function equivalence class, which have dynamic characteristic. Function S-rough sets have dynamic characteristic, law characteristic and law-hiding characteristic. Function S-rough sets can generate f-hiding law and f-hiding law. By engrafting, crossing, and penetrating between the information security theory and function S-rough sets, the security hiding and the authentication of f-hiding law and f-hiding law are given respectively in this paper. The fusion and share between function S-rough sets and information security theory is a new research direction of the application of information law in information system.     

A high quality steganographic method with pixel-value differencing and modulus function

In this paper, we shall propose a new image steganographic technique capable of producing a secret-embedded image that is totally indistinguishable from the original image by the human eye. In addition, our new method avoids the falling-off-boundary problem by using pixel-value differencing and the modulus function. First, we derive a difference value from two consecutive pixels by utilizing the pixel-value differencing technique (PVD). The hiding capacity of the two consecutive pixels depends on the difference value. In other words, the smoother area is, the less secret data can be hidden; on the contrary, the more edges an area has, the more secret data can be embedded. This way, the stego-image quality degradation is more imperceptible to the human eye. Second, the remainder of the two consecutive pixels can be computed by using the modulus operation, and then secret data can be embedded into the two pixels by modifying their remainder. In our scheme, there is an optimal approach to alter the remainder so as to greatly reduce the image distortion caused by the hiding of the secret data. The values of the two consecutive pixels are scarcely changed after the embedding of the secret message by the proposed optimal alteration algorithm. Experimental results have also demonstrated that the proposed scheme is secure against the RS detection attack.     

一种基于置乱和融合的图像DCT域信息隐藏算法

提出了一种基于置乱和融合的DCT域图像信息隐藏算法,采取先置乱秘密图像然后在DCT域融合载体图像跟秘密图像的系数矩阵,从而提高隐密图像的不可感知性,也提高了嵌入的信息量。     

基于BMP图像信息隐藏技术的研究与实现

文章首先介绍了信息隐藏技术,然后分析了BMP文件格式,最后对在24位真色彩图像中嵌入隐藏信息的加密技术进行了研究,并给出了加密／解密算法。     

基于均匀置乱与可逆隐藏的双重图像保密算法

加密和隐藏是实现图像保密的2种重要方式,将加密后的图像再隐藏在一幅正常图像中,可以实现对图像的双重保密.基于传统图像置乱变换存在密钥量小和置乱效果差的缺点,提出一种图像位置均匀置乱算法,在密钥量显著提高的前提下,置乱效果得到极大改善,而且加密速度快.在此基础上,对加密后的图像进行隐藏处理.针对目前隐藏算法只保证秘密信息可恢复的特点,提出一种基于图像相邻像素对差值的可逆隐藏算法,在恢复秘密信息的同时也能准确恢复载体图像.仿真实验得出:该算法具有可行性和有效性.     

A local variance-controlled reversible data hiding method using prediction and histogram-shifting

The stego image quality produced by the histogram-shifting based reversible data hiding technique is high; however, it often suffers from lower embedding capacity compared to other types of reversible data hiding techniques. In 2009, Tsai et al. solved this problem by exploiting the similarity of neighboring pixels to construct a histogram of prediction errors; data embedding is done by shifting the error histogram. However, Tsai et al.’s method does not fully exploit the correlation of the neighboring pixels. In this paper, a set of basic pixels is employed to improve the prediction accuracy, thereby increasing the payload. To further improve the image quality, a threshold is used to select only low-variance blocks to join the embedding process. According to the experimental results, the proposed method provides a better or comparable stego image quality than Tsai et al.’s method and other existing reversible data hiding methods under the same payload.     

边缘和纹理优先的可逆数据隐藏算法

为了提高加水印图像的感知质量,对基于图像像素预测误差的嵌入算法进行了研究。优先选择了图像的边缘和纹理进行差值扩展嵌入,并结合压缩性非常高的溢出位置图,实现了高视觉质量、大嵌入容量的可逆数据隐藏算法。     

A high capacity reversible data hiding scheme with edge prediction and difference expansion

To enhance the embedding capacity of a reversible data hiding system, in this paper, a novel multiple-base lossless scheme based on JPEG-LS pixel value prediction and reversible difference expansion will be presented. The proposed scheme employs a pixel value prediction mechanism to decrease the distortion caused by the hiding of the secret data. In general, the prediction error value tends to be much smaller in smooth areas than in edge areas, and more secret data embedded in smooth areas still meets better stego-image quality. The multiple-base notational system, on the other hand, is applied to increase the payload of the image. With the system, the payload of each pixel, determined by the complexity of its neighboring pixels, can be very different. In addition, the cover image processed by the proposed scheme can be fully recovered without any distortion. Experimental results, as shown in this paper, have demonstrated that the proposed method is capable of hiding more secret data while keeping the stego-image quality degradation imperceptible.     

一种新的二值图像信息隐藏与提取算法

在各种形式的数字图像分析中,二值图像信息隐藏及提取的研究相对滞后。提出一种新的信息隐藏与提取算法,可以成功地检测基于分块嵌入的二值图像隐藏信息。结合图像边缘和失真度量两种方法的优点,在考虑块的失真度量的基础上只在图像的外边缘嵌入隐藏信息。实验结果表明,不但可以准确嵌入隐藏信息,嵌入和提取信息的时间短,而且图像失真度相对于两种方法都要大大减少。     

A new steganographic method for color and grayscale image hiding

In this paper, we present a steganographic method for embedding a color or a grayscale image in a true color image. Three types of secret images can be carried by the proposed method: hiding a color secret image, hiding a palette-based 256-color secret image, and hiding a grayscale image in a true color image. Secret data are protected by the conventional crypto system DES. We compare the image quality and hiding capacity of the proposed method with those of the scheme in Lin et al.’s scheme. According to the experimental results, the image quality of the proposed method is better than that of the Lin et al.’s scheme. In addition, annotation data can be hidden with the secret image in the host image. The hiding capacity of the proposed method is greater than that of other compared schemes. The experimental results show that the proposed method is a secure steganographic method that provides high hiding capacity and good image quality.     

图像加密域可分离可逆信息隐藏算法的系统设计与实现

改进了一种图像加密域可分离可逆信息隐藏的算法,设计并实现了一个图像加密域的可分离可逆信息隐藏软件系统。在此系统中,内容拥有者对未压缩的原始图像使用加密密钥进行加密。然后,信息隐藏者使用信息隐藏密钥把加密图像的最低位平面进行压缩,在压缩所得的空余空间里嵌入额外数据。最后得到包含嵌入信息的加密图像：拥有信息隐藏密钥的接收方,尽管不知道原始图片内容也可以提取出隐藏信息;拥有加密密钥的接收方可以获得原始图像的近似图,但是不能提取隐藏信息;如果同时拥有加密密钥和信息隐藏密钥,那么既可以提取出隐藏信息,也可以利用自然图像的空间相关性恢复出图像的相似图像。实例测试的结果表明,算法具有嵌入容量大、操作更灵活的优点。