Very Fast Watermarking by Reversible Contrast Mapping

  title={Very Fast Watermarking by Reversible Contrast Mapping},
  author={Dinu Coltuc and Jean-Marc Chassery},
  journal={IEEE Signal Processing Letters},
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… Expand
Secure Patients Data Hiding Using Integer Transfer
This letter proposes reversible contrast mapping (RCM) watermarking. RCM watermarking involves the transformation of pixel pairs belonging to the RCM domain. RCM is invertible procedure, because evenExpand
Reversible image watermarking based on a generalized integer transform
The experiments verify that the novel scheme outperforms the original RCM-based method and some state-of-the-art reversible watermarking algorithms, especially the ones based on integer transform. Expand
Steganalysis of Reversible Contrast Mapping Watermarking
The experimental results show that the proposed steganalysis scheme successfully breaks RCM watermarking for various embedding rates and can also accurately estimate the message length. Expand
A modified RCM for reversible watermarking with FPGA implementation
This paper first proposes some modifications on existing RCM technique for further performance improvement in terms of embedding rate and visual distortion, then follows by a hardware architecture implementation in field programmable gate array (FPGA) platform. Expand
Modification in contrast mapping: Reversible watermarking with performance improvement
  • D. Maiti, S. Maity, H. Maity
  • Mathematics
  • 2012 International Conference on Signal Processing and Communications (SPCOM)
  • 2012
Reversible watermarking, a special form of information hiding, becomes appealing for certain applications (for example, medical or military data) where reconstruction of original data is essentialExpand
Improved Capacity Reversible Watermarking
  • D. Coltuc
  • Computer Science
  • 2007 IEEE International Conference on Image Processing
  • 2007
The improved version of the proposed technique provides considerably higher embedding bit-rate and uses a different transform which allows the embedding of watermark codewords into each transformed pixel. Expand
Parity-invariability-based reversible watermarking
A reversible integer transform, defined on an image pixel pair, is proposed. The transform can carry 1-bit watermark while retaining the parity of the sum of the pairs. Also, the transform makes oneExpand
High capacity reversible image watermarking based on integer transform
In this paper, a novel reversible image watermarking method based on integer transform is presented that can provide a very high embedding capacity and performs better than some state-of-the-art algorithms. Expand
FPGA implementation of reversible watermarking in digital images using reversible contrast mapping
A field programmable gate array (FPGA) based very large scale integration (VLSI) architecture of RCM-RW algorithm for digital images that can serve the purpose of media authentication in real-time environment is proposed. Expand
Reversible Watermarking Using Statistical Information
A new scheme is proposed in which utilizing a compressed location map is completely removed and the amount of auxiliary data is decreased by employing the adjacent pixels information, so that independent authentication of different regions of a watermarked image is possible. Expand


Simple reversible watermarking schemes
An integer transform is defined for pairs of pixels that allows watermarking embedding into image LSB plane without any other data compression scheme and, at detection, original image is exactly recovered. Expand
Simple reversible watermarking schemes: further results
The main contribution of this paper is the generalization of the transform for groups of n pixels, where n ⩾ 2, where the size of the map decreases and thus, the hiding capacity of the scheme can increase. Expand
Reversible watermark using the difference expansion of a generalized integer transform
  • A. Alattar
  • Computer Science, Mathematics
  • IEEE Transactions on Image Processing
  • 2004
Results indicate that the spatial, quad-based algorithm developed for color images allows for hiding the largest payload at the highest signal-to-noise ratio. Expand
Circular interpretation of bijective transformations in lossless watermarking for media asset management
Circular interpretation of bijective transformations is proposed to implement a method that fulfills all quality and functionality requirements of lossless watermarking. Expand
Lossless Data Embedding—New Paradigm in Digital Watermarking
This paper introduces a new paradigm for data embedding in images (lossless dataembedding) that has the property that the distortion due to embedding can be completely removed from the watermarked image after the embedded data has been extracted. Expand
Lossless generalized-LSB data embedding
A prediction-based conditional entropy coder which utilizes unaltered portions of the host signal as side-information improves the compression efficiency and, thus, the lossless data-embedding capacity. Expand
Reversible data embedding using a difference expansion
  • Jun Tian
  • Computer Science
  • IEEE Trans. Circuits Syst. Video Technol.
  • 2003
The redundancy in digital images is explored to achieve very high embedding capacity, and keep the distortion low, in a novel reversible data-embedding method for digital images. Expand
SPIE: Security, Steganography, Watermarking Multimedia Contents VIII
  • SPIE: Security, Steganography, Watermarking Multimedia Contents VIII
  • 2006