Hyper-Cube Watermarking Scheme

Marc Chaumont (1) , Dalila Goudia (2, 3) , William Puech (1)

1 ICAR - Image & Interaction
2 LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
3 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes

In 2007, Li and Cox showed that their scheme called Perceptual-QIM (P-QIM) was one of the solutions the most successful in order to watermark multi-bits in an image by a quantization approach. Our research led us to take some of their ideas and brought new proposals. This paper presents a new scheme named Hyper-Cube. In addition to re-express the mechanisms of watermarking from a different angle and to give a clear framework, we propose two improvements: the computation of the modified Watson slacks on a neighborhood, and the use of a cleverly integrated error correcting code. Additionally, we experimentally show that the addition of the JPEG quantization table for setting the size of lattices do not reduce performances. This demonstrates that the scheme may easily be integrated in a joint watermarking-compression scheme. Given the obtained results, we can conclude that the Hyper-Cube watermarking scheme is currently one of the most successful technique when one wants to watermark an image using quantization-based approaches.

Mots clés: Robust watermarking; Quantization-based watermarking; Perceptual watermarking; Lattice codes; Watson model; Valumetric attack; High rate; Correcting codes

Domaines: Traitement des images [eess.IV]; Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]; Cryptographie et sécurité [cs.CR]; Réseaux et télécommunications [cs.NI]

Marc Chaumont, Dalila Goudia, William Puech. Hyper-Cube Watermarking Scheme. Electronic Imaging, Jan 2011, San Fransisco, CA, United States. pp.78820B, ⟨10.1117/12.872107⟩. ⟨lirmm-00839371⟩