一种新的分数阶Fourier域的Chirp类水印方案

提出了一种新的分数阶Fourier域Chirp类数字水印方案,该方案利用分数阶Fourier变换基函数的正交性和旋转相加性,在不同的分数阶Fourier域嵌入Chirp水印,并利用分数阶Fourier域Chirp信号的聚集性进行盲检测。接着结合该水印嵌入方案,利用分数阶Fourier变换的旋转相加性和酉性,推导出分数阶Fourier域水印容量的计算公式。仿真实验表明该算法由于可以选择嵌入在不同分数阶Fourier域,使得嵌入方法灵活安全,同时算法的不可见性好,对高斯白噪声干扰、裁剪及其它常见图像处理过程具有一定的鲁棒性。     

Chirp-Fourier变换域的水印算法

提出一种新的修正离散Chirp-Fourier变换(MDCFT)域盲水印方案,其包括水印嵌入和水印检测2部分。该方案把Chirp水印信息嵌入图像经二维修正离散Chirp-Fourier变换后的系数上,对其进行反变换,得到含水印图像,利用二维MDCFT对水印信息进行盲检测。由于DCFT可通过FFT实现,与其他时/频域水印算法相比,其实现更为方便。仿真试验表明,该算法透明性好,检测速度快,植入的数字水印对高斯噪声、剪裁、旋转和JPEG有损压缩等图像处理具有较强的鲁棒性。     

结合纹理复杂度和JND模型的图像水印算法

针对目前基于灰度共生矩阵相关水印算法存在容量较小的问题,提出一种将纹理复杂度和DCT域JND模型相结合的图像水印算法。首先将原图像分成子块,利用各子块灰度共生矩阵的四个纹理特性计算其纹理复杂度,并据此对子块进行排序以确定水印嵌入的子块位置后对原图像素矩阵进行DCT变换,结合新的分区方式计算各块JND值,根据JND值以及新的嵌入规则确定子块内水印嵌入方式。算法有效考虑了图像块的纹理特性和人眼视觉敏感性,加强了嵌入水印后的图像质量,提高了水印嵌入容量。实验结果表明,所提方法在嵌入相同容量的水印时,图像平均峰值信噪比（PSNR）较现有方法高出4.27%左右,在嵌入超过原方法容量上限一倍的水印时,图像平均PSNR仍有53.449 8 dB。     

DCT域基于PSNR的扩频水印算法

数字水印技术是信息隐藏和版权维护的一种有效方法。在先前的研究基础上提出了DCT域中如何根据水印图像与原始图像间的PSNR来估计水印的多重水印嵌入强度,并由此提出一个基于PSNR的扩频水印强度的估计公式。实验结果表明,提出的嵌入强度估计公式误差小,具有一定的准确性,算法具有一定的鲁棒性。     

基于量化模型的嵌入水印图像质量分析

提出了一种通用变换域数字水印嵌入模型,对图象质量指标PSNR的计算做了深入的理论分析,并针对量化嵌入算法进行了误差分析,使水印算法能自行确定最佳的水印嵌入能量或强度,将对数字水印嵌入技术有指导意义。     

结合均值调整整数变换的迭代自适应可逆图像水印算法

现有的均值调整整数变换可逆水印算法的阈值需人工选择,位置图生成策略不完备可能导致压缩后位置图数据过大,对嵌入矢量强制划分可能导致容量足够却无法嵌入。针对以上问题,提出一种结合均值调整整数变换的迭代自适应可逆图像水印算法。首先,根据负载数据大小以及整数矢量对峰值信噪比(PSNR)的影响,采用迭代自适应算法选择调整平移量以达到水印嵌入容量和嵌入载体视觉质量的平衡;然后,结合邻近像素值相近原则给出了完备位置图生成策略以提高位置图压缩性能;最后,采用分层有序嵌入策略将负载数据依次嵌入到最低、次低和第3低有效位以避免容量足够却无法嵌入的情况。实验结果表明,与传统均值调整整数变换可逆水印算法相比,所提算法无需预先设定阈值,但依然能保持大的嵌入容量,嵌入水印后掩体视觉质量更优,位置图生成策略性能优于传统均值调整整数变换可逆水印算法生成策略且压缩后的位置图数据更小,从而间接提高了嵌入容量,在实验样例上相对于比较算法,PSNR平均提高14.4%。     

Duffing振子与分数傅里叶变换的Chirp水印检测性能对比研究

研究Duffing 振子和分数傅里叶变换在Chirp类水印检测中的性能比较。首先分析目前分数傅里叶变换检测Chirp类水印的不足, 然后将嵌入在载体低频小波域的非周期Chirp信号通过分块平滑转换为单频周期信号, 利用Duffing振子阵列检测器检测微弱的周期信号。实验表明, 当信噪比为-41 dB时, Duffing振子仍然能有效检测到水印的存在, 此时分数傅里叶变换失效; 而当信噪比较高时, 分数傅里叶变换计算较Duffing振子检测简单。     

基于混沌和DWT的水印算法

针对数字图像DWT系数的分布特点,分别对在不同频段系数中嵌入和提取水印进行了研究与实验.选用了有意义的灰度图像作为水印,采用基于混沌序列的加密方法对水印进行处理,在水印嵌入域上,选择了具有与人眼视觉特性十分相符的离散小波变换,通过将原始图像进行多级小波分解,在中间某一级或几级的小波系数中嵌入水印信息,从而加大了水印嵌入的灵活性.实验结果表明,在DWT低频域嵌入水印,对算法的透明性影响较大;在中高频域嵌入水印,对透明性的影响相对小一些,并且可加入的水印容量相对较大,但对低通类图像处理鲁棒性较弱.因此可以将各种方案相互融合、相互补充以均衡抵抗各种不同类别的攻击,并根据实际需求进行方案的选择.     

极坐标下的空域水印算法研究

由于空间域嵌入的水印对旋转和缩放攻击相当脆弱,本文提出一种新的水印算法。将原图像和水印图像进行对数极变换,将变换后的水印图像嵌入到变换后的原图像中,然后再反变换为直角坐标系下的图像。水印嵌入到图片的位置不同,检测的水印图像发生变化。本文提出三种嵌入位置的方案,显示不同的效果。检测水印时,对几何攻击过的水水印进行几何校正,然后与原图像相减得到水印。这种水印方案能够很好地抵抗几何攻击。     

基于层式余弦变换和视觉特征的数字水印隐藏方法

文章提出了一种在层式余弦变换域中嵌入数字水印的算法,该算法把水印信号的DCT变换域量值叠加到原始图像经层式余弦变换所得到的DC系数和部分AC系数中,这些系数空间容量充足,极其有利于保证水印算法的实现。最后通过实验证明了水印的鲁棒性,也定量分析了该算法在抵抗JPEG压缩等方面的强免疫力。     

基于禁制搜寻的多用途水印算法的优化

提出了一种多重水印技术做为多媒体资料保护的方法,来克服过去许多基于空间、DCT和小波等视觉模块方法的缺点,并自适应于各种图像攻击,嵌入两个功能互补的水印,以期在遇到任何攻击的情况下,至少还有一个水印能存活。以可见的水印宣告版权拥有人,并且用不可见的水印作为版权保护。这两个水印运用不同的技术嵌入在图像中。此外还提出了一个最佳化技术,以禁制搜寻算法实现水印的鲁棒性与改善图像品质。实验结果显示,所提的方法能有效改善数字水印技术中图像品质与水印鲁棒性相互制衡的问题。     

基于混沌序列的多重数字图像水印算法

采用一维混沌映射，根据不同的混沌初始条件生成多个互不相关的混沌实值序列，进而得到性能良好的多重数字图像水印信号，有效地解决了多重数字图像水印信号的构造问题．同时采用二维混沌映射将各水印信号置乱，随机均匀地叠加在图像小波变换的中低频系数上，各水印信号的嵌入和提取可以互不干扰，解决了多重数字图像水印的嵌入问题．实验结果表明，该算法对各种常见的攻击均具备了一定的抵抗能力，可有效地解决数字图像产品的多著作权问题．     

Secure variable-capacity self-recovery watermarking scheme

Since existing watermarking schemes usually cannot recover the tampered position, a secure variable-capacity self-recovery watermarking scheme is proposed. Both watermark embedding capacity and security are taken into account. The original image is divided into texture blocks and smooth blocks, and the texture blocks not only save traditional information, and save the “details” information. The so-called “details” information refers to the texture information, which not only can effectively resist mean attack, but also help to improve the quality of the recovered image to meet the needs of practical work. And then according to the characteristics of different blocks, the different length compound watermarks are produced. The so-called “compound watermarks” include the authentication watermarks and information watermarks. Authentication watermarks are used to detect the tampered region, and the information watermarks which include basic watermark and additional watermark are used to recover image. Then the compound watermarks are inserted into the other blocks based on the new proposed scheme called three level secret-key embedding scheme (TLSES). And then detect the tamper blocks and recover them by the three level tamper detection scheme (TLTDS). The experimental results show that the paper can not only accurately detect the tamper region and recover image, but also can effectively resist mean attack and collage attack.

     

局部化数字水印算法

数字水印是一种嵌入到图象,视频或音频数据中的不可见标志,可以用于多媒体数字的版权保护,认证和标注等,为了提高在频率域嵌入水印抵抗裁剪攻击的能力,提出一种局部化的图象数字水印算法,该算法利用图象中相对稳定的特征点标示水印嵌入的位置,并在与每个特征点对应的局部区域中独立地嵌入水印,这样,当只有部分图象时,仍能通过这些特下点来定位并提取水印,此算法中,水印的嵌入是在局部图象的小波域中进行的,并采用对小波系数进行特殊量化的方法来隐藏水印比特,而水印的提取不需要原始图象参与,实验结果证明,算法对裁剪有很强的抵抗能力,同时对压缩,滤波,噪声,StirMark攻击等也有较好的鲁棒性。     

基于相位偏移的非对称数字水印

在传统扩频水印技术的基础上,我们讨论了一种基于相位偏移的非对称数字水印方案。通过将一个预先选择的基准水印在其DFF域中进行随机相位偏移,产生多个实际加入的水印序列,利用各序列与基准水印的相关性．即可由基准水印实现对水印信息的非对称检测。实验结果表明,该方案具一定实用价值。     

基于DWT和DCT域的二值图像数字水印算法

提出一种基于DWT和DCT域的有意义二值图像数字水印算法；利用Arnold变换对水印序列进行置乱，消除象素的空间相关性，增加水印的安全性；而结合小波变换和离散余弦变换的特性，将水印信息嵌入到图像变换域的低频和中频系数中，提高水印的鲁棒性和不可见性；实验证明该算法具有较好的抗压缩、抗噪音和抗剪切性。     

The identical operands commutative encryption and watermarking based on homomorphism

Aiming at the requirement of comprehensive security protection for multimedia information, this paper proposes a new algorithm to realize the combination of encryption and watermarking based on the homomorphism. Under the proposed algorithm scheme, the plaintext watermark embedding operations are mapped to the ciphertext domain by homomorphism to achieve the plaintext watermark embedding in the ciphertext domain; at the same time, the embedded plaintext watermarks are also mapped to the ciphertext domain by homomorphism to achieve the ciphertext watermarking embedding. According to the experimental results, by the proposed algorithm, the order of watermark embedding and data encrypting does not affect the production of the same encrypted-watermarked data, meanwhile, whether the encrypted-watermarked data being decrypted or not does not affect the extraction of embedded watermark. For the operands of encryption and watermarking being the same data, the proposed algorithm has higher security compared with the existing mainstream independent operands based communicative encryption and watermarking.     

A blind watermark algorithm in SWT domain using bivariate generalized Gaussian distributions

Imperceptibility, robustness, and payload are three main requirements of any audio watermarking systems to guarantee desired functionalities, but there is a tradeoff among them from the information-theoretic perspective. Generally, in order to enhance the imperceptibility, robustness, and payload simultaneously, the human auditory system and the statistical properties of the audio signal should be fully taken into account. The statistical model based transform domain multiplicative watermarking scheme embodies the above ideas, and therefore the detection and extraction of the multiplicative watermarks have received a great deal of attention. Although much effort has been made in recent years, improving the ability of imperceptibility, watermark capacity, and robustness at the same time remains a challenge within the audio watermarking community. In this paper, we propose a blind audio watermark decoder in stationary wavelet transform domain based on bivariate generalized Gaussian distributions, wherein both the local statistical properties and inter-scale dependencies of the stationary wavelet transform coefficients of digital audio are taken into account, and also the adaptive nonlinear watermark embedding strength functions are designed. The results of our tests with different host audios, digital watermarks, and various attacks, we experimentally confirm that the proposed approach performs well compared to the state-of-the-art audio watermarking methods.

     

A multiple watermarking algorithm for vector geographic data based on coordinate mapping and domain subdivision

A lot of watermarking algorithms for vector geographic data are presented in the literature. Due to widely application of digital watermarking, more demands are required, such as multiple watermarking algorithm. However, vector geographic data attracted less research focus on multiple watermarking. Consequently, a multiple watermarking algorithm for vector geographic data is proposed. In particular, the vertices are mapped to the logic domains firstly based on the constructed function. Then every domain is subdivided into blocks according to dichotomy and the number of embedding watermarks. Then, every watermark is embedded in the corresponding block. During the watermark detection, the watermarks are detected without the original vector geographic data. Finally, the experiments are made to test the multiple watermark capacity and robustness against attacks, with an emphasis on cropping attacks. The experimental results show that the proposed algorithm has good robustness against common attacks, such as, data simplification, vertex addition, vertex deletion, feature deletion, and cropping attacks. Moreover, the algorithm provides high multiple watermark capacity.     

Effective watermarking scheme in the encrypted domain for buyer-seller watermarking protocol

In most watermarking schemes for copyright protection, a seller usually embeds a watermark in multimedia content to identify a buyer. When an unauthorized copy is found by the seller, the traitor’s identity can be traced by the embedded watermark. However, it incurs both repudiation issue and framing issue. To solve these problems, some buyer-seller watermarking protocols have been proposed based on watermarking scheme in the encrypted domain. In this paper, an enhanced watermarking scheme is presented. Compared with Solanki et al.’s scheme, the enhanced scheme increases effective watermarking capacity, avoids additional overhead and overcomes an inherent flaw that watermarking capacity depends on the probability distribution of input watermark sequence. Based on the security requirements of buyer-seller watermarking protocols, a new watermarking scheme in the encrypted domain with flexible watermarking capacity is proposed. It improves the robustness of watermark sequence against image compressions and enables image tampering detection. Watermark extraction is blind, which employs the same threshold criterion and secret keys as watermark embedding. Experimental results demonstrate that the enhanced watermarking scheme eliminates the drawbacks of Solanki et al.’s scheme and that the proposed watermarking scheme in the encrypted domain outperforms Kuribayashi and Tanaka’s scheme.