Reversible data embedding using a difference expansion
01 Aug 2003-IEEE Transactions on Circuits and Systems for Video Technology (IEEE)-Vol. 13, Iss: 8, pp 890-896
TL;DR: The redundancy in digital images is explored to achieve very high embedding capacity, and keep the distortion low, in a novel reversible data-embedding method for digital images.
Abstract: Reversible data embedding has drawn lots of interest recently Being reversible, the original digital content can be completely restored We present a novel reversible data-embedding method for digital images We explore the redundancy in digital images to achieve very high embedding capacity, and keep the distortion low
Citations
More filters
TL;DR: It is proved analytically and shown experimentally that the peak signal-to-noise ratio of the marked image generated by this method versus the original image is guaranteed to be above 48 dB, which is much higher than that of all reversible data hiding techniques reported in the literature.
Abstract: A novel reversible data hiding algorithm, which can recover the original image without any distortion from the marked image after the hidden data have been extracted, is presented in this paper. This algorithm utilizes the zero or the minimum points of the histogram of an image and slightly modifies the pixel grayscale values to embed data into the image. It can embed more data than many of the existing reversible data hiding algorithms. It is proved analytically and shown experimentally that the peak signal-to-noise ratio (PSNR) of the marked image generated by this method versus the original image is guaranteed to be above 48 dB. This lower bound of PSNR is much higher than that of all reversible data hiding techniques reported in the literature. The computational complexity of our proposed technique is low and the execution time is short. The algorithm has been successfully applied to a wide range of images, including commonly used images, medical images, texture images, aerial images and all of the 1096 images in CorelDraw database. Experimental results and performance comparison with other reversible data hiding schemes are presented to demonstrate the validity of the proposed algorithm.
2,240 citations
Cites background or methods or result from "Reversible data embedding using a d..."
...It has been reported in [15] that the embedding capacity achieved by the difference expansion method is much higher than that achieved by [10]....
[...]
...Later, a difference expansion scheme was developed by Tian [15], which has greatly advanced the performance of reversible data hiding in terms of data embedding capacity versus PSNR of marked images with respect to original images....
[...]
...Tian’s method (CSVT03) (2nd) 10....
[...]
...Tian presented a promising high capacity reversible data embedding algorithm in [15]....
[...]
...[16,17], which have demonstrated superior performance over that reported in [15]....
[...]
TL;DR: The experimental results for many standard test images show that prediction-error expansion doubles the maximum embedding capacity when compared to difference expansion, and there is a significant improvement in the quality of the watermarked image, especially at moderate embedding capacities.
Abstract: Reversible watermarking enables the embedding of useful information in a host signal without any loss of host information. Tian's difference-expansion technique is a high-capacity, reversible method for data embedding. However, the method suffers from undesirable distortion at low embedding capacities and lack of capacity control due to the need for embedding a location map. We propose a histogram shifting technique as an alternative to embedding the location map. The proposed technique improves the distortion performance at low embedding capacities and mitigates the capacity control problem. We also propose a reversible data-embedding technique called prediction-error expansion. This new technique better exploits the correlation inherent in the neighborhood of a pixel than the difference-expansion scheme. Prediction-error expansion and histogram shifting combine to form an effective method for data embedding. The experimental results for many standard test images show that prediction-error expansion doubles the maximum embedding capacity when compared to difference expansion. There is also a significant improvement in the quality of the watermarked image, especially at moderate embedding capacities
1,229 citations
TL;DR: In this paper, a generalization of the well-known least significant bit (LSB) modification is proposed as the data-embedding method, which introduces additional operating points on the capacity-distortion curve.
Abstract: We present a novel lossless (reversible) data-embedding technique, which enables the exact recovery of the original host signal upon extraction of the embedded information. A generalization of the well-known least significant bit (LSB) modification is proposed as the data-embedding method, which introduces additional operating points on the capacity-distortion curve. Lossless recovery of the original is achieved by compressing portions of the signal that are susceptible to embedding distortion and transmitting these compressed descriptions as a part of the embedded payload. A prediction-based conditional entropy coder which utilizes unaltered portions of the host signal as side-information improves the compression efficiency and, thus, the lossless data-embedding capacity.
1,058 citations
TL;DR: This paper presents a reversible or lossless watermarking algorithm for images without using a location map in most cases that employs prediction errors to embed data into an image.
Abstract: This paper presents a reversible or lossless watermarking algorithm for images without using a location map in most cases. This algorithm employs prediction errors to embed data into an image. A sorting technique is used to record the prediction errors based on magnitude of its local variance. Using sorted prediction errors and, if needed, though rarely, a reduced size location map allows us to embed more data into the image with less distortion. The performance of the proposed reversible watermarking scheme is evaluated using different images and compared with four methods: those of Kamstra and Heijmans, Thodi and Rodriguez, and Lee et al. The results clearly indicate that the proposed scheme can embed more data with less distortion.
773 citations
Cites background or methods from "Reversible data embedding using a d..."
...The prediction errors are better for embedding more data compared to the difference values [1], [2], [7], [15]....
[...]
...If the location map is compressed, Alattar’s method significantly outperforms Tian’s method....
[...]
...Thus, the uncompressed location map size is decreased from one-half of the image resolution (for Tian’s method) to one-third or one-fourth of the resolution (for triplets or quads), respectively....
[...]
...[8] improved the difference expansion methods [7], [15] by using a novel simplified location map approach....
[...]
...The maximum possible capacity for their method is 1 b/pixel in the ideal situation, so this method is generally considered to be better than other methods based on pairs [7], [15] (with maximum possible capacity 0....
[...]
TL;DR: This work proposes a novel reversible data hiding scheme for encrypted image, where the additional data can be embedded into the image by modifying a small proportion of encrypted data.
Abstract: This work proposes a novel reversible data hiding scheme for encrypted image. After encrypting the entire data of an uncompressed image by a stream cipher, the additional data can be embedded into the image by modifying a small proportion of encrypted data. With an encrypted image containing additional data, one may firstly decrypt it using the encryption key, and the decrypted version is similar to the original image. According to the data-hiding key, with the aid of spatial correlation in natural image, the embedded data can be successfully extracted and the original image can be perfectly recovered.
768 citations
Cites background from "Reversible data embedding using a d..."
...A number of reversible data hiding methods have been proposed in recent years....
[...]
References
More filters
10 Dec 2002
TL;DR: A prediction-based conditional entropy coder which utilizes static portions of the host as side-information improves the compression efficiency, and thus the lossless data embedding capacity.
Abstract: We present a novel reversible (lossless) data hiding (embedding) technique, which enables the exact recovery of the original host signal upon extraction of the embedded information. A generalization of the well-known LSB (least significant bit) modification is proposed as the data embedding method, which introduces additional operating points on the capacity-distortion curve. Lossless recovery of the original is achieved by compressing portions of the signal that are susceptible to embedding distortion, and transmitting these compressed descriptions as a part of the embedded payload. A prediction-based conditional entropy coder which utilizes static portions of the host as side-information improves the compression efficiency, and thus the lossless data embedding capacity.
1,126 citations
"Reversible data embedding using a d..." refers background or methods in this paper
...Celik,et al. [8], [9], present a high capacity, low distortion reversible data-embedding algorithm by compressing quantiza ion residues....
[...]
...To minimize the mean square error between the original image and embedded image, we should select with small magnitudes for the DE....
[...]
Patent•
26 May 1999TL;DR: Arbitrary digital information is embedded within a stream of digital data, in a way that avoids detection by a casual observer and that allows a user to determine whether the digital data have been modified from their intended form.
Abstract: Arbitrary digital information is embedded within a stream of digital data, in a way that avoids detection by a casual observer and that allows a user to determine whether the digital data have been modified from their intended form. The embedded information may only be extracted as authorized and may be used to verify that the original digital data stream has not been modified.
982 citations
TL;DR: This paper introduces a new paradigm for data embedding in images (lossless dataembedding) that has the property that the distortion due to embedding can be completely removed from the watermarked image after the embedded data has been extracted.
Abstract: One common drawback of virtually all current data embedding methods is the fact that the original image is inevitably distorted due to data embedding itself. This distortion typically cannot be removed completely due to quantization, bit-replacement, or truncation at the grayscales 0 and 255. Although the distortion is often quite small and perceptual models are used to minimize its visibility, the distortion may not be acceptable for medical imagery (for legal reasons) or for military images inspected under nonstandard viewing conditions (after enhancement or extreme zoom). In this paper, we introduce a new paradigm for data embedding in images (lossless data embedding) that has the property that the distortion due to embedding can be completely removed from the watermarked image after the embedded data has been extracted. We present lossless embedding methods for the uncompressed formats (BMP, TIFF) and for the JPEG format. We also show how the concept of lossless data embedding can be used as a powerful tool to achieve a variety of nontrivial tasks, including lossless authentication using fragile watermarks, steganalysis of LSB embedding, and distortion-free robust watermarking.
702 citations
"Reversible data embedding using a d..." refers background or methods in this paper
...Fridrich,et al. [1], develop a high capacity reversible data-embedding technique based on embedding message on bits in the status of group of pixels....
[...]
...…of information needed to be embedded (payload and 1051-8215/03$17.00 © 2003 IEEE original values in the embedding area) is larger than that of the embedding area, techniques in [1], [7]–[9] rely on lossless data compression on the original values in the embedding area, and the space saved from…...
[...]
...3) Complexity:what is the algorithm complexity?...
[...]
...To minimize the mean square error between the original image and embedded image, we should select with small magnitudes for the DE....
[...]
Patent•
07 May 1998TL;DR: In this paper, a method and system embeds digital meta-data into an original image in such a way that the meta data can be completely removed at a later time to allow loss less recovery of the original image.
Abstract: The method and system embeds digital meta-data into an original image in such a way that the meta-data can be completely removed at a later time to allow loss less recovery of the original image. The loss less recovery of the original image allows for a digital signature of the image to be embedded in the image itself and later recovered and used to verify the authenticity of a received image.
472 citations
TL;DR: Circular interpretation of bijective transformations is proposed to implement a method that fulfills all quality and functionality requirements of lossless watermarking.
Abstract: The need for reversible or lossless watermarking methods has been highlighted in the literature to associate subliminal management information with losslessly processed media and to enable their authentication. The paper first analyzes the specificity and the application scope of lossless watermarking methods. It explains why early attempts to achieve reversibility are not satisfactory. They are restricted to well-chosen images, strictly lossless context and/or suffer from annoying visual artifacts. Circular interpretation of bijective transformations is proposed to implement a method that fulfills all quality and functionality requirements of lossless watermarking. Results of several bench tests demonstrate the validity of the approach.
438 citations
"Reversible data embedding using a d..." refers background in this paper
...In this paper, we present a high-capacity, high visual quality, reversible data-embedding method for digital images....
[...]
...[6], propose a reversible data-embedding algorithm by circular interpretation of bijective transformations....
[...]