Very Fast Watermarking by Reversible Contrast Mapping
Authors:
- Dinu ColtucDCDinu Coltuc
- Jean-Marc ChasseryJCJean-Marc Chassery
Top Cited Papers
- 19 March 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 14 (4) , 255-258
Abstract
Reversible contrast mapping (RCM) is a simple integer transform that applies to pairs of pixels. For some pairs of pixels, RCM is invertible, even if the least significant bits (LSBs) of the transformed pixels are lost. The data space occupied by the LSBs is suitable for data hiding. The embedded information bit-rates of the proposed spatial domain reversible watermarking scheme are close to the highest bit-rates reported so far. The scheme does not need additional data compression, and, in terms of mathematical complexity, it appears to be the lowest complexity one proposed up to now. A very fast lookup table implementation is proposed. Robustness against cropping can be ensured as wellKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Simple reversible watermarking schemes2005
- Lossless generalized-LSB data embeddingIEEE Transactions on Image Processing, 2005
- Reversible Watermark Using the Difference Expansion of a Generalized Integer TransformIEEE Transactions on Image Processing, 2004
- Reversible data embedding using a difference expansionIEEE Transactions on Circuits and Systems for Video Technology, 2003
- Circular interpretation of bijective transformations in lossless watermarking for media asset managementIEEE Transactions on Multimedia, 2003
- Lossless Data Embedding—New Paradigm in Digital WatermarkingEURASIP Journal on Advances in Signal Processing, 2002