面向块截断编码图像的安全可逆可见水印算法

互联网的广泛普及与信息处理技术的迅速发展为网络环境数字图像资源的安全通信带来了挑战。为保障网络实时环境数字图像安全流通，提出了一种基于块截断编码的数字图像可逆可见水印方案。该方案通过调整块截断编码块两个量化级以嵌入可见水印，并将加密水印信息隐藏于编码域二元位平面中，水印嵌入过程中逻辑取反运算的使用确保了原图像可恢复性。实验结果表明了该可逆可见水印方案的有效性与安全性，可应用于网络环境数字图像安全分发，为普通用户提供含可见水印的图像资源，而仅授权用户可去除可见水印浏览高质量原图像。     

一种适合二值图像的安全信息隐藏算法

提出了一种二值图像信息隐藏的水印嵌入算法，他适合包括传真、印章、文本、图表等在内的所有二值图像，具有一定的自适应性，针对具有不同内容的二值图像，根据所计算出来的距离矩阵和象素的可改变程度来选择最佳的水印嵌入位置。此方法可以通过质量因子来调整水印嵌入数量，同时利用一个安全密钥在水印嵌入的时候加密信息的隐藏。实验和分析结果表明，算法具有较高的安全性和人眼不可察觉性。     

基于压缩感知的鲁棒可分离的密文域水印算法

为了满足密文域水印嵌入的需要,该文基于压缩感知技术,提出一种鲁棒可分离的密文域水印算法。首先,内容拥有者将图像进行不重叠分块,利用边缘检测手段划分重要块和非重要块。重要块用传统加密方式进行加密,非重要块用压缩感知技术进行加密,同时为水印嵌入留出一定空间,然后根据嵌入密钥,实现二值水印的密文嵌入。在接收端获取图像内容和水印的方式是可分离的,同时根据含水印的密文图像块的像素分布特性可重新判断块的属性,避免了传输块属性信息。此外,水印信息重复4次嵌入在密文图像的不同区域,保证了水印的鲁棒性。实验结果显示所提方案在抵抗适度攻击时具有鲁棒性和安全性。     

基于预测误差分类置乱的图像加密域可逆信息隐藏

为提高XU算法的隐藏容量和加密图像的安全性, 提出了一种基于预测误差分类置乱的加密域可逆 信息隐藏算法。首先根据XU的预测方法得到非采到样像素的预测误差,根据预测误差的取值范 围将所有非 采样像素分为可变像素和不变像素两类。对采样像素、可变像素和不变像素分类置乱后再异 或加密生成加 密图像,以提高加密图像的安全性。可变像素的低2位用于保存图像信息,剩余的6个高有效 位均可用于 隐藏信息,实现了一个可变像素嵌入多比特附加信息,提高了嵌入容量。实验结果表明,本 算法的加密方 法能有效抵抗COA唯密文攻击,且平滑图像的隐藏容量可以超过2比特每像素。     

基于块容量标签的密文图像可逆数据隐藏方法

密文图像的可逆数据隐藏技术既能保证载体内容不被泄露,又能传递附加信息。本文提出了一种基于块容量标签(block capacity label, BCL)的高容量密文图像可逆数据隐藏算法。该方案在图像加密之前进行预处理,首先将图像分为两个区域：参考像素区域和预测像素区域。然后将预测像素区域分为不重叠的块,根据所提出的算法确定分块的BCL,在对图像进行加密之后嵌入BCL,生成加密图像;在秘密数据嵌入阶段,根据BCL和数据隐藏密钥嵌入秘密数据。实验测试了BOWS-2数据集,平均嵌入容量为3.806 8 bpp,与现有方法相比,该方法可以获得更高的秘密数据嵌入容量,并可以实现原始图像的完美重建。     

基于SURF和半色调映射加密的彩色零水印算法

针对现有数字水印算法对于几何攻击稳健性差、嵌入彩色版权图像信息量过多导致效率低下等问题,提出一种基于SURF(speed up robust features)几何校正和半色调映射加密的彩色零水印算法.基于SURF提取载体图像的特征点,并将其特征点信息保存为密钥用于实现盲检测.在版权验证过程中,提取受攻击图像的特征点并进行密钥匹配,使用筛选后的特征点估计出仿射矩阵,对受攻击的图像进行几何校正.同时,根据半色调原理对版权标识进行预处理,使用像素扩展的三通道二值矩阵表示彩色图像,并根据加密规则对水印图像进行半色调子块映射加密,在减少嵌入信息量的同时保留了彩色版权图像的颜色和结构信息,增加了水印信息的安全性.实验结果表明,提出的零水印算法在面对几何攻击和非几何攻击时都具有很强的稳健性,生成的零水印信息更安全.     

基于最低有效位的量子图像水印

利用最低有效位的思想,提出了一个量子图像水印方案。在该方案中,嵌入者通过置换载体图像灰度值的某一个比特把水印图像嵌入到量子载体图像的某些像素中,这些像素由一个私钥决定。只有拥有这个私钥的版权者才可以在不知道初始载体图像的前提下提取出水印信息。分别设计了嵌入和提取算法的量子电路图,并给出了该水印算法的计算机仿真。通过比较嵌入载体图像和初始载体图像之间的峰值信噪比,说明提出的水印方案实现了不可见性。实验结果也表明,提出的水印方案具有良好的可伸缩性。     

加密域灰度半色调图像的可逆信息隐藏

文章提出一种针对半色调图像的可逆信息隐藏算法,鉴于半色调图像信息冗余少的缺点,在嵌入水印前将载体图像的像素复制到两个相同的图像中,人为增加冗余。通过使用校验子编码来改变图像中的像素,将水印嵌入到第一个载体图像中;通过位替换,将水印嵌入到第二个载体图像中,得到两个隐秘图像。在提取阶段,先通过汉明码的校验矩阵处理第一个隐秘图像获得水印信息,并与第二个隐秘图像中的像素进行位替换,便可恢复载体图像。本方案适用于可逆性至关重要的数据隐藏应用场景,如印刷打印领域。     

数字图像版权的水印方案

本文提出了一种新的用于图像数字版权的自适应水印方案,在该方案中,使用混沌映射将商标图像的像素在空间区域中进行随机置乱,然后将置乱的信息埋入在图像的DCT变换域中。为了使水印的分布集中在图像显著的边缘特征中,提出了基于图像像素的模糊熵测度算法,对图像特征系数的修改则是局部自适应的,使得水印埋入的强度随着图像局部变化而变化。嵌入的商标能够在随后的相关检测以及重构中得到很好的恢复以表明数字产品的版权。     

基于加密和水印的MPEG-4流媒体版权保护方法

文章分析了加密和水印的优缺点，针对MPEG-4视频流提出一种新的基于图像频域加密算法和扩频数字水印技术的版权保护方集-CPEW。该方案将加密和水印优势结合，在频域对图像进行有选择的加密，保证了视频传输安全性；利用扩频水印嵌入版权信息，保护了MPEG视频的版权。实验证明了该方案的有效性，在网络视频传输中具有广泛的应用价值。     

Robust and reversible image watermarking in homomorphic encrypted domain

This paper proposes a robust and reversible watermarking scheme for the encrypted image by using Paillier cryptosystem. In the proposed method, the original image is divided into a number of non-overlapping blocks sized by 8 × 8 and Paillier cryptosystem is applied to encrypt the pixels in each block. Firstly, a data hider can calculate the statistical values of encrypted blocks by employing modular multiplicative inverse (MMI) method and looking for a mapping table. Then a watermark sequence can be embedded into the encrypted image by shifting the histogram of the statistical values. On the receiver side, the shifted histogram can be obtained from both the encrypted image and the decrypted image. Furthermore, the embedded watermark can be extracted from the shifted histogram. The encrypted original image can be restored by employing inverse operations of histogram shifting. This is followed by a decryption operation to restore the original image. In the proposed method, the hidden bits can still be extracted correctly under some typical content-preserving operations, such as JPEG/JPEG2000 compression and additive Gaussian noise. Compared with the previous reversible watermarking methods in plaintext domain, the proposed method has satisfactory performance in image quality and robustness. Experimental results have shown the validity of the proposed method.     

基于异或运算和图像融合的盲数字水印嵌入和检测方法

数字水印隐藏是将一个版权识别标志(水印信号)嵌入到图像中的技术。本文提出的一种新的隐藏水印的方法是将水印看作是二值图像,运用小波变换,异或运算,图像融合的方法以及中值滤波来隐藏和提取数字水印。这种方法的优点是不需要原始图像就可以提取出水印图像,可以加密码,对椒盐噪声,剪切攻击具有鲁棒性。     

An efficient high-capacity reversible data hiding scheme for encrypted images

Reversible data hiding in encrypted images is an effective technique to embed information in encrypted domain, without knowing the original content of the image or the encryption key. In this paper, a high-capacity reversible data hiding scheme for encrypted images based on MSB (most significant bit) prediction is proposed. Since the prediction is not always accurate, it is necessary to identify the prediction error and store this information in the location map. The stream cipher is then used to encrypt the original image directly. During the data hiding phase, up to three MSBs of each available pixel in the encrypted image are substituted by the bits of the secret message. At the receiving end, the embedded data can be extracted without any errors and the original image can be perfectly reconstructed by utilizing MSB prediction. Experimental results show that the scheme can achieve higher embedding capacity than most related methods.     

A novel blind color image watermarking using upper Hessenberg matrix

It is a challenging work to design a blind color image watermarking scheme for protecting copyright, which is different from the existing schemes used binary image or grayscale image as watermark and is also different from other non-blind watermarking schemes. In this paper, we analyze the feature of the upper Hessenberg matrix, and propose a blind color image watermarking scheme using upper Hessenberg matrix of Hessenberg transform. Arnold transform is used to improve the security, and the MD5-based Hash pseudo-random algorithm is also used to improve the robustness. In the process of watermark embedding, the encrypted watermark information is embedded into the biggest energy element of the Hessenberg matrix by quantization technique. In the process of watermark extraction, the watermark is extracted from the attacked host image with blind manner. Simulation results show that the proposed scheme outperforms other related methods in the aspects of the invisibility, robustness, capacity and computational complexity.     

Fragile watermarking scheme for tamper localization in images using logistic map and singular value decomposition

This paper presents a fragile watermarking scheme for tamper localization using Singular Value Decomposition (SVD) and logistic map. The proposed scheme divides the image into blocks of size 2 × 2 pixels and generates an 8-bit watermark from each block. The watermark is computed by permuting the six Most Significant Bits (MSBs) of each pixel in the block using the logistic map, followed by SVD. To secure, the watermark thus generated is further encrypted using the logistic map. This encrypted watermark is embedded into 2 Least Significant Bits (LSBs) of each pixel to enable tamper detection and localization. The experimental results demonstrate that the proposed scheme can precisely locate tampered regions under copy-paste, content removal, text addition, noise addition, vector quantization, collage, content only, and constant feature attacks. Tamper localization accuracy is better or comparable to the state-of-the-art tamper localization algorithms.     

基于图像内容的半易损水印认证算法

提出了一种用于图像完整性认证的基于内容的半易损数字水印算法。借助数字签名的思想。对原始图像进行哈希变抉，并用私钥对其加密。然后将加密后的信息作为水印信息，利用原始图像的HVS特性将水印信号嵌入到原始图像的小波域中。检测器同样对本身未作修改的部分作一次哈希变换，与原始水印信号进行比较，以此来验证图像的合法性。实验验证了该算法具有良好的鲁棒性和具有识别图像被篡改区域的能力。     

Multiple spatial watermarking technique in color images

This paper presents a novel multiple digital watermarking technique for the copyright protection of digital color images. In order to improve the robustness against cropping attacks, a binary watermark image is divided into four parts. Each is encrypted by a secret key and embedded into different regions of the blue component of the color image in the spatial domain. Watermark extraction is based on the comparisons between the original intensity pixel values and the corresponding watermarked intensity pixel values in blocks of size 8 × 8. The watermark-extracted bits are determined using the probabilities of detecting bit ‘1’ or bit ‘0’. The watermark can be extracted in several parts depending on the size of the host image, but only four of these are selected by a correlation coefficient detector and used to reconstruct the extracted watermark. Experimental results show that the proposed scheme successfully makes the watermark perceptually invisible and robust for a wide range of attacks, including JPEG-loss compression, median filtering, low pass filtering, rotation, rotation-scaling, rotation-crop, image cropping, image scaling, and self-similarity attacks.