Reversible data hiding exploiting spatial correlation between sub-sampled images

Reversible data hiding enables host media to be restored from marked media without any loss of host information. Since this reversibility helps to make right decision during image analysis, it is highly desired in quality-sensitive imagery where even the minimal distortion introduced by embedding data is unacceptable. In this paper, we propose a reversible data hiding method that modifies the difference histogram between sub-sampled images. It exploits the high spatial correlation inherent in neighboring pixels to achieve high capacity and imperceptible embedding. On various test images including 16-bit images, we demonstrate the validity of our proposed method by comparing to other existing reversible data hiding algorithms. Experimental results support that our method provides high embedding capacity while keeping the distortions at a low level.     

Reversible data hiding using side-match predictions on steganographic images

Information hiding is an important method to achieve multi-media security. Recently, many researchers have paid attention to the reversible data hiding scheme, which can completely recover original multi-media files after the embedded data are extracted. In this paper, a side-match approach is proposed to achieve more capacity in histogram-based reversible data hiding for grayscale images. The histogram is created by exploiting the difference in all the values between pixels and their predictedive values. Experimental results show that our method is capable of providing a great embedding capacity without causing noticeable distortion. In one-level hiding, where it has the best capacity, our method conserves image qualities larger than 48 dB. Furthermore, in multilevel hiding, a rotation strategy is proposed to further improve image qualities. Experimental results show that our method performs better than other existing methods in multilevel hiding cases.     

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.     

An improved lossless data hiding scheme based on image VQ-index residual value coding

Copyright protection and information security have become serious problems due to the ever growing amount of digital data over the Internet. Reversible data hiding is a special type of data hiding technique that guarantees not only the secret data but also the cover media can be reconstructed without any distortion. Traditional schemes are based on spatial, discrete cosine transformation (DCT) and discrete wavelet transformation (DWT) domains. Recently, some vector quantization (VQ) based reversible data hiding schemes have been proposed. This paper proposes an improved reversible data hiding scheme based on VQ-index residual value coding. Experimental results show that our scheme outperforms two recently proposed schemes, namely side-match vector quantization (SMVQ)-based data hiding and modified fast correlation vector quantization (MFCVQ)-based data hiding.     

基于预测误差修改的医学图像数据隐藏方法

针对医学图像可逆数据隐藏高保真、高容量、高频繁地插入和可逆性等特点,提出了一种基于预测误差修改的可逆数据隐藏算法,不需要对图像进行分块处理,利用加权线性预测得到预测图像,在预测误差直方图中采用4峰值点进行隐秘数据嵌入,较好地解决了医学图像中出现得较多的溢出问题,并在保证图像质量的同时增加了嵌入容量。理论分析和实验结果证明了算法的优越性。     

Prediction-based reversible data hiding

For some applications such as satellite and medical images, reversible data hiding is the best solution to provide copyright protection or authentication. Being reversible, the decoder can extract the hidden data and recover the original image without distortion. In this paper, a reversible data hiding scheme based on prediction error expansion is proposed. The predictive value is computed by using various predictors. The secret data is embedded in the cover image by exploiting the expansion of the difference between a pixel and its predictive value. Experimental results show that our method is capable of providing a great embedding capacity without making noticeable distortion. In addition, the proposed scheme is also applicable to various predictors.     

Quadruple Difference Expansion-Based Reversible Data Hiding Method for Digital Images

ABSTRACT

Lossless data hiding is a special type of data hiding technique that guarantees not only the secret data but also the ability of cover media to be reconstructed without any distortion. A latest lossless data hiding technique is proposed by Hong Lin Jin's that is based on hiding only one data bit in the spatial domain in gray-level image. However, this method uses double difference expansion to embed bits which results in a small embedding capacity. For this purpose, we propose an improved algorithm with the potential of increasing the payload capacity and maintaining good image quality. The proposed improved algorithm is characterized by two aspects. First, the proposed improved reversible data hiding scheme is enhanced to exhibit data hiding in color palette images. Second, the embedding level is improved by using quadruple difference expansion to guarantee the embedding of 2-bit data into color images. Experiments of the proposed improved method have been conducted over several well-known test images. The results show that the proposed improved method significantly improves the embedding capacity over Hong Lin Jin's scheme by the range of 15–35% for grayscale images and 20–46% for color images while still maintaining the quality of the stego-images.     

Huffman-code strategies to improve MFCVQ-based reversible data hiding for VQ indexes

Data hiding, which embeds secret data into cover media, is one type of technology used to achieve the multimedia security. A reversible data hiding method has the characteristic that the cover media can be completely reconstructed after secret data are extracted. Recently, some reversible data hiding schemes have focused on the vector quantization (VQ)-compressed format. Using the modified fast correlation vector quantization (MFCVQ) concept, Lu et al. proposed a reversible data hiding scheme for VQ-index tables. In this paper, a new MFCVQ-based scheme is proposed. Specifically, our method will enlarge the embedding capacities by embedding multiple bits into a VQ index, thereby reducing the compressed bit rates by applying the Huffman-code concept and the 0-centered classification. Experimental results indicate that this method has greater pure embedding capacities and fewer compressed bit rates than that of previous MFCVQ-based methods.     

Image reversibility in data embedding on the basis of blocking-predictions

The popularity of peer-to-peer (P2P) multimedia file sharing applications such as voice, files, images, video, texts have created a flurry of recent research activity into P2P architectures. Reversible data hiding has drawn considerable attention in recent years. Being reversible, the decoder can extract the hidden data and recover the cover image completely. In this paper we used the block prediction to achieve histogram-based reversible data hiding. The histogram is created by exploiting all difference values between pixels and their predictive values. Experimental results show that our scheme is capable of providing great embedding capacity without making noticeable distortion. In the one-level data hiding, our scheme preserves image quality larger than 48 dB and has the best capacity. Moreover, in the multilevel cases, our scheme performs better than other existing schemes. Our scheme can successfully increase the embedding capacity from histogram-based data hiding and preserve image quality well.     

An encoding method for both image compression and data lossless information hiding

Reversible image data hiding technology means the cover image can be totally recovered after the embedded secret data is extracted. In this paper, we propose a reversible image data hiding scheme based on vector quantization (VQ) compressed images. The secret bits are embedded into the VQ index table by modifying the index value according to the difference of neighboring indices. The data hiding capacity and the size of the final codestream (embedded result) are a trade-off, and it can be decided by users. In other words, the proposed scheme has flexible hiding capacity ability. To estimate the performance, the proposed scheme was compared with the scheme proposed by Wang and Lu (2009). The results of the comparison showed that our proposed scheme is superior to the scheme proposed by Wang and Lu in both data hiding capacity and bit rate.     

Reversibility of image with balanced fidelity and capacity upon pixels differencing expansion

Reversible data hiding has attracted considerable attention in recent years. Being reversible, the decoder can extract hidden data and recover the original image completely, and the difference expansion (DE) scheme can lead to a lossless pixel after secret data exacting. Furthermore, despite achieving pixel reversibility based on the concept of expanded differencing, the difference expansion scheme can cause enormous image distortion because of the size of the difference. The proposed scheme in this paper describes a novel prediction for achieving predictive error based reversible data hiding by considering the relation between a pixel and its neighboring pixel and using the predictor to identify the projected difference in pixel value. Experimental results show that the proposed scheme is capable of providing great embedding capacity without causing noticeable distortion by selecting the minimal predictor based on pixel expansion. In multilevel cases, this proposed method performs better than other existing methods. Moreover, the proposed scheme is able to pass the Chi-square test, a test used to find whether an image utilizes LSB for data hiding.     

Embedding capacity raising in reversible data hiding based on prediction of difference expansion

Most of the proposed methods of reversible data hiding based on difference expansion require location maps to recover cover images. Although the location map can be compressed by a lossless compression algorithm, this lowers embedding capacity and increases computational cost during the procedures of embedding and extracting. The study presents an adaptive reversible data scheme based on the prediction of difference expansion. Since each cover pixel generally resembles its surrounding pixels, most of the difference values between the cover pixels and their corresponding predictive pixels are small; therefore, the proposed scheme gains from embedding capacity by taking full advantage of the large quantities of smaller difference values where secret data can be embedded. The proposed scheme offers several advantages, namely, (1) the location map is no more required, (2) the embedding capacity can be adjusted depending on the practical applications, and (3) the high embedding capacity with minimal visual distortion can be achieved. Moreover, the experimental results demonstrate that the proposed scheme yields high embedding capacity by comparing the related schemes that are proposed recently.     

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.     

利用改进整数变换实现图像无损信息隐藏

为了在图像中实现无损信息隐藏,并提高数据嵌入容量和隐蔽性,给出一种基于改进整数变换的无损信息隐藏方法。首先对图像块采用改进算法进行整数变换,使得变换前后图像块引入失真较少,然后自适应选择整数变换后引入失真较小的可修改图像块进行整数变换,并嵌入较大数据量的机密信息,在公共信道进行传输后接收端能正确提取机密信息,并无损恢复原宿主图像。实验结果表明,该方法具有较大的数据嵌入容量和较好的隐蔽性,可用于医学图像中隐藏病历信息及遥感、军事图像的无损隐秘传输等领域。     

Adaptive real-time reversible data hiding for JPEG images

Data hiding used to embed data, such as copyright information, into various forms of media such as image, audio, or text with a minimum amount of perceivable degradation to the “host” signal. Therefore, in many cases, the cover media contain distortions even after the hidden data have been extracted. Thus, to extend the application of data hiding to some sensitive domains such as military, medical, and fine arts, which require the embedded cover images to be properly covered, reversible data hiding has become another new branch of this field. Our proposed scheme is inspired by Chang et al.’s idea. In this paper, we propose adaptive real-time reversible data hiding for JPEG images using successive zero coefficients in zigzag sequences of discrete cosine transformation blocks. The contribution of our proposed scheme successfully enhances the hiding capacity while the image quality of stego image and reversibility are maintained. The result of experiments conducted indicates that the proposed scheme enhances data hiding capacity, image quality, and improves performance.     

A path optional lossless data hiding scheme based on VQ joint neighboring coding

Data hiding is an important technique for covert communication that embeds secret data into a cover image with minimal perceptible degradation. Lossless data hiding is a special type of data hiding technique that guarantees not only the secret data but the cover media can be reconstructed without any distortion. In this paper, a novel path optional lossless data hiding scheme based on the joint neighboring coding (JNC) of the vector quantization (VQ) index table is proposed. The proposed scheme generates a VQ index table based on the cover image first. Next, according to an initial key and secret data content, different adjacent indices may be chosen to perform joint neighboring coding for each index and hide secret data. Finally, an appropriate output codestream is generated based on the minimal length principle. Our main contributions lie in three aspects: (1) the method combines the novel path_based shift method with the traditional JNC method to improve the capacity and stego image quality simultaneously. (2) The secret data extraction and cover image recovering processes are separated and both can be publicized to users. (3) The method is path optional to meet various users’ requirements. To testify the superiority of the proposed method, we compare it with the side match VQ (SMVQ)-based and modified fast correlation VQ (MFCVQ)-based algorithms. According to the experimental results, the proposed scheme outperforms the SMVQ-based and MFCVQ-based algorithms in four aspects, i.e., hiding capacity, stego image quality, transmission efficiency and security level.     

Using quad smoothness to efficiently control capacity-distortion of reversible data hiding

One of the main uses of data hiding is to protect secret messages being transmitted on the Internet. Reversible data hiding can fully recover the original host image after extracting the secret message. It is especially suitable for applications where, after extracting the secret message, the quality of the recovered host image cannot be compromised, such as for medical or military image data.Many difference-expansion-based (DE-based) reversible data hiding methods have made use of a threshold value to control the stego-image's quality. Usually repeated trial and error is required to find a relatively good threshold with acceptable capacity-distortion behavior. This paper introduces a scheme that does not require a threshold value, such as is used in Alattar's quad-based reversible data hiding. It applies a prediction of quad of quads smoothness to determine the embedding sequence. The proposed scheme is shown to perform better than other DE-based schemes. Results showed that it has the ability of maintaining embedding quality at all capacity levels, especially when the embedding capacity is at low to medium levels.     

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.     

Reversible steganography based on side match and hit pattern for VQ-compressed images

Data hiding is an important technique in multimedia security. Multimedia data hiding techniques enable message senders to disguise secret data by embedding them into cover media. Thus, delivering secret messages is as easy as sending the cover media. Recently, many researchers have studied reversible data hiding for images. Those methods can reconstruct the original cover image and extract the embedded secret data from a stego-image. This study proposes a novel reversible steganographic method of embedding secret data into a vector quantization (VQ) compressed image by applying the concept of side match. The proposed method uses extra information, namely the hit pattern, to achieve reversibility. Moreover, its small hit pattern enables the embedding of the entire hit pattern along with the secret data in most cases. To optimize visual quality of the output stego-image, the method applies the concept of partitioned codebooks (state codebooks). The partition operation on the codebook uses a look-up table to minimize embedding and extraction time. We also propose the use of diagonal seed blocks to embed the entire hit pattern into the cover image without producing any extra control messages. Compared to the Chang and Lin method, the experimental results show that the proposed method has higher capacity, better visual quality, and shorter execution time.     

A reversible data hiding scheme based on the Sudoku technique

Data hiding, also known as information hiding, plays an important role in information security for various purposes. Reversible data hiding is a technique that allows distortion-free recovery of both the cover image and the secret information. In this paper, we propose a new, reversible data hiding scheme that is based on the Sudoku technique and can achieve higher embedding capacity. The proposed scheme allows embedding more secret bits into a pair of pixels while guaranteeing the good quality of the stego-image. The experimental results showed that the proposed scheme obtained higher embedding capacity than some other previous schemes. In addition, our proposed scheme maintained the good visual quality of the stego-image (i.e., PSNR > 46 dB), which outperforms some existing schemes.