Chaotic based secure watermarking approach for medical images

In this paper, a chaotic based secure medical image watermarking approach is proposed. The method is using non sub-sampled contourlet transform (NSCT), redundant discrete wavelet transform (RDWT) and singular value decomposition (SVD) to provide significant improvement in imperceptibility and robustness. Further, security of the approach is ensured by applying 2-D logistic map based chaotic encryption on watermarked medical image. In our approach, the cover image is initially divided into sub-images and NSCT is applied on the sub-image having maximum entropy. Subsequently, RDWT is applied to NSCT image and the singular vector of the RDWT coefficient is calculated. Similar procedure is followed for both watermark images. The singular value of both watermarks is embedded into the singular matrix of the cover. Experimental evaluation shows when the approach is subjected to attacks, using combination of NSCT, RDWT, SVD and chaotic encryption it makes the approach robust, imperceptible, secure and suitable for medical applications.

     

An adaptive color image watermarking using RDWT-SVD and artificial bee colony based quality metric strength factor optimization

Image watermarking has emerged as a useful method for solving security issues like authenticity, copyright protection and rightful ownership of digital data. Existing watermarking schemes use either a binary or grayscale image as a watermark. This paper proposes a new robust and adaptive watermarking scheme in which both the host and watermark are the color images of the same size and dimension. The security of the proposed watermarking scheme is enhanced by scrambling both color host and watermark images using Arnold chaotic map. The host image is decomposed by redundant discrete wavelet transform (RDWT) into four sub-bands of the same dimension, and then approximate sub-band undergoes singular value decomposition (SVD) to obtain the principal component (PC). The scrambled watermark is then directly inserted into a principal component of scrambled host image, using an artificial bee colony optimized adaptive multi-scaling factor, obtained by considering both the host and watermark image perceptual quality to overcome the tradeoff between imperceptibility and robustness of the watermarked image. The hybridization of RDWT-SVD provides an advantage of no shift-invariant to achieve higher embedding capacity in the host image and preserving the imperceptibility and robustness by exploiting SVD properties. To measure the imperceptibility and robustness of the proposed scheme, both qualitative and quantitative evaluation parameters like peak signal to noise ratio (PSNR), structural similarity index metric (SSIM) and normalized cross-correlation (NC) are used. Experiments are performed against several image processing attacks and the results are analyzed and compared with other related existing watermarking schemes which clearly depict the usefulness of the proposed scheme. At the same time, the proposed scheme overcomes the major security problem of false positive error (FPE) that mostly occurs in existing SVD based watermarking schemes.     

PCA-DTT 2D-DHCES based attack resilient imperceptible image watermarking

Most schemes exhibit low robustness due to LSB’s (Least Significant Bit) and MSB’s (Most Significant Bit) based information hiding in the cover image. However, most of these IW schemes have low imperceptibility as the cover image distortion reveals to the attacker due to information hiding in MSB’s. In this paper, a hybrid image watermarking scheme is proposed based on integrating Robust Principal Component Analysis (R-PCA), Discrete Tchebichef Transform (DTT), and Singular Value Decomposition (SVD). A grayscale watermark image is twisted/scrambled using a 2D Discrete Hyper-chaotic Encryption System (2D-DHCES) to boost up the robustness/heftiness and security. The original cover image is crumbled into sparse components using R-PCA and using DTT the substantial component is additionally decomposed and the watermark will be embedded in the cover image using SVD processing. In DTT, scarcer coefficients hold the utmost energy, also provide an optimum sparse depiction of the substantial image edges and features that supports proficient retrieval of the watermark image even after unadorned image distortion based channel attacks. The imperceptibility and robustness of the proposed method are corroborated against a variety of signal processing channel attacks (salt and pepper noise, multi-directional shearing, cropping, and frequency filtering, etc.). The visual and quantifiable outcomes reveal that the proposed image watermarking scheme is much effective and delivers high forbearance against several image processing and geometric attacks.

     

A multimodal biometric watermarking system for digital images in redundant discrete wavelet transform

The traditional watermarking algorithms prove the rightful ownership via embedding of independent watermarks like copyright logos, random noise sequences, text etc into the cover images. Coupling biometrics with watermarking evolved as new and secure approach as it embeds user specific biometric traits and thus, narrows down the vulnerability to impostor attacks. A multimodal biometric watermarking system has been proposed in this paper in the redundant discrete wavelet transform(RDWT). Two biometric traits of the user i.e. the iris and facial features are embedded independently into the sub-bands of the RDWT of cover image taking advantage of its translation invariant property and sufficient embedding capacity. The ownership verification accuracy of the proposed system is tested based on the individual biometric traits as well as the fused trait. The accuracy was enhanced while using the fused score for evaluation. The security of the scheme is strengthened with usage of non-linear chaotic maps, randomization via Hessenberg decomposition, Arnold scrambling and multiple secret keys. The robustness of the scheme has been tested against various attacks and the verification accuracy evaluated based on false acceptance rate, false rejection rate, area under curve and equal error rate to validate the efficacy of the proposed scheme.

     

Attack resistant watermarking technique based on fast curvelet transform and Robust Principal Component Analysis

Watermarking is a technique which embeds the copyright information/identifier to provide authenticity in robust and imperceptible manner. In this paper, a hybrid watermarking technique is proposed based on combination of Fast Curvelet Tansform (FCT), Robust Principal Component Analysis (RPCA) and Singular Value Decomposition (SVD). The gray-scale watermark logo is scrambled using Generalized Arnold Transform (GAT) to enhance the robustness and security. The original image is decomposed to low rank and sparse components using RPCA; the curvelet coefficients are obtained using FCT via Unequally-Spaced Fast Fourier Transforms (USFFT) to embed the processed watermark using SVD into the color image. In curvelet transform, fewer coefficients contain the most energy, also giving optimally sparse representation of the significant image features and edges that helps in efficient recovery of the embedded watermark even after severe image degradation. The robustness and imperceptibility of the proposed technique is verified against a variety of processing operations (noise, filtering) and geometric attacks (crop, resize, projection etc.). The quantitative and visual results reveal that the watermarking technique proposed is more efficient and provides high tolerance against different geometric and image processing attacks.     

联合非下采样Contourlet变换与奇异值分解的多水印算法

为解决最近报道的Contourlet变换域基于奇异值分解的水印算法存在的高虚警率问题, 提出一种多水印算法。对Arnold置乱后的水印图像进行奇异值分解, 将其中一个正交矩阵嵌入原始图像非下采样Contourlet域的两个高频方向子带中, 并利用奇异值来调整原始图像非下采样Contourlet域剩余子带的系数矩阵, 通过逆变换得到含水印图像。抽取水印时首先计算从待检测图像抽出的正交矩阵和真实水印正交矩阵的相似度, 与阈值进行比较, 以决定抽取过程是否进行。由于非下采样Contourlet变换的高冗余性, 最终可抽取出多个水印图像。实验表明, 算法较好地克服了高虚警率问题。一系列的攻击实验证明算法具有较好的鲁棒性。     

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.     

Imperceptible digital watermarking scheme in multiple transform domains

A novel imperceptible digital watermarking scheme in multiple transform domains is presented, where the cover image is dealt with by discrete wavelet transform (DWT), discrete cosine transform (DCT) and discrete fractional random transform (DFRNT), while the watermark image is scrambled by Arnold transform and logistic map. First the watermark is scrambled by the Arnold transform, then the row and the column of the resulting watermark are scrambled by the Logistic map, respectively. In addition, four sub-band images are generated from the host image by the two-dimensional discrete wavelet transform. The low-frequency sub-band images are divided into 8?×?8 small matrices, and a coefficient matrix is produced by performing the discrete cosine transform on each matrix. An intermediate matrix with the same size as the watermark image is constructed by the intermediate frequency coefficients. Then the discrete fractional random transformation is performed on the intermediate frequency coefficient matrix and the scrambled watermark is embedded into the discrete fractional random transformation domain. Compared with the previous schemes, the proposed digital watermarking scheme has stronger imperceptibility and robustness.     

Perceptual Digital Watermarking for Image Authentication in Electronic Commerce

Digital watermarking has been presented to protect the copyright of electronic multimedia data. The previous proposed watermarking algorithms mostly embed sequences of random numbers or binary images as the watermarks. In this paper, an image accreditation technique by embedding digital gray-level image watermarks in images is proposed. In the proposed method, the host image and the watermark are decomposed into wavelet coefficients. The contextual energies of the host-image wavelet coefficients are computed to select embedding coefficients. The watermark wavelet coefficients are sorted and then embedded in the selected host coefficients. The experiments show that the proposed method provides extra robustness against JPEG-compression, image-processing, and even composite attacks compared to the traditional embedding methods. Moreover, the proposed method has no need of the original image to extract the embedded watermarks. The proposed method facilitates electronic commerce application developers to select adequate digital watermarking techniques for their development systems.     

A robust semi-blind watermarking for color images based on multiple decompositions

In this paper, a robust semi-blind watermarking scheme for color images, based on multiple decompositions is proposed to preserve the copyrights of the owner. Using multiple decompositions, the gray watermark is embedded into a host color image. Prior to that, to enhance security the gray watermark is encrypted with Arnold transform and SVD by generating secret keys. The luminance component of the given host image is subjected to discrete wavelet transform(DWT), contourlet transform(CT), Schur decomposition and singular value decomposition(SVD) in sequence and finally the watermark is embedded. In the semi-blind extraction process, the watermark is extracted without the help of the original host image. Experimental results show that the proposed watermarking scheme has better visual imperceptibility and high robustness against image & signal processing attacks compared to other methods.     

基于Logistic混沌映射和IWT-SVD量化的盲鲁棒水印算法

为了提高数字水印的鲁棒性以及水印嵌入位置的保密性,提出了一种基于Logistic混沌映射和整数小流变换—奇异值分解(IWT-SVD)量化的盲鲁棒水印算法:对二值水印图像进行Arnold置乱,对原始载体图像进行8×8分块,利用生成的Logistic混沌序列选择嵌入水印的图像块,充分保证了水印嵌入位置的保密性;对选中的图像块进行二级IWT分解,对得到的二级低频子带系数进行SVD;将置乱后的水印信息嵌入.算法不需要原始载体图像,实现了水印的盲提取,更具实用性.仿真实验结果表明:算法对常规图像处理操作、压缩攻击和剪切攻击均具有较强的稳健性.     

一种新的基于奇异值分解的小波域盲水印*

目前,如何增强鲁棒性水印抵抗几何攻击尤其是旋转攻击的鲁棒性,仍是水印研究者研究的难点。为此,结合奇异值分解的特性和小波变换的优点,提出一种新的基于奇异值分解的小波域盲水印算法,对于常见的几何攻击具有很强的鲁棒性。首先对小波分解后的低频子带分块以提高水印的嵌入容量,再对各子块进行奇异值分解,将Arnold置乱后的水印嵌入到奇异值中,并使用量化方法增强水印的鲁棒性。实验表明,该算法对于常见的几何攻击特别是旋转攻击具有很强的鲁棒性,也能够抵抗JPEG2000压缩等信号处理。     

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

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

基于小波—奇异值分解的数字水印新算法*

为了有效地保护数字作品的版权,提出了一种以离散小波多级分解与奇异值分解相结合的数字水印新算法。该算法充分利用小波与奇异值的固有性质,对原始图像进行多级小波分解,并对部分子带作奇异值分解。将水印置乱来保证一定的安全性,再对其进行分块离散余弦变换,然后将它嵌入到中间奇异值及其周围的部分矩阵块中。实验表明,该方法不仅有较好的透明性,而且能抗大多数处理攻击,有较好的鲁棒性。     

A new robust and secure digital image watermarking scheme based on the integer wavelet transform and singular value decomposition

In this paper, a new robust and secure digital image watermarking scheme that can be used for copyright protection is proposed. The scheme uses the integer wavelet transform (IWT) and singular value decomposition (SVD). The grey image watermark pixels values are embedded directly into the singular values of the 1-level IWT decomposed sub-bands. Experimental results demonstrate the effectiveness of the proposed scheme in terms of robustness, imperceptibility and capacity due to the IWT and SVD properties. A challenge due to the false positive problem which may be faced by most of SVD-based watermarking schemes has been solved in this work by adopting a digital signature into the watermarked image. The proposed digital signature mechanism is applied to generate and embed a digital signature after embedding the watermarks; the ownership is then authenticated before extracting watermarks. Thus, the proposed scheme achieved the security issue where the false positive problem is solved, in addition to that, the scheme is considered as a blind scheme. A computer simulation is used to verify the feasibility of the proposed scheme and its robustness against various types of attacks and to compare it with some previous schemes. Furthermore, the statistical Wilcoxon signed rank test is employed to certify the effectiveness of the proposed scheme.     

DWT-SVD and DCT based robust and blind watermarking scheme for copyright protection

In this article, a new DWT-SVD and DCT with Arnold Cat Map encryption based robust and blind watermarking scheme is proposed for copyright protection. The proposed scheme solves the most frequently occurring watermarking security problems in Singular Value Decomposition (SVD) based schemes which are unauthorized reading and false-positive detection. This scheme also optimizes fidelity and robustness characteristics. The grey image watermark splits into two parts using four bits MSBs and four bits LSBs of each pixel. Discrete Cosine Transform (DCT) coefficients of these MSBs and LSBs values are embedded into the middle singular value of each block having size 4 × 4 of the host image’s one level Discrete Wavelet Transform (DWT) sub-bands. The reason for incorporating Arnold Cat Map in the proposed scheme is to encode the watermark image before embedding it in the host image. The proposed scheme is a blind scheme and does not require the choice of scaling factor. Thus, the proposed scheme is secure as well as free from the false positive detection problem. The proposed watermarking scheme is tested for various malicious and non-malicious attacks. The experimental results demonstrate that the scheme is robust, imperceptible and secure to several attacks and common signal processing operations.     

增强奇异值分解和细胞神经网络的零水印

目的 针对奇异值分解算法存在的对角线失真、虚警错误等问题,引入一个寻找最抗攻击缩放比例的参数,提出基于增强奇异值分解的零水印算法。方法 首先将离散小波变换作用于原始图像,对分离出的低频逼近子图进行不重叠分块,对分块后的低频逼近子图作离散余弦变换得到低频系数矩阵,再分别对每个块矩阵进行增强奇异值分解,将得到的最大奇异值与最大奇异值均值作比较构成特征向量;然后对水印图像进行Arnold变换和Logistic映射得到置乱加密后的水印图像;最后将特征向量和置乱加密后的水印图像分别作为细胞神经网络的起始值和控制输入值,通过设定细胞神经网络的反馈模板、控制模板以及阈值来确定具体的可逆逻辑运算。经过可逆逻辑运算处理后的细胞神经网络输出图像即为零水印的注册图像。将注册图像保存到认证中心以证明对图像作品的版权。结果 在JPEG压缩、噪声、滤波、旋转以及剪切等各种攻击下,提取的水印和原始水印的归一化相关值都在96%以上,算法平均运行时间为2.389 s,性能较高。结论 通过利用参数对奇异值矩阵进行调整的方法,不仅增强了算法的鲁棒性,而且解决了奇异值分解（SVD）出现的对角线失真和虚警错误问题。同时通过结合零水印的思想,解决了传统水印算法需在载体图像中嵌入水印而导致的水印不可见性与鲁棒性之间的矛盾。     

基于直方图重复嵌入水印的算法研究

针对空域图像水印算法抗干扰能力差的缺陷,提出一种基于直方图重复嵌入水印的空间域水印算法。利用直方图统计不同灰度级像素数量的方法,选择将二值水印图像嵌入到载体图像灰度级较低和较高的区域,使图像能够适应不同情况下的图像处理攻击,并把所选择的区域作为提取水印的密钥,提高水印的安全性。为了说明算法的有效性,分别模拟噪声、低通滤波、剪切、JPEG压缩、锐化处理等攻击情况提取水印,实验结果表明,该算法能够对付这些常见的图像处理和攻击,具有很好的鲁棒性。     

基于特征点密度的DCT域盲检测数字水印算法

针对数字水印图像遭受几何攻击问题,提出了一种融合图像不变特征和频域稳定特性的强鲁棒数字水印盲检测算法。通过构造自适应尺度不变特征变换(SIFT)算法和Harris角点补位法,利用在不同尺度空间获取的特征点的密度自适应地调整水印信息嵌入到离散余弦变换(DCT)域的强度;将图像子块的特征向量集进行Arnold置乱,生成密钥文件,与隐秘图像的特征向量做双向特征匹配,获得几何失真参数并进行图像恢复性校正,以盲检测的形式提取IDCT反变换域水印信息。从实验结果来看,该算法比使用离散小波变换(DWT)和离散傅里叶变换(DFT)的峰值信噪提高13%,水印相似度提高11%,说明该文算法在获得较好的不可见性的同时,对几何攻击和常规信号处理均具有良好的鲁棒性。     

Digital watermarking using Hall property image decomposition method

Most of the existing singular value decomposition-based digital watermarking methods are not robust to geometric rotation, which change the pixels’ locations without maintaining the corresponding changes to the pixel’s intensity values of entire image and yield high computational cost. To answer this, we propose a digital image watermarking algorithm using the Hall property. In the proposed method, a digital watermark image is factorized into lower-triangular, upper-triangular, and permutation matrices. The permutation matrix is used as the valid key matrix for authentication of the rightful ownership of the watermark image. The product of the lower and upper triangular matrices is processed with a few iterations of the Arnold transformation to obtain the scrambled data. The scrambled data are embedded into particular sub-bands of a cover image using Wavelet transform. Our experiments show that the proposed algorithm is highly reliable and computationally efficient compared with state-of-the-art methods that are based on singular value decomposition.