节点文献

基于混沌映射的鲁棒性公开水印

Robust Public Watermarking Based on Chaotic Map

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王宏霞何晨丁科

【Author】 WANG Hong-Xia1,2+, HE Chen1, DING Ke1 1(Modern Communication Institute, Shanghai Jiaotong University, Shanghai 200030, China) 2(School of Computer and Communications Engineering, Southwest Jiaotong University, Chengdu 610031, China)

【机构】 上海交通大学现代通信研究所,上海交通大学现代通信研究所,上海交通大学现代通信研究所 上海200030西南交通大学计算机与通信工程学院,四川成都610031,上海200030,上海200030

【摘要】 提出了一种新的DCT(discrete cosine transform)域鲁棒性公开水印算法.该算法利用混沌随机性好和容易再生的特性,首先用散列处理后的混沌序列置乱水印,而后基于混沌序列在宿主图像DCT域的中频带随机选择少量参考点,并在其邻域内用奇偶量化法批量嵌入乱序水印比特.多级混沌密钥的使用与频域系数修改的隐蔽性,加强了水印信息的保密性,在保证隐藏较大容量的有意义二值水印图像的同时,实现了水印信息的盲提取,并在水印的不可见性与鲁棒性之间达到了合理的折衷.

【Abstract】 A new robust public watermarking algorithm in DCT (discrete cosine transform) domain is presented. Due to good randomness and easy reproducibility of chaos, the watermark is firstly permuted by the hashed chaotic sequence, then a small number of reference points are randomly selected in the middle frequency bands of the DCT domain based on the chaotic sequences, and the batch-type disorder watermark bits are embedded into the neighborhood of every reference point using odd-even quantization. The usefulness of multilevel chaotic keys and privacy of modification to frequency coefficients enhance the security of watermark information. The blind extraction of watermarking information is realized under guaranteeing that a larger capacity and significant binary watermark is hidden. Moreover, a reasonable trade-off between the invisibility and robustness is obtained.

【基金】 国家高技术研究发展计划(863);中国博士后科学基金~~
  • 【文献出处】 软件学报 ,Journal of Software , 编辑部邮箱 ,2004年08期
  • 【分类号】TP309
  • 【被引频次】104
  • 【下载频次】399
节点文献中: 

本文链接的文献网络图示:

本文的引文网络