基于分割DCT信道的盲水印方法

Z. Rozsnyik, I. Loványi
{"title":"基于分割DCT信道的盲水印方法","authors":"Z. Rozsnyik, I. Loványi","doi":"10.1109/VIPROM.2002.1026663","DOIUrl":null,"url":null,"abstract":"A novel blind watermarking method for 8 bit grayscale images in 8/spl times/8 block DCT (discrete cosine transform) domain is presented. The method is based on an advanced spread-spectrum algorithm (see Cox, I.J. et al., NEC Research Institute Technical Report p.95-100, 1995). However, instead of correlation analysis in the detection phase, it extracts the difference between the histogram properties of pairs of subchannels. Histogram transformation is not reversible, which provides added security. Each channel is built from different DCT coefficients for the 8/spl times/8 block and the histogram describes their distribution. There are 63 AC and one DC coefficients. Channels are partitioned into some pairs of subchannels, which contain a single bit mark, thus the number of possible watermarks equals the power of 2 of the sub-channel pairs. We do not use all the channels - only the robust ones. Subchannels are generated by a key. Embedding does not change the image very much as we use a special embedding function. Watermarks currently resist JPEG compression up to QF (quality factor) 5.","PeriodicalId":223771,"journal":{"name":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Blind watermarking method using partitioned DCT channels\",\"authors\":\"Z. Rozsnyik, I. Loványi\",\"doi\":\"10.1109/VIPROM.2002.1026663\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel blind watermarking method for 8 bit grayscale images in 8/spl times/8 block DCT (discrete cosine transform) domain is presented. The method is based on an advanced spread-spectrum algorithm (see Cox, I.J. et al., NEC Research Institute Technical Report p.95-100, 1995). However, instead of correlation analysis in the detection phase, it extracts the difference between the histogram properties of pairs of subchannels. Histogram transformation is not reversible, which provides added security. Each channel is built from different DCT coefficients for the 8/spl times/8 block and the histogram describes their distribution. There are 63 AC and one DC coefficients. Channels are partitioned into some pairs of subchannels, which contain a single bit mark, thus the number of possible watermarks equals the power of 2 of the sub-channel pairs. We do not use all the channels - only the robust ones. Subchannels are generated by a key. Embedding does not change the image very much as we use a special embedding function. Watermarks currently resist JPEG compression up to QF (quality factor) 5.\",\"PeriodicalId\":223771,\"journal\":{\"name\":\"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VIPROM.2002.1026663\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on VIPromCom Video/Image Processing and Multimedia Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VIPROM.2002.1026663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种在8/spl次/8块DCT域对8位灰度图像进行盲水印的新方法。该方法基于先进的扩频算法(见Cox, I.J.等人,NEC研究所技术报告p.95-100, 1995年)。但是,在检测阶段不进行相关性分析,而是提取子通道对直方图属性之间的差异。直方图转换是不可逆的,这提供了额外的安全性。每个通道由8/spl次/8块的不同DCT系数构建,直方图描述了它们的分布。有63个交流系数和1个直流系数。信道被分割成若干个子信道对,每个子信道对包含一个位标记,因此可能的水印数量等于子信道对的2的幂。我们不使用所有的通道——只使用健壮的通道。子通道由一个键生成。嵌入不会对图像造成很大的改变,因为我们使用了一个特殊的嵌入函数。水印目前可以抵抗JPEG压缩,最高可达QF(质量因子)5。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Blind watermarking method using partitioned DCT channels
A novel blind watermarking method for 8 bit grayscale images in 8/spl times/8 block DCT (discrete cosine transform) domain is presented. The method is based on an advanced spread-spectrum algorithm (see Cox, I.J. et al., NEC Research Institute Technical Report p.95-100, 1995). However, instead of correlation analysis in the detection phase, it extracts the difference between the histogram properties of pairs of subchannels. Histogram transformation is not reversible, which provides added security. Each channel is built from different DCT coefficients for the 8/spl times/8 block and the histogram describes their distribution. There are 63 AC and one DC coefficients. Channels are partitioned into some pairs of subchannels, which contain a single bit mark, thus the number of possible watermarks equals the power of 2 of the sub-channel pairs. We do not use all the channels - only the robust ones. Subchannels are generated by a key. Embedding does not change the image very much as we use a special embedding function. Watermarks currently resist JPEG compression up to QF (quality factor) 5.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信