带失真补偿的抖动调制水印算法中的补偿因子研究

带失真补偿的抖动调制水印算法是一种可以获得大容量的量化水印算法,它以量化失真作为补偿来提高抖动调制水印算法的性能,而其中补偿因子是影响该算法性能的关键因素之一.本文从量化水印算法中最小距离解码器的工作原理出发,提出了衡量带失真补偿的抖动调制水印算法鲁棒性的一般模型;在此基础上,应用率失真理论采用高斯信道来模拟有损压缩信道,得到了在有损压缩下使得误码率最低时,选择补偿因子的方法.理论结果表明有损压缩的强度越大时,应该选择的补偿因子越小.实验结果证明了理论结果的正确性.     

扩频水印鲁棒性分析

数字水印的鲁棒性是水印技术实用化的一个重要指标。与通过StirMark测试和各种仿真测试不同,本文定义互信息作为代价函数,建立扩频水印系统鲁棒性描述和度量的一般模型,并对加性扩频水印的鲁棒性进行详细分析,推导出评估鲁棒性的互信息度量计算模型,仿真分析了盲检测和非盲检测条件下互信息函数对鲁棒性的评估结果。实验以统计误比特率的方法计算图像DCT域中低频系数为载体的扩频水印误码率,当水印噪声比变化时,互信息函数和误码率之间的匹配关系验证了互信息度量模型的有效性。互信息函数可以作为代价函数评估水印的鲁棒性,并预测误码率的变化趋势。      

基于视觉模型的迭代AQIM水印算法

 自适应量化索引调制算法（AQIM）通过Watson视觉模型来计算量化步长,使得量化步长可以随着待量化系数自适应变化,从而获取了比传统量化索引调制算法（QIM）更好的不可见性和鲁棒性.但即使在没有干扰的情况下,该算法在检测时计算的量化步长与嵌入时计算的量化步长也不一致,这就导致水印不能够完整可靠地提取.本文在分析该算法存在问题的基础上,提出了一种改进的迭代AQIM水印方案,仿真实验表明该方案比原算法具有更好的性能.     

基于动态失真补偿量化索引调制的可逆数据隐藏算法

不同于传统的失真补偿量化索引调制,该文提出了动态失真补偿量化索引调制的概念。两者的区别在于量化步长和失真补偿参数是否可变。首先推导出动态失真补偿量化索引调制可逆性的成立条件,然后推导出失真补偿参数的可允许范围,最后利用可逆性设计一个具体的可逆数据隐藏算法。在只执行一遍时,它的数据隐藏率高达1 bit每像素,高于其他可逆数据隐藏算法。另外,算法的动态特性有利于防止参数泄露。实验结果表明:不管初始条件如何,该算法既能正确解码出秘密信息,又能准确恢复原始载体。     

基于失真估计和神经网络的水印算法

数字水印是一种有效的著作权保护的方法。提出了一种新的水印信息失真估计和神经网络融合的盲水印算法。在使用一种特殊的数据规范化构建方案来评估提取水印证据的失真度之后,运用神经网络提取水印算法,还可以进行剪切定位。该水印方案也不需要原始图像,并不需要增加额外的水印容量。最后实验证明,该水印算法在保持不可觉察性外水印的鲁棒性方面更强。     

自适应的混合域音频水印新算法

本文结合小波包变换和离散余弦变换，提出了一种基于听觉模型的混合域自适应音频盲水印算法，在不引入听觉失真的前提下，实现了自适应的水印嵌入。算法首先对音频信号进行小波包分解，使得分解后的子带更接近人耳临界频带。其次对每个子带的小波包系数进行离散余弦变换，计算出子带掩蔽阈值。根据子带掩蔽阈值自适应的选取噪声敏感度小的音频段作为水印嵌入段，选取功率值低于掩蔽阈值的频域系数作为水印嵌入位置，同时采用噪声掩蔽比调整水印嵌入强度。二值水印图像通过量化索引调制的方法嵌入到音频信号的中低频系数中，提取水印时不需要原始音频载体。本算法在水印容量、不可感知性和鲁棒性之间达到了很好的平衡，水印容量在576.7bps到689.5bps之间，算法对添加噪声、重新量化、重新采样、低通滤波和MP3压缩均具有很好的鲁棒性。      

自适应抖动调制图像水印算法

量化步长是影响量化水印算法性能的最关键因素之一。该文根据JPEG量化表自适应地选择抖动调制中的量化步长,提出了一种新的自适应量化水印算法;并将JPEG量化表和Watson感知模型相结合提出了另一种新的自适应量化水印算法。实验结果表明该文提出的两种算法对噪声干扰和常见的图像处理具有较好的鲁棒性。此外,研究还表明JPEG量化表和Watson模型均可以用于缓解量化水印算法对噪声的敏感程度,而结合了两者的水印算法可以获得最佳性能。     

基于HVS的小波域图像易损水印

基于小波变换,结合量化调制过程,论文提出了一种易损水印算法。该算法具有构造分层水印,便于实现水印的多分辨率嵌入;结合视觉特性量化调制,尽可能减小视觉失真;结合图像融合技术的多分辨率检测,使检测结果更准确;以技抵抗一定程度的JPEG有损压缩等特点。实验表明,嵌入的水印在易损性和鲁棒性上达到了较好的统一,能够抵抗一定程度的压缩而不影响篡改检测的精确性。     

基于QIM的数字图像水印算法研究

随着计算机网络的广泛应用,确保数字产品的版权及安全性已成为日益突出的问题。其中数字水印作为一种有效的手段得到了广泛的注意。其中,量化索引调制算法（QIM）是一种经典的水印算法,它根据水印信息,把原始载体数据用量化器量化到不同的索引区间,能在获取较高的鲁棒性同时,具有较小嵌入失真。本文用Matlab软件模拟实现了QIM水印的嵌入的和提取,实验结果表明QIM算法能有效抵抗滤波、噪声、剪切等常见攻击。     

一种基于HVS的图像易碎水印

作为多媒体认证和篡改检测的一种新技术,易碎水印正得到越来越多的关注.基于小波变换,结合量化调制过程,本文提出了一个易碎水印算法.该算法具有以下特点:(1)构造水印金字塔,便于实现水印的多分辨率检测;(2)结合视觉特性量化调制,尽可能减小视觉失真;(3)结合图像融合技术的多分辨率检测,使检测结果更准确;(4)抵抗一定程度的JPEG有损压缩.为了实现篡改的检测,本文给出了一个攻击判别方案,以区分恶意攻击和偶然攻击.实验表明,嵌入的水印在脆弱性和鲁棒性上达到了较好的统一,能够抵抗一定程度的压缩而不影响篡改检测的精确性.     

Quantization index modulation: a class of provably good methods fordigital watermarking and information embedding

We consider the problem of embedding one signal (e.g., a digital watermark), within another “host” signal to form a third, “composite” signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing the information-embedding rate, minimizing the distortion between the host signal and composite signal, and maximizing the robustness of the embedding. We introduce new classes of embedding methods, termed quantization index modulation (QIM) and distortion-compensated QIM (DC-QIM), and develop convenient realizations in the form of what we refer to as dither modulation. Using deterministic models to evaluate digital watermarking methods, we show that QIM is “provably good” against arbitrary bounded and fully informed attacks, which arise in several copyright applications, and in particular it achieves provably better rate distortion-robustness tradeoffs than currently popular spread-spectrum and low-bit(s) modulation methods. Furthermore, we show that for some important classes of probabilistic models, DC-QIM is optimal (capacity-achieving) and regular QIM is near-optimal. These include both additive white Gaussian noise (AWGN) channels, which may be good models for hybrid transmission applications such as digital audio broadcasting, and mean-square-error-constrained attack channels that model private-key watermarking applications     

Variable non-uniform quantized belief propagation algorithm for LDPC decoding

Non-uniform quantization for messages in Low-Density Parity-Check（LDPC）decoding can reduce implementation complexity and mitigate performance loss.But the distribution of messages varies in the iterative decoding.This letter proposes a variable non-uniform quantized Belief Propagation（BP）algorithm.The BP decoding is analyzed by density evolution with Gaussian approximation.Since the probability density of messages can be well approximated by Gaussian distribution,by the unbiased estimation of variance,the distribution of messages can be tracked during the iteration.Thus the non-uniform quantization scheme can be optimized to minimize the distortion.Simulation results show that the variable non-uniform quantization scheme can achieve better error rate performance and faster decoding convergence than the conventional non-uniform quantization and uniform quantization schemes.     

一种基于离散余弦变换与奇异值分解的数字图像水印算法

结合奇异值分解（SVD）和离散余弦变换（OCT）的特点,提出了一种基于离散余弦交换与奇异值分解的数字图像水印算法.该算法能够很好地解决透明性和鲁棒性之间的矛盾.算法中采用经过置乱变换的灰度图作为水印,不仅增加了嵌入的信息量,而且提高了水印的安全性.实验结果表明,该算法不仅具有较好的透明性,而且对常见攻击如：叠加噪声、JPEG压缩、滤波以及几何攻击等具有较好的鲁棒性.     

A coded ARQ scheme with the generalized Viterbi algorithm

A coded automatic repeat request (ARQ) scheme based on a generalized Viterbi decoding algorithm is proposed. The scheme utilizes the error propagation, which is commonly observed in reduced-complexity decoding, as a means of error detection. It is shown that a small undetectable error probability is obtained with a small retransmission probability for a discrete memoryless channel, contrary to the conventional convolutionally coded ARQ schemes with Viterbi decoding where a compromise between the retransmission probability and the undetectable error probability must be reached     

一种基于奇偶校验码级联极化码的低复杂度译码算法

极化码作为一种纠错码,具有较好的编译码性能,已成为5G短码控制信道的标准编码方案.但在码长较短时,其性能不够优异.作为一种新型级联极化码,奇偶校验码与极化码的级联方案提高了有限码长的性能,但是其译码算法有着较高的复杂度.该文针对这一问题,提出一种基于奇偶校验码级联极化码的串行抵消局部列表译码(PC-PSCL)算法,该算...     

Turbo‐coded APSK modulations design for satellite broadband communications

This paper investigates the design of power and spectrally efficient coded modulations based on amplitude phase shift keying (APSK) modulation with application to satellite broadband communications. APSK represents an attractive modulation format for digital transmission over nonlinear satellite channels due to its power and spectral efficiency combined with its inherent robustness against nonlinear distortion. For these reasons APSK has been very recently introduced in the new standard for satellite Digital Video Broadcasting named DVB‐S2. Assuming an ideal rectangular transmission pulse, for which no nonlinear inter‐symbol interference is present and perfect pre‐compensation of the nonlinearity, we optimize the APSK constellation. In addition to the minimum distance criterion, we introduce a new optimization based on the mutual information; this new method generates an optimum constellation for each spectral efficiency. To achieve power efficiency jointly with low bit error rate (BER) floor we adopt a powerful binary serially concatenated turbo‐code coupled with optimal APSK modulations through bit‐interleaved coded modulation. We derive tight approximations on the maximum‐likelihood decoding error probability, and results are compared with computer simulations. The proposed coded modulation scheme is shown to provide a considerable performance advantage compared to current standards for satellite multimedia and broadcasting systems. Copyright © 2006 John Wiley & Sons, Ltd.     

Performance analysis of orthogonal space-time block codes in spatially correlated MIMO Nakagami fading channels

Orthogonal space-time block coding (STBC) is an open-loop transmit diversity scheme that decouples the multiple-input multiple-output (MIMO) channel, thereby reducing the space-time decoding into a scalar detection process. This characteristic of STBC makes it a powerful tool, achieving full diversity over MIMO fading channels, and requiring little computational cost for both the encoding and decoding processes. In this paper, we exploit the single-input single-output equivalency of STBC in order to analyze its performance over nonselective Nakagami fading channels in the presence of spatial fading correlation. More specifically, we derive exact closed-form expressions for the outage probability and ergodic capacity of STBC, when the latter is employed over spatially correlated MIMO Nakagami fading channels. Moreover, we derive the exact symbol error probability of coherent M-PSK and M-QAM, when these modulation schemes are used along with STBC over such fading channels. The derived formulae are then used to assess the robustness of STBC to spatial correlation by considering general MIMO correlation models and analyzing their effects on the outage probability, ergodic capacity, and symbol error probability achieved by STBC.     

RST Invariant Image Watermarking Algorithm With Mathematical Modeling and Analysis of the Watermarking Processes

In this paper, a new rotation and scaling invariant image watermarking scheme is proposed based on rotation invariant feature and image normalization. A mathematical model is established to approximate the image based on the mixture generalized Gaussian distribution, which can facilitate the analysis of the watermarking processes. Using maximum a posteriori probability based image segmentation, the cover image is segmented into several homogeneous areas. Each region can be represented by a generalized Gaussian distribution, which is critical for the analysis of the watermarking processes mathematically. The rotation invariant features are extracted from the segmented areas and are selected as reference points. Subregions centered at the feature points are used for watermark embedding and extraction. Image normalization is applied to the subregions to achieve scaling invariance. Meanwhile, the watermark embedding and extraction schemes are analyzed mathematically based on the established mathematical model. The watermark embedding strength is adjusted adaptively using the noise visibility function and the probability of error is analyzed mathematically. The mathematical relationship between fidelity and robustness is established. The experimental results show the effectiveness and accuracy of the proposed scheme.     

Multicarrier spread spectrum watermarking for secure error concealment in fading channel

This paper proposes a novel multicarrier spread spectrum (SS) watermarking scheme for the application of image error concealment using multicarrier-code division multiple access (MC-CDMA) with binary phase shift keying (BPSK) transmission in Rayleigh fading channel. The goal is achieved by embedding important information (image digest) which is extracted from the original image itself, and is used to introduce sufficient redundancy in the transmitted image. Half-toning technique is applied to obtain image digest from its low-resolution version. At the decoder side, data demodulation as well as watermark decoding are done using minimum mean square error combining (MMSEC) strategy. The extracted image digest is used to correct the damaged regions. The integration of SS watermarking with the existing SS modulation not only simplifies the design but also offers significant performance improvement for error concealment in fading channel. Authorized users having the knowledge of code patterns for SS watermarking can only perform the error concealment operation and the method is secured. Experimental results duly support the effectiveness of the proposed scheme.