scispace - formally typeset
Search or ask a question
Author

D.M. Thodi

Bio: D.M. Thodi is an academic researcher from University of Arizona. The author has contributed to research in topics: Digital watermarking & Embedding. The author has an hindex of 3, co-authored 3 publications receiving 1338 citations.

Papers
More filters
Journal ArticleDOI
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

Proceedings ArticleDOI
24 Oct 2004
TL;DR: This work proposes a new reversible watermarking algorithm that exploits the redundancy in the image to achieve very high data embedding rates while keeping the resulting distortion low.
Abstract: Reversible watermarking has become a highly desirable subset of fragile watermarking for sensitive digital imagery in application domains such as military and medical because of the ability to embed data with zero loss of host information. This reversibility enables the recovery of the original host content upon verification of the authenticity of the received content. We propose a new reversible watermarking algorithm. The algorithm exploits the correlation inherent among the neighboring pixels in an image region using a predictor. The prediction-error at each location is calculated and, depending on the amount of information to be embedded, locations are selected for embedding. Data embedding is done by expanding the prediction-error values. A compressed location map of the embedded locations is also embedded along with the information bits. Our algorithm exploits the redundancy in the image to achieve very high data embedding rates while keeping the resulting distortion low.

204 citations

Proceedings ArticleDOI
28 Mar 2004
TL;DR: A new reversible (lossless) watermarking algorithm for digital images that exploits the inherent correlation among the adjacent pixels in an image region using a predictor to embed a large payload while keeping the distortion low.
Abstract: We propose a new reversible (lossless) watermarking algorithm for digital images. Being reversible, the algorithm enables the recovery of the original host information upon the extraction of the embedded information. The proposed technique exploits the inherent correlation among the adjacent pixels in an image region using a predictor. The information bits are embedded into the prediction errors, which enables us to embed a large payload while keeping the distortion low. A histogram shift at the encoder enables the decoder to identify the embedded location.

89 citations


Cited by
More filters
Journal ArticleDOI
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

Journal ArticleDOI
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

Journal ArticleDOI
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

Book ChapterDOI
25 May 2003
TL;DR: A theoretical proof and numerous experiments show that the PSNR of the marked image generated by this method is always above 48 dB, which is much higher than other reversible data hiding algorithms.
Abstract: This paper presents a novel reversible data hiding algorithm, which can recover the original image without distortion from the marked image after the hidden data have been extracted. This algorithm utilizes the zero or the minimum point of the histogram and slightly modifies the pixel values to embed data. It can embed more data as compared to most of the existing reversible data hiding algorithms. A theoretical proof and numerous experiments show that the PSNR of the marked image generated by this method is always above 48 dB, which is much higher than other reversible data hiding algorithms. The algorithm has been applied to a wide range of different images successfully. Some experimental results are presented to demonstrate the validity of the algorithm.

672 citations

Journal ArticleDOI
TL;DR: This paper proposes a novel method by reserving room before encryption with a traditional RDH algorithm, and thus it is easy for the data hider to reversibly embed data in the encrypted image.
Abstract: Recently, more and more attention is paid to reversible data hiding (RDH) in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content's confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may be subject to some errors on data extraction and/or image restoration. In this paper, we propose a novel method by reserving room before encryption with a traditional RDH algorithm, and thus it is easy for the data hider to reversibly embed data in the encrypted image. The proposed method can achieve real reversibility, that is, data extraction and image recovery are free of any error. Experiments show that this novel method can embed more than 10 times as large payloads for the same image quality as the previous methods, such as for PSNR=40 dB.

610 citations