A high-capacity invertible data-hiding algorithm using a generalized reversible integer transform

Stach, John; Alattar, A.M.

doi:10.1117/12.527173

Cited by 8 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The same idea has already been used to increase the embedding bit-rate by generalizing the diference expansion scheme 1, 2 for groups of three and four pixels. 4,5 We show in this paper that the extension of our approach for any n ≥ 2 preserves the lower mathematical complexity of the original scheme 3 with an improvement in data hiding capacity.…”

Section: Introductionmentioning

confidence: 95%

See 1 more Smart Citation

Simple reversible watermarking schemes: further results

Coltuc

Chassery

2006

SPIE Proceedings

View full text Add to dashboard Cite

This paper continues the researches on a recently proposed reversible watermarking approach based on an integer transform defined for pairs of pixels. The transform is invertible and, besides, for some pairs of pixels, the original values are recovered even if the LSBs of the transformed pixels are overwritten. Two watermarking schemes, a simple one and a modified version, have been developed to embed watermarks into image LSB plane without any other data compression. At detection, original image is exactly recovered by using a simple map which keeps track of the transformed pairs and the LSBs of the unchanged pairs of pixels. The main contribution of this paper is the generalization of the transform for groups of n pixels, where n ≥ 2. Transforming groups larger than 2 pixels, the size of the map decreases and thus, the hiding capacity of the scheme can increase. In this general context, it appears that the behavior of the transform depends on the parity of n i.e., n even is more appropriate for reversible watermarking. It is also shown that, for n ≥ 4 the simple scheme and the modified one give very similar data hiding capacity, i.e., the same performance is obtained at a lower computational cost.

show abstract

Section: Introductionmentioning

confidence: 95%

“…[1][2][3][4][5] Our approach 3 is of very low computational complexity. We are using an integer transform defined for pairs of pixels.…”

Section: Introductionmentioning

confidence: 99%

Simple reversible watermarking schemes: further results

Coltuc

Chassery

2006

SPIE Proceedings

View full text Add to dashboard Cite

show abstract

“…Tian reported a capacity of 0.84 bits/pixel at 31.24 dB for the Lena image, which was higher than any of the previously proposed methods. The method was subsequently extended by Alattar et al [4,5] to spatial and cross color triplets and then to a generalized reversible integer transform. For more details on these particular reversible watermarking techniques and the history of their development, see [8,Chapter 16].…”

Section: Introductionmentioning

confidence: 98%

Reversible transformations may improve the quality of reversible watermarking

Kamath

2010

SPIE Proceedings

View full text Add to dashboard Cite

We investigate the use of reversible pre-embedding transformations to enhance reversible watermarking schemes for images. We are motivated by the observation that a (non-reversible) sorting transformation dramatically increases the quality of the embedding when combined with a reversible watermark based on a generalized integer transform. In one example we obtain a PSNR gain of 23 dB using the pre-sorting approach over the regular embedding method for the same payload size. This may provide opportunities for increasing the embedding capacity by trading off the quality for a larger payload size. We test several reversible sorting approaches but these do not provide us any gain in the watermarking capacity or quality.

show abstract