A trellis-based informed embedding with linear codes for digital watermarking

This paper proposes a novel informed embedding method based on a modified trellis structure for a digital watermarking system. This algorithm are capable of embedding adaptive robust watermarking bits according to various length of linear block codes in a host image of size 512×512 pixels. Instead of using randomly generated reference vectors as arc labels, this algorithm employs the codewords of a linear block code to label the arcs in the trellis. There are two advantages to use linear block code as arc. The first is to provide a satisfactory space partition for each trellis section, and the second is to perform embedding algorithm featuring linear block codes for each trellis section. Moreover, the algorithm proposed here is capable of performing iteration so as to find a trade off between robustness and fidelity by use of some controllable parameters. We report the robustness and fidelity performance of this algorithm in Gaussian noise and JPEG compression. Moreover, the proposed trellis-based informed embedding has much less computation complexity, compared to other informed embedding methods.