4.7 Article

A wavelet-tree-based watermarking method using distance vector of binary cluster

期刊

EXPERT SYSTEMS WITH APPLICATIONS
卷 36, 期 6, 页码 9869-9878

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2009.02.036

关键词

Watermark; Blind watermarking method; Copyright protection; Significant coefficient; Wavelet tree; Distance vector

资金

  1. National Science Council [NSC-97-2221-E-129-007, NSC-97-2221-E-239-022]

向作者/读者索取更多资源

This paper proposes a wavelet-tree-based watermarking method using distance vector of binary cluster for copyright protection. In the proposed method. wavelet trees are classified into two clusters using the distance vector to denote binary watermark bits. The two smallest wavelet coefficients in a wavelet tree are used to reduce distortion of a watermarked image. The distance vector. which is obtained from the two smallest coefficients of a wavelet tree, is quantized to decrease image distortion. The trees are classified into two clusters so that they exhibit a sufficiently large statistical difference based on the distance vector, which difference is then used for subsequent watermark extraction. We compare the statistical difference and the distance vector of a wavelet tree to decide which watermark bit is embedded in the embedding process. The experimental results show that the watermarked image looks Visually identical to the original and the watermark can be effectively extracted upon image processing attacks. (C) 2009 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据