A Robust Digital Watermarking Algorithm Based on Digital Image Security


Article Preview

Digital watermarking has been proposed as a way to claim the ownership of the source and owner of the digital image data. In this paper, A robust algorithm based on DCT region is proposed to improve the image security. The main transforming is based on DCT (Discrete Cosine Transform). The algorithm was processed in the MATLAB software. In this paper, images of gray scale and RGB color scale were researched respectively. For color images, in order to get the best image quality, the RGB scale was transformed to YcbCr scale. Then, the Y channel (brightness channel) was separated, in which the watermark was embedded and extracted. The results show that the algorithm embedded a certain size of black and white Bitmap image into gray and color images. The watermark can’t be seen by the naked eye. The robustness detection experiment was also carried out. The watermark can still be extracted after certain amount of tailoring, defacing, Gaussian noise, and format changes. The similarity is more than 0.7. It confirmed that the algorithm is highly robust.



Edited by:

OUYANG Yun, XU Min and YANG Li






X. Y. Hu and X. P. Zhao, "A Robust Digital Watermarking Algorithm Based on Digital Image Security", Advanced Materials Research, Vol. 174, pp. 144-147, 2011

Online since:

December 2010




[1] Zhao Yao: Chinese Journal of Electrinics(2006), pp.634-637.

[2] PivaA, Bartolini. BamiM: IEEE Internet Computing pp.18-26, (2002).

[3] Kundur D, Hatzinakos D. : Proceeding of The IEEE(1999) , pp.1167-1180.

[4] Gong Shengrong, Liu Chunping, Wang Qiang: Digital Image Processing and Analysis (Tsinghua University Press, China 2006).

[5] Abou Ella Hassanien: INFORMATICA (2006), p.187-198.

[6] Zhang Jing, Zhang Chun-tian: The third National Conference on Information Hiding (2001) pp.151-157.

[7] S.A.M. Gilani A.N. Skodra: International Review on Computers and Software(2007), pp.653-660.

[8] Su Yunxing, Wei Lili: Human Science and Technology Vol. 5 (2006), pp.27-28.

In order to see related information, you need to Login.