Invisible Watermarking Algorithm based on Zerotree Structure 


Vol. 27,  No. 9, pp. 943-950, Sep.  2002


PDF
  Abstract

In this paper, we propose a watermarking technique that embeds a digital watermark into digital images for the proof of owner or copyright protection. Proposed algorithm is based on discrete wavelet transform. Zerotree structure defined by Shapiro’s embedded zerotree wavelet(EZW) algorithm is used. In the proposed algorithm, a digital watermark is embedded on only significant wavelet coefficients chosen by QSWT for the robustness of the algorithm. In other words, only the values of significant wavelet coefficients are modified in accordance with the given watermark pattern. We use the relationship among neighboring coefficients when modifying chosen coefficients to keep good image quality. Visual recognizable patterns such as binary images are used as a watermark. The experimental results show that the proposed algorithm has robustness under a variety of attacks such as JPEG compression, sharpening and blurring and also show that it has a better performance in PSNR comparing with other algorithms.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

B. Park, D. Kim, D. Kim, J. Yoo, "Invisible Watermarking Algorithm based on Zerotree Structure," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 9, pp. 943-950, 2002. DOI: .

[ACM Style]

Byung-Sun Park, DongUk Kim, Dea-Gung Kim, and Ji-sang Yoo. 2002. Invisible Watermarking Algorithm based on Zerotree Structure. The Journal of Korean Institute of Communications and Information Sciences, 27, 9, (2002), 943-950. DOI: .

[KICS Style]

Byung-Sun Park, DongUk Kim, Dea-Gung Kim, Ji-sang Yoo, "Invisible Watermarking Algorithm based on Zerotree Structure," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 9, pp. 943-950, 9. 2002.