An efficient algorithm for informed embedding of dirty-paper trellis codes for watermarking

Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the original proposal requires a computational expensive second stage, informed embedding, to embed the chosen code into the cover Work. In this paper, we present a computational efficient algorithm for informed embedding. This is accomplished by recognizing that all possible code words are uniformly distributed on the surface of a high n-dimensional sphere. Each codeword is then contained within an (n - 1)dimensional region which defines an n-dimensional cone with the centre of the sphere. This approximates the detection region. This is equivalent to the detection region for normalized correlation detection, for which there are known analytic methods to embed a watermark in a cover Work. We use a previously described technique for embedding with a constant robustness. However, rather than moving the cover Work ...

• Type: Conference
• Year: 2005
• Where: ICIP
• Authors: Gwenaël J. Doërr, Ingemar J. Cox, Lin Lin, Matthew L. Miller
• Keywords: Closest Euclidean Point, Computational Efficient Algorithm, Cover Work, Detection Region, ICIP 2005, Image Processing, Normalized Correlation Detection