A novel digital watermark algorithm based on bits group

This paper based on DCT transformation designs a digital watermark scheme with the advantages of imperceptibility and robustness by grouping every n watermark bits in a group and changing only one coefficient each time in turns. The simulation result shows that the performance of the proposed algorithm is better than those of the other algorithms.

[1]  Ingemar J. Cox,et al.  Secure spread spectrum watermarking for multimedia , 1997, IEEE Trans. Image Process..

[2]  Yi Shi,et al.  Embedding image watermarks in dc components , 2000, IEEE Trans. Circuits Syst. Video Technol..

[3]  Mauro Barni,et al.  A DCT-domain system for robust image watermarking , 1998, Signal Process..

[4]  Lee-Ming Cheng,et al.  Adaptive watermarking by using pixel position shifting technique , 1999, IEEE Trans. Consumer Electron..

[5]  Ja-Ling Wu,et al.  Gradient Original Image After JPEG compression or image processing Gradient magnitude Mean of gradient magnitude Determine amount of hidden watermark bits Intensity image Mean of gradient magnitude , 2002 .

[6]  Min Wu,et al.  Attacks on digital watermarks , 1999, Conference Record of the Thirty-Third Asilomar Conference on Signals, Systems, and Computers (Cat. No.CH37020).

[7]  Shinfeng D. Lin,et al.  A robust DCT-based watermarking for copyright protection , 2000, 2000 Digest of Technical Papers. International Conference on Consumer Electronics. Nineteenth in the Series (Cat. No.00CH37102).

[8]  Ja-Ling Wu,et al.  Hidden digital watermarks in images , 1999, IEEE Trans. Image Process..

[9]  C. F. Osborne,et al.  A digital watermark , 1994, Proceedings of 1st International Conference on Image Processing.