Imperceptibility and robustness are the two complementary, but fundamental requirements of any digital image watermarking method. To improve the invisibility and robustness of multiplicative image watermarking, a complex wavelet based watermarking algorithm is proposed by using the human visual texture masking and visual saliency model. First, image blocks with high entropy are selected as the watermark embedding space to achieve imperceptibility. Then, an adaptive multiplicative watermark embedding strength factor is designed by utilizing texture masking and visual saliency to enhance robustness. Furthermore, the complex wavelet coefficients of the low frequency sub-band are modeled by a Gaussian distribution, and a watermark decoding method is proposed based on the maximum likelihood criterion. Finally, the effectiveness of the watermarking is validated by using the peak signal-to-noise ratio (PSNR) and the structural similarity index measure (SSIM) through experiments. Simulation results demonstrate the invisibility of the proposed method and its strong robustness against various attacks, including additive noise, image filtering, JPEG compression, amplitude scaling, rotation attack, and combinational attack.

No abstract

This paper presents, a novel watermarking scheme for digital images which overcomes the problems associated with singular value decomposition. Here, the singular values of the host image are modified using the principal components of the watermark in the DWT domain for providing copyright protection as well as reliability. This method accomplishes with an incorporation of fractional singular values in the scheme for finding the optimum scaling factors for efficient robustness and the fidelity of the scheme. By using this method we could eliminate the false positive problem and diagonal line problem which were found in the traditional singular value decomposition. the proposed scheme is tested under various forms of image processing attacks like noise addition, median filtering, JPEG compression, Geometric cropping Experimental results are provided to illustrate that the proposed scheme succeeded in providing copyright protection.

Video watermarking is a novel technology that has the ability to solve the problem of illegal digital video manipulation and distribution. In video watermarking, the copyright bits are embedded into video bit streams. This paper proposes two effective, robust and indiscerniblevideo watermarking algorithms. Both the algorithms of video watermarking are based on algebraic transform of Singular Value Decomposition (SVD). In the first algorithm, watermark information bits are embedded in the SVD-transformed video in a diagonal-wise fashion, and in the second algorithm the watermarked bits are embedded in a block-wise fashion. The performance of both the algorithms is performed in lines of imperceptibility, robustness and data payload. Similar results have been achieved with both the algorithms. The only variation in their performance was found in the form of robustness and data payload. The first proposed algorithm attained better robustness results. While the second proposed algorithm attained higher data payload.

No abstract