基于博弈论的无意攻击和隐写分析攻击下嵌入水印漏警概率分析(英文)

Steganalysis attack is to statistically estimate the embedded watermark in the watermarked multimedia,and the estimated watermark may be destroyed by the attacker.The existing methods of false negative probability,however,do not consider the influence of steganalysis attack.This paper proposed the game theory based false negative probability to estimate the impacts of steganalysis attack,as well as unintentional attack.Specifically,game theory was used to model the collision between the embedment and steganalysis attack,and derive the optimal building embedding/attacking strategy.Such optimal playing strategies devote to calculating the attacker destructed watermark,used for calculation of the game theory based false negative probability.The experimental results show that watermark detection reliability measured using our proposed method,in comparison,can better reflect the real scenario in which the embedded watermark undergoes unintentional attack and the attacker using steganalysis attack.This paper provides a foundation for investigating countermeasures of digital watermarking community against steganalysis attack.     

The zero-rate spread-spectrum watermarking game

This paper develops a game-theoretic methodology to design and embed M messages in signals and images in the presence of an adversary. Here, M is assumed to be subexponential in the signal's sample size (zero-rate transmission), and the embedding is done using spread-spectrum watermarking. The detector performs statistical hypothesis testing. The system is designed to minimize probability of error under the worst-case attack in a prescribed class of attacks. The variables in this game are probability distributions for the watermarker and attacker. Analytical solutions are derived under the assumption of Gaussian host vectors, watermarks and attacks, and squared-error distortion constraints for the watermarker and the attacker. The Karhunen-Loeve transform (KLT) plays a central role in this study. The optimal distributions for the watermarker and the attacker are Gaussian test channels applied to the KLT coefficients; the game is then reduced to a maxmin power-allocation problem between the channels. As a byproduct of this analysis, we can determine the optimal tradeoff between using the most efficient (in terms of detection performance) signal components for transmission and spreading the transmission across many components (to fool the attacker's attempts to eliminate the watermark). We also conclude that in this framework, additive watermarks are suboptimal; they are, however, nearly optimal in a small-distortion regime. The theory is applied to watermarking of autoregressive processes and to wavelet-based image watermarking. The optimal watermark design outperforms conventional designs based on heuristic power allocations and/or simple correlation detectors.     

Denoising and copy attacks resilient watermarking by exploitingprior knowledge at detector

Watermarking with both oblivious detection and high robustness capabilities is still a challenging problem. In this paper, we tackle the aforementioned problem. One easy way to achieve blind detection is to use denoising for filtering out the hidden watermark, which can be utilized to create either a false positive (copy attack) or false negative (denoising and remodulation attack). Our basic design methodology is to exploit prior knowledge available at the detector side and then use it to design a "nonblind" embedder. We prove that the proposed scheme can resist two famous watermark estimation-based attacks, which have successfully cracked many existing watermarking schemes. False negative and false positive analyses are conducted to verify the performance of our scheme. The experimental results show that the new method is indeed powerful.     

A New Audio Watermarking Scheme Based on Singular Value Decomposition and Quantization

In this paper, we propose a new robust and blind audio watermarking algorithm based on singular value decomposition and quantization index modulation. The watermark insertion and extraction methods are based on quantization of the norm of singular values of the blocks. Audio quality evaluation tests show high imperceptibility of the watermark in the audio signal. Simulation results demonstrate that this algorithm is robust against signal-processing and stirmark attacks. The false negative error probability under the proposed scheme is close to zero. Moreover, the proposed algorithm has higher data payload and better performance than the other related audio watermarking schemes available in the literature.     

大容量多通道数字水印算法

现有许多数字水印算法基本上都是针对灰度图像的,彩色图像数字水印算法尚未得到充分研究,且所能嵌入水印的容量也不够大。本文提出的大容量多通道数字水印算法对这一问题进行了研究。该算法以彩色图像作为原始载体,通过数字水印压缩编码,载体图像颜色空间转换,彩色分量分块离散余弦变换,结合人眼视觉系统确定水印嵌入位置等措施,将二维水印图像嵌入到原始彩色载体图像中,且能嵌入较大容量的水印图像。实验结果表明,该算法不仅提高了水印容量,且对剪切、模糊、锐化等有损攻击具有良好的健壮性。     

基于关键点信息的鲁棒参考水印算法

鲁棒参考水印(RRW)算法是基于小波多分辨分析的用于静态图像的数字水印算法,在分析了RRW算法在图像小波分解系数的平均值较小时的缺陷的基础上,根据人眼视觉原理,提出了利用水印的关键点信息来改进RRW算法的思想.与常规RRW算法不同,算法使用关键点信息,在对小波系数进行特征量化时,对关键点取较小的Q值,对非关键点取较大的Q值.在水印检测中,对关键点和非关键点赋予不同的权值,并深入分析了该方法的正向错误概率和负向错误概率的计算公式.实验结果表明,改进算法不但其性能优于原算法,而且还在一定程度上缓解了水印的不可见性和健壮性之间的矛盾.     

数字图像小波域鲁棒性双水印算法

本文提出了一种数字图像小波域双水印算法,该方法在检测时依据一个参考水印来动态调整主水印序列各部分的可信度,从而尽量减少攻击造成的影响。实验表明,该算法有效降低了检测错误的概率,显著地提高了扩频水印的抗攻击能力。     

基于量化的双树复小波变换鲁棒图像水印算法

Conventional quantization index modulation (QIM) watermarking uses the fixed quantization step size for the host signal. This scheme is not robust against geometric distortions and may lead to poor fidelity in some areas of content. Thus, we proposed a quantization-based image watermarking in the dual tree complex wavelet domain. We took advantages of the dual tree complex wavelets (perfect reconstruction,approximate shift invariance, and directional selectivity). For the case of watermark detecting, the probability of false alarm and probability of false negative were exploited and verified by simulation.Experimental results demonstrate that the proposed method is robust against JPEG compression, additive white Gaussian noise (AWGN), and some kinds of geometric attacks such as scaling, rotation, etc.     

基于预测信息的空域水印改进算法

在图像的空间域中,一些像素与它相邻的像素之间存在一定的相关性,可以通过相邻的像素值来构建对这些像素的预测信息。基于此特点提出了一种利用参考像素点的预测信息来嵌入水印的方法,设计了重复嵌入水印的方案,通过阈值来控制嵌入水印的强度,分析了阈值对嵌入容量的影响。仿真结果表明,改进后的算法具有更高的水印容量,提高了抵抗剪切和噪声攻击的鲁棒性,且不依赖宿主图像的信息就可提取水印。     

基于SVD-DCT结合混沌加密理论的数字水印算法研究

本文数字水印算法结合奇异值分解(Singular Value Decomposition)理论、离散余弦变换(Discrete Cosine Transform)理论以及混沌加密理论。论文分析了水印嵌入因子对水印的透明性和水印误检出率的影响;实验表明在最佳嵌入因子下该算法不仅具有较高的安全性,而且对如JPEG压缩、高斯噪声攻击、椒盐噪声攻击以及特别是几何失真攻击均具有较好的鲁棒性。     

基于离散余弦变换的图像半盲水印技术研究

结合Arnold变换置乱和频谱系数相关性检测方法,提出了一种基于离散余弦变换域频谱系数相关性检测的半盲水印方案。通过不同嵌入强度的仿真实验,结果表明在嵌入强度k为2.5时达到最大嵌入量,其含水印图的峰值信噪比为30.489 2 dB,相似度达到0.998 9。通过攻击测试表明提出的水印方案具有较好的稳健性。综合仿真实验和攻击测试结果,表明提出的水印方案较好的保证了水印的不可感知性、稳健性与水印容量之间的平衡。     

Optimized Spread Spectrum Watermarking for Fading-Like Collusion Attack with Improved Detection Performance

This paper proposes an optimized spread spectrum image watermarking scheme robust against fading-like collusion attack using genetic algorithms (GA) in multiband (M-band) wavelet decomposition. M-band decomposition of host data offers advantages in better scale-space tiling and good energy compactness. This makes watermarking robust against frequency selective fading-like attack gain. On the other hand, GA would determine a threshold value for the selection of host coefficients (process gain i.e. the length of spreading code) used in watermark casting along with the respective embedding strengths. We then consider colluder (random gain) identification as multiuser detection problem and use successive interference cancelation (SIC) to accurately detect weak (low gain) colluder and innocent users too. A weighted correlator is developed first where weight factors are calculated through training/learning using a neural network. A closed mathematical form of joint probability of error is developed with the objective of minimizing the probability of false detection i.e. a colluder is identified as an innocent user and an innocent user is identified as a colluder, for a set of colluders involved. Simulation results show the relative performance gain of the weighted correlator and SIC scheme compared to the existing works.     

基于视觉特性和纹理特征的图像水印算法研究

利用人眼对比敏感度视觉特性和图像的纹理特征,提出了一种彩色图像的水印算法。算法首先依据图像的纹理特征,将图像进行分割;再将水印嵌入到图像纹理复杂的部分,并利用人眼对比敏感阈值控制水印的嵌入量,从而实现水印的嵌入;最后利用逆过程实现水印的提取。同时对3幅不同复杂纹理的图像进行仿真实验,并对3幅含水印图进行5种方式的攻击测试,且与近些年国内外报道的8种水印算法进行对比分析。结果表明,在中间剪切1/4区域、质量因子为20%的压缩和旋转90°较强的攻击下,提取水印的NC值和含水印图的SSIM值均仍能达到0.8以上,且比8种水印算法具有更好的鲁棒性。综合结果表明,在水印嵌入过程中,提出的算法能够有效解决水印容量与视觉透明性、鲁棒性之间的平衡,是一种行之有效的图像水印算法。     

基于约瑟夫环和DCT系数的盲水印算法

提出了基于约瑟夫环和DCT系数的盲水印算法。该算法首先使用约瑟夫环对水印信息进行置乱,使水印不可见性及抗攻击能力增强,再利用DCT系数量化,及对量化值进行奇偶性检验,实现了水印的嵌入及提取。增加了水印容量,从而提高了算法的鲁棒性。结果表明,该算法对压缩、中值滤波、高斯噪声等攻击,具有很好的鲁棒性,并且安全性强。     

Watermarking based image authentication and tamper detection algorithm using vector quantization approach

In the present work, a novel image watermarking algorithm using vector quantization (VQ) approach is presented for digital image authentication. Watermarks are embedded in two successive stages for image integrity verification and authentication. In the first stage, a key based approach is used to embed robust zero level watermark using properties of indices of vector quantized image. In the second stage, semifragile watermark is embedded by using modified index key based (MIKB) method. Random keys are used to improve the integrity and security of the designed system. Further, to classify an attack quantitatively as acceptable or as a malicious attack, pixel neighbourhood clustering approach is introduced. Proposed approach is evaluated on 250 standard test images using performance measures such as peak signal to noise ratio (PSNR) and normalized hamming similarity (NHS). The experimental results shows that propose approach achieve average false positive rate 0.00024 and the average false negative rate 0.0012. Further, the average PSNR and tamper detection/localization accuracy of watermarked image is 42 dB and 99.8% respectively; while tamper localization sensitivity is very high. The proposed model is found to be robust to common content preserving attacks while fragile to content altering attacks.     

一种新颖的基于非压缩数字视频的水印盲检测算法

数字水印是一种嵌入到多媒体数据中用来进行版权标识的工具。在众多的宿主媒体中，数字视频因具有隐藏容量大、透明性好、鲁棒性强等诸多优点而受到日益广泛的关注。但是很多文献中提到的视频水印都是从数据流中提取单帧图像进行处理，这类算法与静态图像的水印方法如出一辙，没有充分利用视频文件的各种特性。而且对帧平均、视频压缩等常见的运动图像攻击方法十分敏感。针对这些问题，本文以非压缩视频文件为实验对象，结合人类视觉模型和彩色图像场景分割的方法，提出并实现了一种基于视频时间轴的数字水印盲检测算法。实验结果表明算法有效实用。     

Counterfeiting attacks on oblivious block-wise independentinvisible watermarking schemes

We describe a class of attacks on certain block-based oblivious watermarking schemes. We show that oblivious watermarking techniques that embed information into a host image in a block-wise independent fashion are vulnerable to a counterfeiting attack. Specifically, given a watermarked image, one can forge the watermark it contains into another image without knowing the secret key used for watermark insertion and in some cases even without explicitly knowing the watermark. We demonstrate successful implementations of this attack on a few watermarking techniques that have been proposed in the literature. We also describe a possible solution to this problem of block-wise independence that makes our attack computationally intractable.     

一种基于特征空间分解的非对称鲁棒水印方法

针对数字图像的版权保护,提出一种基于特征空间分解的非对称数字水印方法,即对数字图像的特征空间分解,将水印嵌入到最少受图像改变影响的子空间,使嵌入的水印具有鲁棒性.同时,因水印嵌入矩阵(密钥)与提取矩阵(公钥)不同,可公开除密钥外所有其它信息.通过对特征子空间选取限制,算法具有高的检测概率和安全性,低的虚警概率.仿真得到的结果,表明了算法具有好的鲁棒性.     

一种基于图像内容的数字水印算法

有望解决数字媒体版权纠纷的数字水印技术须满足3个相互冲突的基本要求:不可见性、健壮性和嵌入容量。应用信息论中多维无记忆加性高斯信道容量公式,提出一种基于图像内容的高容量算法。算法在保证水印不可见性的前提下,尽可能多地嵌入强度大的水印信息。水印的检测不需要原始图像,属于盲水印算法。仿真结果表明,运用该算法在图像中能嵌入较多的水印信息,同时具有很好的健壮性。     

Turbo code protection of video watermark channel

The operational capacity of a watermark data channel is deduced by examining the correlation distribution at the retrieval end of a spread-spectrum-based watermarking system. This enables capacity to be determined given MPEG-2 compression, geometric attack, visual thresholds and channel coding. Watermarking itself is carried out in the DCT domain using video-dependent and visual perception concepts. An objective of the paper is to determine the capacity improvement provided by advanced FEC. It is found that FEC based on multiple parallel concatenated convolutional codes (3PCCCs) can give an order improvement in capacity for compressed video, and typically gives 0.5 kbit/s capacity under a combined compression-geometric attack