Very Fast Watermarking by Reversible Contrast Mapping

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 in...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2007-04, Vol.14 (4), p.255-258
Main Authors: Coltuc, D., Chassery, J.-M.
Format: Article
Language:English
Subjects:
Complexity
Computer Science
Computer Vision and Pattern Recognition
Costs
Data compression
Data encapsulation
Difference expansion
embedding bit-rate
Equations
Histograms
Information Theory
Mapping
Mathematical analysis
Mathematics
Multimedia
Pixel
Pixels
RCM
reversible contrast mapping (RCM)
reversible watermarking
Robustness
Table lookup
Transforms
Watermarking
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 well
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2006.884895