Some theoretical aspects of watermarking detection

This paper considers watermarking detection, also known as zero-bit watermarking. A watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the presence of this particular weak signal in content. The paper aims at looking to this problem from a classical detection theory point of view, but with side information enabled at the embedding side. This means that the watermarking signal is a function of the host content. Our study is twofold. The first issue is to design the best embedding function for a given detection function (a Neyman-Pearson detector structure is assumed). The second issue is to find the best detection function for a given embedding function. This yields two conditions, which are mixed into one 'fundamental' differential equation. Solutions to this equation are optimal in these two senses. Interestingly, there are other solutions than the regular quantization index modulation scheme. The JANIS scheme, for instance, invented in a heuristic manner several years ago, is justified as it is one of these solutions.

[1]  Edward J. Delp,et al.  Advances in Digital Video Content Protection , 2005, Proceedings of the IEEE.

[2]  B. Ripley,et al.  Robust Statistics , 2018, Encyclopedia of Mathematical Geosciences.

[3]  H. Vincent Poor,et al.  An Introduction to Signal Detection and Estimation , 1994, Springer Texts in Electrical Engineering.

[4]  E. Diehl,et al.  Copy protection system for digital home networks , 2004, IEEE Signal Processing Magazine.

[5]  Pedro Comesaña Alfaro,et al.  Detection in quantization-based watermarking: performance and security issues , 2005, IS&T/SPIE Electronic Imaging.

[6]  Eric DIEHL,et al.  /spl copy/ watermark: closing the analog hole , 2003, 2003 IEEE International Conference on Consumer Electronics, 2003. ICCE..

[7]  E. Delp,et al.  Security, steganography, and watermarking of multimedia contents , 2004 .

[8]  Pierre Moulin,et al.  Error exponents for one-bit watermarking , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[9]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[10]  Ingemar J. Cox,et al.  Informed embedding: exploiting image and detector information during watermark insertion , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[11]  Henrique S. Malvar,et al.  Improved spread spectrum: a new modulation technique for robust watermarking , 2003, IEEE Trans. Signal Process..

[12]  Ingemar J. Cox,et al.  Digital Watermarking , 2003, Lecture Notes in Computer Science.

[13]  Pierre Moulin,et al.  Optimal sparse-QIM codes for zero-rate blind watermarking , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[14]  Michael G. Strintzis,et al.  Locally optimum nonlinearities for DCT watermark detection , 2004, IEEE Transactions on Image Processing.

[15]  Bo Zhang,et al.  Robust Detection of Transform Domain Additive Watermarks , 2005, IWDW.

[16]  Neri Merhav,et al.  An Information – Theoretic View of Watermark Embedding – Detection and Geometric Attacks , 2005 .

[17]  Neil J. Hurley,et al.  Improved polynomial detectors for side-informed watermarking , 2003, IS&T/SPIE Electronic Imaging.

[18]  Thomas S. Huang,et al.  Robust optimum detection of transform domain multiplicative watermarks , 2003, IEEE Trans. Signal Process..

[19]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.

[20]  Bernd Girod,et al.  Informed Watermarking , 2002 .

[21]  Mauro Barni,et al.  Optimum decoding and detection of multiplicative watermarks , 2003, IEEE Trans. Signal Process..

[22]  Richard E. Blahut,et al.  Principles and practice of information theory , 1987 .

[23]  Benoit M. Macq,et al.  JANIS: Just Another n-order Side-Informed Watermarking Scheme , 2002, Proceedings. International Conference on Image Processing.