Secure and Robust Image Watermarking Scheme Using Homomorphic Transform, SVD and Arnold Transform in RDWT Domain

The main objective for a watermarking technique is to attain imperceptibility, robustness and security against various malicious attacks applied by illicit users. To fulfil these basic requirements for a scheme is a big issue of concern. So, in this paper, a new image watermarking method is proposed which utilizes properties of homomorphic transform, Redundant Discrete Wavelet Transform (RDWT), Arnold Transform (AT) along with Singular Value Decomposition (SVD) to attain these required properties. RDWT is performed on host image to achieve LL subband. This LL subband image is further decomposed into illumination and reflectance components by homomorphic transform. In order to strengthen security of proposed scheme, AT is used to scramble watermark. This scrambled watermark is embedded with Singular Values (SVs) of reflectance component which are obtained by applying SVD to it. Since reflectance component contains important features of image, therefore, embedding of watermark in this part provides excellent imperceptibility. Proposed scheme is comprehensively examined against different attacks like scaling, shearing etc. for its robustness. Comparative study with other prevailing algorithms clearly reveals superiority of proposed scheme in terms of robustness and imperceptibility

ROBUST INTEGER HAAR WAVELET BASED WATERMARKING USING SINGULAR VALUE DECOMPOSITION

This paper proposed a hybrid watermarking method that used dither quantization of Singular Value Decomposition (SVD) on average coefficients of Integer Haar Wavelet Transform (IHWT). The watermark image embeds through dither quantization process on singular coefficients value. This scheme aims to obtain the higher robustness level than previous method which performs dither quantization of SVD directly on image pixels value. The experiment results show that the proposed method has proper watermarked images quality above 38dB. The proposed method has better performance than the previous method in term of robustness against several image processing attacks. In JPEG compression with Quality Factor of 50 and 70, JPEG2000 compression with Compression Ratio of 5 and 3, average filtering, and Gaussian filtering, the previous method has average Normalized Correlation (NC) values of 0.8756, 0.9759, 0.9509, 0.9905, 0.8321, and 0.9297 respectively. While, the proposed method has better average NC values of 0.9730, 0.9884, 0.9844, 0.9963, 0.9020, and 0.9590 respectively

A robust audio watermarking scheme based on reduced singular value decomposition and distortion removal

This paper presents a blind audio watermarking algorithm based on the reduced singular value decomposition(RSVD). A new observation on one of the resulting unitary matrices is uncovered. The proposed scheme manipulates coefficients based on this observation in order to embed watermark bits. To preserve audio fidelity a threshold- based distortion control technique is applied and this is further supplemented by distortion suppression utilizing psychoacoustic principles. Test results on real music signals show that this watermarking scheme is in the range of imperceptibility for human hearing, is accurate and also robust against MP3 compression at various bit rates as well as other selected attacks. The data payload is comparatively high compared to existing audio watermarking schemes

Implementation of Adaptive Unsharp Masking as a pre-filtering method for watermark detection and extraction

Digital watermarking has been one of the focal points of research interests in order to provide multimedia security in the last decade. Watermark data, belonging to the user, are embedded on an original work such as text, audio, image, and video and thus, product ownership can be proved. Various robust watermarking algorithms have been developed in order to extract/detect the watermark against such attacks. Although watermarking algorithms in the transform domain differ from others by different combinations of transform techniques, it is difficult to decide on an algorithm for a specific application. Therefore, instead of developing a new watermarking algorithm with different combinations of transform techniques, we propose a novel and effective watermark extraction and detection method by pre-filtering, namely Adaptive Unsharp Masking (AUM). In spite of the fact that Unsharp Masking (UM) based pre-filtering is used for watermark extraction/detection in the literature by causing the details of the watermarked image become more manifest, effectiveness of UM may decrease in some cases of attacks. In this study, AUM has been proposed for pre-filtering as a solution to the disadvantages of UM. Experimental results show that AUM performs better up to 11\% in objective quality metrics than that of the results when pre-filtering is not used. Moreover; AUM proposed for pre-filtering in the transform domain image watermarking is as effective as that of used in image enhancement and can be applied in an algorithm-independent way for pre-filtering in transform domain image watermarking

A New Double Color Image Watermarking Algorithm Based on the SVD and Arnold Scrambling

We propose a new image watermarking scheme based on the real SVD and Arnold scrambling to embed a color watermarking image into a color host image. Before embedding watermark, the color watermark image W with size of M×M is scrambled by Arnold transformation to obtain a meaningless image W~. Then, the color host image A with size of N×N is divided into nonoverlapping N/M×N/M pixel blocks. In each (i,j) pixel block Ai,j, we form a real matrix Ci,j with the red, green, and blue components of Ai,j and perform the SVD of Ci,j. We then replace the three smallest singular values of Ci,j by the red, green, and blue values of W~ij with scaling factor, to form a new watermarked host image A~ij. With the reserve procedure, we can extract the watermark from the watermarked host image. In the process of the algorithm, we only need to perform real number algebra operations, which have very low computational complexity and are more effective than the one using the quaternion SVD of color image