Robustness Analysis of QIM Watermarking against Additional Noise

Article Preview

Abstract:

A mutual information function was defined as a criterion measuring the robustness of watermarking algorithm. Considering QIM scheme, error probability of watermarking can be calculated to validate the measurement of mutual information function. By mean of numerical computation, mutual information under Gaussian noise and uniform noise is calculated with change of noise standard deviation. In the experiment, an audio section is selected as the host and their third lever wavelet detail coefficients are quantified according to watermark bit series. Experiment results show that statistic Bit Error Rate (BER) is matched with evaluation conclusion of mutual information method when step is on the small side. Mutual information function can be selected as a cost function to evaluate the robustness of watermarking algorithm, and predict the BER.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 225-226)

Pages:

601-604

Citation:

Online since:

April 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M.H.M. Costa. Writing on dirty paper[J]. IEEE Transactions on Information Theory, 1983, IT-29(3): 439–441.

DOI: 10.1109/tit.1983.1056659

Google Scholar

[2] S.I. Gel'fand, M.S. Pinsker, Coding for channel with random parameters [J]. Problems of Control and Information Theory , 1980, 9(1), 19–31.

Google Scholar

[3] B. Chen and G. W. Wornell, Provably robust digital watermarking[C]. Proc. SPIE, vol. 3845 of Multimedia Syst. Applications II, 1999, p.43–54.

Google Scholar

[4] N. Merhav, E. Sabbag. Optimal watermark embedding and detection strategies under limited detection resources[J]. IEEE Transactions on Information Theory, 2008, 54(1): 255-274.

DOI: 10.1109/tit.2007.911210

Google Scholar

[5] H.T. Sencar, M. Ramkumar, A.N. Akansu. An overview of scalar quantization based data hiding methods[J]. Signal processing, 2006, 86(5): 893-914.

DOI: 10.1016/j.sigpro.2005.07.018

Google Scholar

[6] T. M. Cover, and J. A. Thomas, Elements of Information Theory[M]. New York: Wiley, 2006: 140-165.

Google Scholar

[7] L. Pérez-Freire, F. Pérez-González, T. Furon, and et al. Security of lattice-based data hiding against the known message attack [J]. IEEE Transactions Information Forensics and Security, 2006, 1(4): p.421–439.

DOI: 10.1109/tifs.2006.885029

Google Scholar