QIM watermarking games

QIM watermarking games
复制标题

QIM 水印游戏

DOI:
10.1109/icip.2004.1419398
复制
发表时间:
2004
期刊:
2004 International Conference on Image Processing, 2004. ICIP '04.
影响因子:
--
通讯作者:
P. Moulin
P. Moulin
中科院分区:
--
文献类型:
--
作者:
A. Goteti;P. Moulin

文献摘要

参考文献

被引文献

相似文献

量化索引调制(QIM)方法被广泛用于盲数据嵌入和水印。给定一个QIM水印代码,我们问什么是攻击者的噪声分布,最大限度地提高检测器的错误概率。对于无记忆攻击,问题被简化为凸规划问题。接下来,我们推导出最小最大最优的QIM码参数。
Quantization Index Modulation (QIM) methods are widely used for blind data embedding and watermarking. Given a QIM watermarking code, we ask what is the attacker's noise distribution that maximizes probability of error of the detector. For memoryless attacks, the problem is reduced to a convex programming problem. Next, we derive QIM code parameters that are minmax optimal.
DOI: 10.1109/isit.2000.866336
发表时间: 2000-06
期刊: 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)
影响因子: --
作者:
Brian Chen;G. Wornell
通讯作者: Brian Chen;G. Wornell