Performance analysis of ST-DM watermarking in presence of nonadditive attacks

The performance of spread-transform dither modulation (ST-DM) watermarking in the presence of two important classes of non additive attacks, such as the gain attack plus noise addition, and the quantization attack are evaluated. The analysis is developed under the assumption that the host features are independent and identically distributed Gaussian random variables, and that a minimum distance criterion is used to decode the hidden information. The theoretical bit-error probabilities are derived in closed form, thus permitting to evaluate the impact of the considered attacks on the watermark at a theoretical level. The analysis is validated by means of extensive Monte Carlo simulations. In addition to the validation of the theoretical analysis, Monte Carlo simulations permitted to abandon the hypothesis of normally distributed host features, in favor of more realistic models adopting a Laplacian or a generalized Gaussian probability density function. The general result of our analysis is that the excellent performance of ST-DM are confirmed in all cases with the only noticeable exception of the gain attack.

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

[2]  Gregory W. Wornell,et al.  Achievable performance of digital watermarking systems , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[3]  Ingemar J. Cox,et al.  Watermarking as communications with side information , 1999, Proc. IEEE.

[4]  Kannan Ramchandran,et al.  Watermarking based on duality with distributed source coding and robust optimization principles , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[5]  Pierre Moulin,et al.  The role of information theory in watermarking and its application to image watermarking , 2001, Signal Process..

[6]  Gregory W. Wornell,et al.  Quantization index modulation: A class of provably good methods for digital watermarking and information embedding , 2001, IEEE Trans. Inf. Theory.

[7]  Amos Lapidoth,et al.  The Gaussian watermarking game , 2000, IEEE Trans. Inf. Theory.

[8]  Kannan Ramchandran,et al.  Robust turbo-based data hiding for image and video sources , 2002, Proceedings. International Conference on Image Processing.

[9]  Fernando Pérez-González,et al.  Performance analysis of existing and new methods for data hiding with known-host information in additive channels , 2003, IEEE Trans. Signal Process..

[10]  Ingemar J. Cox,et al.  Applying informed coding and embedding to design a robust high-capacity watermark , 2004, IEEE Transactions on Image Processing.