Hermite polynomials as provably good functions to watermark white gaussian hosts
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
Evaluation of an optimal watermark tampering attack against dirty paper trellis schemes
Proceedings of the 10th ACM workshop on Multimedia and security
Asymptotically optimum universal watermark embedding and detection in the high-SNR regime
IEEE Transactions on Information Theory
Towards robust and secure watermarking
Proceedings of the 12th ACM workshop on Multimedia and security
| Hi-index | 0.06 |
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in a piece of content. The watermark detector checks for the presence of this particular weak signal in received contents. The article looks at this problem from a classical detection theory point of view, but with side information enabled at the embedding side. This means that the watermark signal is a function of the host content. Our study is twofold. The first step is to design the best embedding function for a given detection function, and the best detection function for a given embedding function. This yields two conditions, which are mixed into one 'fundamental' partial differential equation. It appears that many famous watermarking schemes are indeed solution to this 'fundamental' equation. This study thus gives birth to a constructive framework unifying solutions, so far perceived as very different