基于特征的易碎图像水印框架

提出了一种基于特征的易碎图像水印框架,来阻止VQ攻击.图像特征被提取出来,用 来处理原始水印或生成水印,使得要嵌入的水印信息不仅不被攻击者知道,而且依赖于原始图 像.因此,不同的原始图像嵌入了不同的水印信息,从而使得攻击者无法建立VQ码表,因而无法 实现VQ攻击.同时,为了提高水印的安全性和篡改的局部检测性,本文给出了该框架下水印嵌 入方法的基本要求.根据该易碎图像水印框架,本文设计了一种基于图像矩不变量的易碎水印算 法.分析和实验结果表明,该算法不仅可以很好地、局部地检测图像中的篡改.即使图像中仅有一 位被篡改时.同时,在不需任何额外的密码或图像索引号的情况下,成功地抵抗VQ攻击.     

A robust associative watermarking technique based on vector quantization

In this paper, the concepts of vector quantization (VQ) and association rules in data mining are employed to propose a robust watermarking technique. Unlike ordinary or traditional watermarking techniques, our approach hides association rules of the watermark, instead of the whole watermark; in other words, the embedded information is the association rules of the watermark. First, VQ encoding is performed on the original image and watermark to generate the index tables, and from which association rules are further mined. Subsequently, by embedding the association rules of the watermark into the association rules of the original image, the purpose for watermarking is accomplished. Finally, VQ decoding technique is applied to reconstruct the watermarked image from the watermarked index table. Experimental results show that our proposed method achieves effective resistance against several image processings such as blurring, sharpening, adding in Gaussian noise, cropping, and JPEG lossy compression. Moreover, the embedding capacity is also significantly increased, so any a complex watermark image is still acceptable in this method.     

一个基于矢量量化的数字水印算法

文章提出了一个新的基于矢量量化的数字水印算法,与基于DCT(DiscreteCosineTransform)、DFT(DiscreteFourierTransform)及DWT(DiscreteWaveletTransform)等的传统水印算法不同,该算法利用码书分割方法和矢量量化索引的特点,在矢量量化的不同阶段分别嵌入水印来保护原始图像的版权,水印检测不需要原始图像。实验结果表明,该方法实现的水印具有良好的不可见性,并对JPEG压缩、矢量量化压缩、旋转以及剪切等空域操作也具有较好的稳健性。     

一种基于小波变换的图像压缩方法

提出一种基于小波变换的灰度图像数据压缩编码方法,基本思路是利用小波变换实现图像的多分辨分解,用矢量量化（ＶＱ）对分解后的图像进行编码,在矢量量化ＬＢＧ算法的初始码书的选取中根据矢量中各分量的特性提出一种改进的随机选取法,避免了可能的胞腔不均现象,提高了码书的质量,而且重构的图像质量也有所提高。     

A semi-blind digital watermarking scheme based on singular value decomposition

This paper presents a robust watermarking approach for hiding grayscale watermarks into digital images. Plugging the codebook concept into the singular value decomposition (SVD), the proposed method embeds the singular values (SVs) of the original image into the watermark one to attain the lossless objective. The experimental results show that the proposed scheme guarantees the extracted watermark on an average and the worst PSNR values of 24.91 and 19.96 dB, respectively. In addition to the guarantee of the quality of extracted watermark image, the security of the referenced watermark is further strengthened by applying chaos permutation on it in advance. The proposed scheme leads to satisfactory robustness to various attacks and is compared to other well-known grayscale watermarking methods to reveal its efficiency for practical applications.     

一种基于混沌Hash函数的脆弱水印算法

针对现有分块脆弱水印的缺陷,提出了一种基于混沌Hash函数的脆弱水印算法。该方案通过将原始图像分块后做混沌Hash,生成原始图像的摘要,与由混沌映射生成的混沌二值图像异或后生成二值脆弱水印,置乱加密后嵌入原始图像的LSB平面;认证时通过差值图像定位篡改的区域。理论分析和实验仿真表明提出的水印算法不可见性好,能够有效抵抗VQ攻击,并能够区分篡改的类型,安全性高。     

A new watermarking scheme for colour image using QR decomposition and ternary coding

At present, the binary images are often used as the original watermark images of many watermarking methods, but partial methods cannot be easily extended to colour image watermarking methods. For resolving this problem, we propose a new watermarking method using ternary coding and QR decomposition for colour image. In the procedure of embedding watermark, the colour image watermark is coded to ternary information; the colour host image is also separated into image blocks of sized 3?×?3, and these image blocks are further decomposed via QR decomposition; then, one ternary watermark is embedded into one orthogonal matrix Q of QR decomposition by the proposed rules. In the procedure of extracting watermark, the proposed method uses the blind-manner to extract the embedded ternary information. The novelty of this scheme lies in the proposed ternary coding for watermark image, which can improve the imperceptibility, embedded watermark capacity and real-time feature of the watermarking scheme. The results of simulation show the presented technique is better than other compared schemes with respect to imperceptibility, embedded watermark capacity and real-time feature under the similar robustness.

     

A MS-GS VQ codebook design for wireless image communication usinggenetic algorithms

An image compression technique is proposed that attempts to achieve both robustness to transmission bit errors common to wireless image communication, as well as sufficient visual quality of the reconstructed images. Error robustness is achieved by using biorthogonal wavelet subband image coding with multistage gain-shape vector quantization (MS-GS VQ) which uses three stages of signal decomposition in an attempt to reduce the effect of transmission bit errors by distributing image information among many blocks. Good visual quality of the reconstructed images is obtained by applying genetic algorithms (GAs) to codebook generation to produce reconstruction capabilities that are superior to the conventional techniques. The proposed decomposition scheme also supports the use of GAs because decomposition reduces the problem size. Some simulations for evaluating the performance of the proposed coding scheme on both transmission bit errors and distortions of the reconstructed images are performed. Simulation results show that the proposed MS-GS VQ with good codebooks designed by GAs provides not only better robustness to transmission bit errors but also higher peak signal-to-noise ratio even under high bit error rate conditions     

Fragile image watermarking scheme based on VQ index sharing and self-embedding

In this paper, we propose a self-embedding fragile watermarking scheme using vector quantization (VQ) and index sharing. First, the principle contents of original image are compactly represented by a series of VQ indices. Then, after permutation, the binary bits of VQ indices are extended to generate reference-bits by a random binary matrix, which can make all reference-bits share the information of VQ index bits from different regions of the whole image. The image is embedded with watermark-bits including hash-bits for tampering localization and reference-bits for content recovery, and is transmitted to receiver side. Tampered regions in the received, suspicious image can be accurately located and then be recovered by VQ index reconstruction. Experimental results demonstrate that the proposed scheme can achieve successful content recovery for larger tampering rate and obtain better visual quality of recovered results than the reported schemes.

     

基于主分量分析的矢量量化数字水印算法

针对矢量量化过程中码书训练复杂的缺点,基于主分量分析方法对图像进行降维,根据降维后各主分量熵和标准差的差异性对其进行分类,采用非均匀矢量量化方法生成码书。在水印嵌入过程中,将水印图像嵌入降维后主分量能量适中的码书中以提高水印图像质量,利用EENNS算法代替完全搜索算法缩短编码时间。实验结果表明,该算法在提高码书质量的同时,能有效减少码书训练时间,对JPEG压缩、剪切、旋转等图像攻击也具有较强的鲁棒性。     

基于矢量量化的数字图像水印技术研究

基于矢量量化的数字水印是数字水印技术一个新的研究领域。主要研究基于矢量量化的数字图像水印技术的原理和性能。在简要介绍水印技术和矢量量化技术后阐述了基于矢量量化的数字水印算法的基本原理。通过分析几种典型的矢量量化水印算法,总结出基于矢量量化水印算法的特点是其在嵌入容量和算法易行性方面有绝对优势,并且对于VQ压缩攻击有很好的鲁棒性,但水印图像的质量对于版权保护来说还有待提高。指出进一步研究的方向是结合DCT、DWT、HVS来改善。     

HEURISTIC PARTICLE SWARM OPTIMIZATION LEARNING-BASED IMAGE COMPRESSION SYSTEM

Traditional LBG algorithm is a pure iterative optimization procedure to achieve the vector quantization (VQ) codebook, where an initial codebook is continually refined at every iteration to reduce the distortion between code-vectors and a given training data set. However, such interactive type learning algorithms will easily direct final results converging toward the local optimization while the high quality of the initial codebook is not available. In this article, an efficient heuristic-based learning method, called novel particle swarm optimization (NPSO), is proposed to design the proper codebook of VQ scheme that can develop the image compression system. To improve the performance of the basic PSO, the centroid updating machine applies the one step-size gradient descent learning step in the heuristic learning procedure. Additionally, the presented NPSO with advantages of the centroid updating machine is proposed to quickly achieve the near-optimal reconstructive image. For demonstrating the proposed NPSO learning scheme, the image with several horizontal grey bars is first applied to present the efficiency of the NPSO learning mechanism. LBG and NPSO learning methods are also applied to test the reconstructing performance in several type images “Lena,” “Airplane,” “Cameraman”, and “peppers.” In our experiments, the NPSO learning algorithm provides the higher performance than conventional LBG methods in the application of building image compression system.     

实离散分数Krawtchouk变换及其在数字图像水印中的应用

目的 传统Krawtchouk变换处理图像时存在变换域信息表示单一、不可调节等问题,传统分数阶Krawtchouk变换处理实信号表示有冗余等问题。为了构造更加灵活的图像变换域表示,提出了实离散分数阶Krawtchouk变换,并应用于数字图像水印。方法 利用对传统Krawtchouk变换矩阵特征值分解的方式,通过对分解后的特征值矩阵的实矩阵分数化构造得到了实离散分数阶Krawtchouk变换的变换矩阵,从而构造出实离散分数阶Krawtchouk变换。然后,利用所提变换从实数域变换到实数域这一特性,提出了在实离散分数阶Krawtchouk变换嵌入水印信息的图像水印算法。算法采用了图像分块处理的方式,对每个图像块的实离散分数Krawtchouk变换系数进行奇异值分解,将水印信息嵌入奇异值分解矩阵中,然后进行逆向实离散分数阶Krawtchouk变换得到嵌入水印后的图像。结果 通过比较所提实离散分数阶Krawtchouk变换域水印算法和传统Krawtchouk变换域水印算法,提取水印的平均错误率在中值滤波、均值滤波、高斯滤波、JPEG压缩和缩放攻击下,分别降低了12.39%、10.04%、18.50%、71.49%和17.60%。结论 实验结果表明,提出的实离散分数阶Krawtchouk变换域水印方案对中值滤波、均值滤波、高斯滤波、JPEG压缩和缩放等多种信号处理攻击具有较好的鲁棒性。     

Robust digital watermarking in PDTDFB domain based on least squares support vector machine

Geometric distortion is known as one of the most difficult attacks to resist, for it can desynchronize the location of the watermark and hence causes incorrect watermark detection. It is a challenging work to design a robust image watermarking scheme against geometric distortions. Based on the least squares support vector machine (LS-SVM) geometric distortions correction, we propose a new image watermarking scheme in shiftable complex directional pyramid (PDTDFB) domain with good visual quality and reasonable resistance toward geometric distortions in this paper. Firstly, the PDTDFB decomposition is performed on the original host image. Then, the corresponding lowpass subband is divided into small blocks. Finally, the digital watermark is embedded into host image by modulating the selected lowpass PDTDFB coefficients in small blocks. The main steps of digital watermark detecting procedure include: (1) the PDTDFB decomposition is performed on the test images, and some low-order Gaussian–Hermite moment energy of highpass subbands are computed, which are regarded as the effective feature vectors; (2) the appropriate kernel function is selected for training, and a LS-SVM training model can be obtained; (3) the watermarked image is corrected with the well trained LS-SVM model; and (4) the digital watermark is extracted from the corrected watermarked image. Experimental results show that the proposed image watermarking is not only invisible and robust against common image processing operations such as filtering, noise adding, and JPEG compression etc, but also robust against the geometrical distortions.     

Comments on “A digital watermarking scheme based on singular value decomposition and tiny genetic algorithm”

In the recent paper entitled “A digital watermarking scheme based on singular value decomposition and tiny genetic algorithm” by C.-C. Lai (2011) [1], a robust digital image watermarking scheme based on singular value decomposition and a tiny genetic algorithm is proposed. This comment shows that this watermarking scheme is fundamentally flawed in that the extracted watermark is not the embedded watermark but determined by the reference watermark.     

基于回归型支持向量机的数字图像水印新算法

以回归型支持向量机（Support Vector Regression,SVR）理论为基础,提出一种数字图像水印新算法.该算法能够结合图像局部相关性,选取稳定的特征向量并获得SVR训练模型,进而利用SVR训练模型嵌入和提取数字水印信息.该算法以保证不可感知性和鲁棒性的良好平衡为前提,实现了数字水印的盲检测.仿真实验表明,本文算法不仅具有较好的不可感知性,而且对叠加噪声、JPEG压缩、锐化、平滑滤波、对比度增强等常规处理及扭曲、剪切等几何攻击均具有较好的鲁棒性,其整体性能明显优于现有SVM图像水印方案.     

Evolutionary fuzzy particle swarm optimization vector quantization learning scheme in image compression

This article develops an evolutional fuzzy particle swarm optimization (FPSO) learning algorithm to self extract the near optimum codebook of vector quantization (VQ) for carrying on image compression. The fuzzy particle swarm optimization vector quantization (FPSOVQ) learning schemes, combined advantages of the adaptive fuzzy inference method (FIM), the simple VQ concept and the efficient particle swarm optimization (PSO), are considered at the same time to automatically create near optimum codebook to achieve the application of image compression. The FIM is known as a soft decision to measure the relational grade for a given sequence. In our research, the FIM is applied to determine the similar grade between the codebook and the original image patterns. In spite of popular usage of Linde–Buzo–Grey (LBG) algorithm, the powerful evolutional PSO learning algorithm is taken to optimize the fuzzy inference system, which is used to extract appropriate codebooks for compressing several input testing grey-level images. The proposed FPSOVQ learning scheme compared with LBG based VQ learning method is presented to demonstrate its great result in several real image compression examples.     

基于第二代Bandelet变换的抗几何攻击图像水印

抗几何攻击的鲁棒图像水印设计是目前水印技术研究的难点和热点之一. 文中分析了图像的Bandelet变换特性, 提出了一种以图像特征点矢量集为特征向量的回归支持向量机(Support vector regression, SVR)和第二代 Bandelet变换的抗几何攻击图像水印算法,采取的主要方法包括: 1)在Bandelet变换提取的刻画图像局部特征的几何流系数上, 采用奇偶量化嵌入水印; 2)利用Harris-Laplace算子从归一化的含水印图像中提取具有几何形变鲁棒性的图像特征点,构造特征点矢量集 作为特征向量,应用回归支持向量机对几何变换参数进行训练学习; 3)水印检测时, 先利用SVR训练模型得到待检测图像所受几何攻击的参数并作几何校正,然后通过奇偶检测器盲提取水印.仿真实验表明,所提出的水印算 法不仅具有良好的透明性,而且对常规图像处理、一般性几何攻击和组合攻击均具有良好的鲁棒性.     

基于离散小波—奇异值分解的多水印嵌入算法

为提高传统数字图像水印算法的安全性, 解决数字水印对信号处理和几何失真比较敏感的问题, 提出一种新的以离散小波多级分解与奇异值分解相结合的数字图像水印算法. 不同于常见的基于小波变换的数字水印技术, 该方案在原始图像离散小波变换的低频近似区域和高频对角区域中嵌入水印, 在图像的保真度和鲁棒性之间取得较好的折衷. 水印检测时, 将从低频近似区域和高频对角区域中提取出的水印进行比较, 选择效果较好的水印作为最终检测水印. 实验结果表明, 提出的多水印算法对于各种攻击具有较强的鲁棒性.     

A new SVM-based image watermarking using Gaussian-Hermite moments

Geometric attack is known as one of the most difficult attacks to resist, for it can desynchronize the location of the watermark and hence causes incorrect watermark detection. It is a challenging work to design a robust image watermarking scheme against geometric attacks. Based on the support vector machine (SVM) and Gaussian-Hermite moments (GHMs), we propose a robust image watermarking algorithm in nonsubsampled contourlet transform (NSCT) domain with good visual quality and reasonable resistance toward geometric attacks in this paper. Firstly, the NSCT is performed on original host image, and corresponding low-pass subband is selected for embedding watermark. Then, the selected low-pass subband is divided into small blocks. Finally, the digital watermark is embedded into host image by modulating adaptively the NSCT coefficients in small block. The main steps of digital watermark detecting procedure include: (1) some low-order Gaussian-Hermite moments of training image are computed, which are regarded as the effective feature vectors; (2) the appropriate kernel function is selected for training, and a SVM training model can be obtained; (3) the watermarked image is corrected with the well trained SVM model; (4) the digital watermark is extracted from the corrected watermarked image. Experimental results show that the proposed image watermarking is not only invisible and robust against common image processing operations such as filtering, noise adding, JPEG compression, etc., but also robust against the geometric attacks.