• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (11): 21-27.

• 论文 • 上一篇    下一篇

一种彩色图像无损鲁棒数字水印算法

翦环1,陈志刚1,邓小鸿2,邓晓衡1,漆华妹1   

  1. (1.中南大学信息科学与工程学院,湖南 长沙 410083;2.江西理工大学应用科学学院,江西 赣州 341000)
  • 收稿日期:2011-09-12 修回日期:2011-11-21 出版日期:2012-11-25 发布日期:2012-11-25
  • 基金资助:

    国家自然科学基金资助项目(61073186);湖南省科技厅重点项目(2010TP1001);中南大学中央高校基本科研业务费专项资金(2011QNZT023)

A Lossless Robust Watermarking Scheme for Color Image

JIAN Huan1,CHEN Zhigang1,DENG Xiaohong2,DENG Xiaoheng1,QI Huamei1   

  1. (1.School of Information Science and Engineering,Central South University,Changsha 410083;
    2.School  of Applied Science,Jiangxi University of Science of Technology,Ganzhou 341000,China)
  • Received:2011-09-12 Revised:2011-11-21 Online:2012-11-25 Published:2012-11-25

摘要:

本文针对空域无损水印的脆弱性缺陷,提出了一种新的无损鲁棒数字水印算法。首先将原始彩色图像划分为R、G、B三原色子通道,然后将每个子通道进行不重叠分块,计算各分块算术差值。通过给定的规则调整算术差值,在三个通道中嵌入重复的水印信息。在数据提取阶段,对三原色子通道分别提取出水印信息。根据投票理论,判决生成最后的水印信息。实验结果表明,本文提出的算法能较好地抵抗JPEG压缩、高斯和盐椒等噪声攻击,具有较强的鲁棒性。

关键词: 版权保护, 无损水印, 鲁棒性, 投票决策

Abstract:

In order to solve the fragile property of lossless watermarking algorithms in spatial domain, a new robust reversible watermarking method is proposed. Firstly, the original color image is separated into three primary colors channels: red (R), green (G) and blue (B). Then, each channel is divided into nonoverlapping blocks and the arithmetic difference is computed. The watermark information is embedded into channels repeatedly by shifting arithmetic differences according to the given rule. In the extracting procedure, the three layer watermark information can be extracted from three primary colors channels of stegoimages respectively, and the final water information is generated based on voting theory. Experimental results show that the proposed scheme can resist JPEGcompression, the Gaussian noise, salt and pepper noise attack, and has better robustness.

Key words: copyright protection;lossless watermarking;robustness;majority voting