Very Fast Watermarking by Reversible Contrast Mapping

Author

Coltuc, Dinu ; Chassery, Jean-Marc

Author_Institution

Valahia Univ. of Targoviste, Bucharest

Volume

14

Issue

4

fYear

2007

fDate

4/1/2007 12:00:00 AM

Firstpage

255

Lastpage

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 well

Keywords

data encapsulation; image coding; table lookup; transforms; watermarking; RCM; data hiding; embedded information bit-rate; integer transform; lookup table implementation; reversible contrast mapping; spatial domain reversible watermarking scheme; Costs; Data compression; Data encapsulation; Equations; Histograms; Pixel; Robustness; Table lookup; Transforms; Watermarking; Difference expansion; embedding bit-rate; reversible contrast mapping (RCM); reversible watermarking;

fLanguage

English

Journal_Title

Signal Processing Letters, IEEE

Publisher

ieee

ISSN

1070-9908

Type

jour

DOI

10.1109/LSP.2006.884895

Filename

4130391