检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:翦环[1] 陈志刚[1] 邓小鸿[2] 邓晓衡[1] 漆华妹[1]
机构地区:[1]中南大学信息科学与工程学院,湖南长沙410083 [2]江西理工大学应用科学学院,江西赣州341000
出 处:《计算机工程与科学》2012年第11期21-27,共7页Computer Engineering & Science
基 金:国家自然科学基金资助项目(61073186);湖南省科技厅重点项目(2010TP1001);中南大学中央高校基本科研业务费专项资金(2011QNZT023)
摘 要:本文针对空域无损水印的脆弱性缺陷,提出了一种新的无损鲁棒数字水印算法。首先将原始彩色图像划分为R、G、B三原色子通道,然后将每个子通道进行不重叠分块,计算各分块算术差值。通过给定的规则调整算术差值,在三个通道中嵌入重复的水印信息。在数据提取阶段,对三原色子通道分别提取出水印信息。根据投票理论,判决生成最后的水印信息。实验结果表明,本文提出的算法能较好地抵抗JPEG压缩、高斯和盐椒等噪声攻击,具有较强的鲁棒性。In order to solve the fragile property of lossless watermarking algorithms in spatial do- main, a new robust reversible watermarking method is proposed. Firstly, the original color image is sep- arated into three primary colors channels: red (R), green (G) and blue (B). Then, each channel is di- vided 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 theo- ry. Experimental results show that the proposed scheme can resist JPEG-compression, the Gaussian noise, salt and pepper noise attack, and has better robustness.
分 类 号:TP309.2[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.190.49