A Digital Watermarking Method by Double Encryption Based on Arnold and Chaos in DCT Domain

Article Preview

Abstract:

Digital watermarking is an efficient method for the intellectual property protection and identification. A digital watermarking method by double encryption based on Arnold and chaos in DCT domain was proposed in this paper. First, the digital watermarking was transformed by Arnold scrambling, and then the watermarking was encrypted by chaos system again, so it made the watermarking get double encryption. The encrypted watermarking was embedded into the parts of low-frequency coefficients. The experimental results show that the algorithm is effective and robust for several attacks such as common noise, filtering, cropping and JPEG compression, as well as its good security.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

104-107

Citation:

Online since:

June 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Jun Zhang, Nengchao Wang, Baochang Shi, Public Watermarking for Digital Images, Journal of Image and Graphics, 14(4): 365-368. (2002).

Google Scholar

[2] Hengfu Yang, Xiaowei Chen, A Robust Public Watermark Algorithm in DCT Domain, Computer Engineering, 29(6): 142-144. (2003).

Google Scholar

[3] Rong Zheng, Cong Jin, Wen fen Wei, Digital image watermark algorithm in DCT domain with chaotic encryption, Computer Applications, 25(10): 2365-2366. (2005).

Google Scholar

[4] V. I. Arnold, A. Avez. Ergodic Problems of Classical Mechanics. Mathematical Physics Monograph Series. New York: W. A. Benjam in, Inc. . (1968).

Google Scholar

[5] Liang Shan, Hao Qiang, Jun Li, Zhi-quan Wang, Chaotic optimization algorithm based on Tent map, Control and Decision, 20(2): 179-182. (2005).

Google Scholar

[6] Tao Xiang, Kwokwo Wong, Xiaofeng Liao, An improved chaotic cryptosystem with external key. Communications in Nonlinear Science and Numerical Simulation, 13(9): 1879-1887. (2008).

DOI: 10.1016/j.cnsns.2007.04.017

Google Scholar