基于ycog - r颜色空间DCT系数关系的鲁棒图像水印算法

Mohammad Moosazadeh, G. Ekbatanifard
{"title":"基于ycog - r颜色空间DCT系数关系的鲁棒图像水印算法","authors":"Mohammad Moosazadeh, G. Ekbatanifard","doi":"10.1109/IKT.2016.7777788","DOIUrl":null,"url":null,"abstract":"In this paper, a digital image watermarking method in YCoCg-R color space is proposed that uses YCoCg-R color space as a new working environment and coefficients Relation for watermark bits embedding. In the proposed algorithm, in order to pseudo-random selection of the blocks to watermark embedding and spread the distortions of watermarking, the Y channel of the host image is scrambled by Arnold transformation. Then in order to increase security against noise and cutting attacks, every bit of watermark is embedded in three different blocks. So in case of distortion in one block, the two other blocks can be the decision references for the watermark bits correct recognition in this way: a similar position in three different blocks are selected and corresponding coefficient in selected position is compared with DC coefficient in the same block. Then a distance in the amount of (a) is created between these two values based on the corresponding watermark bit. The results of evaluation and comparison with other algorithms show that the proposed method has high resistance against various attacks.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Robust image watermarking algorithm using DCT coefficients relation in YCoCg-R color space\",\"authors\":\"Mohammad Moosazadeh, G. Ekbatanifard\",\"doi\":\"10.1109/IKT.2016.7777788\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a digital image watermarking method in YCoCg-R color space is proposed that uses YCoCg-R color space as a new working environment and coefficients Relation for watermark bits embedding. In the proposed algorithm, in order to pseudo-random selection of the blocks to watermark embedding and spread the distortions of watermarking, the Y channel of the host image is scrambled by Arnold transformation. Then in order to increase security against noise and cutting attacks, every bit of watermark is embedded in three different blocks. So in case of distortion in one block, the two other blocks can be the decision references for the watermark bits correct recognition in this way: a similar position in three different blocks are selected and corresponding coefficient in selected position is compared with DC coefficient in the same block. Then a distance in the amount of (a) is created between these two values based on the corresponding watermark bit. The results of evaluation and comparison with other algorithms show that the proposed method has high resistance against various attacks.\",\"PeriodicalId\":205496,\"journal\":{\"name\":\"2016 Eighth International Conference on Information and Knowledge Technology (IKT)\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Eighth International Conference on Information and Knowledge Technology (IKT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IKT.2016.7777788\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT.2016.7777788","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

本文提出了一种基于ycog - r颜色空间的数字图像水印方法,该方法利用ycog - r颜色空间作为嵌入水印位的新的工作环境和系数关系。该算法采用Arnold变换对主图像的Y通道进行置乱,以实现水印嵌入块的伪随机选择和水印失真的扩散。然后,为了提高对噪声和切割攻击的安全性,每个水印位都嵌入到三个不同的块中。因此,当一个块出现失真时,另外两个块可以作为水印位正确识别的判定参考,方法是:在三个不同的块中选择一个相似的位置,并将所选位置对应的系数与同一块中的DC系数进行比较。然后根据对应的水印位在这两个值之间创建一个数量为(a)的距离。与其他算法的比较和评价结果表明,该算法对各种攻击具有较高的抵抗能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust image watermarking algorithm using DCT coefficients relation in YCoCg-R color space
In this paper, a digital image watermarking method in YCoCg-R color space is proposed that uses YCoCg-R color space as a new working environment and coefficients Relation for watermark bits embedding. In the proposed algorithm, in order to pseudo-random selection of the blocks to watermark embedding and spread the distortions of watermarking, the Y channel of the host image is scrambled by Arnold transformation. Then in order to increase security against noise and cutting attacks, every bit of watermark is embedded in three different blocks. So in case of distortion in one block, the two other blocks can be the decision references for the watermark bits correct recognition in this way: a similar position in three different blocks are selected and corresponding coefficient in selected position is compared with DC coefficient in the same block. Then a distance in the amount of (a) is created between these two values based on the corresponding watermark bit. The results of evaluation and comparison with other algorithms show that the proposed method has high resistance against various attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信