Robust Video Watermarking Algorithm based on DCT-SVD approach and Encryption

Sharing of digital media content over the internet is increasing everyday .Digital watermarking is a technique used to protect the intellectual property rights of multimedia content owners. In this paper, we propose a robust video watermarking scheme that utilizes Discrete Cosine Transform (DCT) and Singular Value Decomposition (SVD) for embedding a watermark into video frames. The proposed method uses encryption to make the watermark more robust against malicious attacks. The encryption key is used to modify the watermark before it is embedded in the video frames. The modified watermark is then embedded in the DCT and SVD coefficients of the video frames. The experimental results show that the proposed method provides better robustness against various attacks such as compression, noise addition, and filtering, while maintaining good perceptual quality of the watermarked video. The proposed method also shows better resistance against geometric attacks such as cropping, rotation, and scaling. Overall, the proposed method provides an effective solution for protecting the intellectual property rights of multimedia content owners in video distribution and transmission scenarios

Image watermarking based on framelet transform

Watermarking is used mostly for multimedia data copyright protection. This paper introduces the Transformation Framelet (FLT) for watermarking digital images. In this technique, the FLT is used to create an original image and watermark the low (LL) frequency subband of an original image in LL subband of an image watermarking. Simulation results demonstrate, in terms of a wide range of traditional attaches, that this approach is imperceptible and stable. MATLAB software version 2014 was used for simulation. Experiments on gray scale and colored images were performed in this work

Approximation-based homomorphic encryption for secure and efficient blockchain-driven watermarking service

Homomorphic encryption has been widely used to preserve the privacy of watermarking process on blockchain-driven watermarking services. It offers transparent and traceable encrypted watermarking without revealing sensitive data such as original images or watermark data to the public. Nevertheless, the existing works suffer from enormous memory storage and extensive computing power. This study proposed an approximation-based homomorphic encryption for resource-efficient encrypted watermarking without sacrificing watermarking quality. We demonstrated the efficiency of the Cheon-Kim-Kim-Son (CKKS) encrypted watermarking process using discrete cosine transform-singular value decomposition (DCT-SVD) embedding. The evaluation results showed that it could preserve the watermarking quality similar to non-encrypted watermark embedding, even after geometrical and filtering attacks. Compared to existing homomorphic encryption, such as Brakerski-Gentry-Vaikuntanathan (BFV) encryption, it has superior performance regarding resource utilization and watermarking quality preservation

A comparative study of steganography using watermarking and modifications pixels versus least significant bit

This article presents a steganography proposal based on embedding data expressed in base 10 by directly replacing the pixel values from images red, green blue (RGB) with a novel compression technique based on watermarks. The method considers a manipulation of the object to be embedded through a data compression triple process via LZ77 and base 64, watermark from low-quality images, embedded via discrete wavelet transformation-singular value decomposition (DWT-SVD), message embedded by watermark is recovered with data loss calculated, the watermark image and lost data is compressed again using LZ77 and base 64 to generate the final message. The final message is embedded in portable network graphic (PNG) images taken from the Microsoft common objects in context (COCO), ImageNet and uncompressed color image database (UCID) datasets, through a filtering process pixel of the images, where the selected pixels expressed in base 10, and the final message data is embedded by replacing units’ position of each pixel. In experimentation results an average of 40 dB in peak signal noise to ratio (PSNR) and 0.98 in the similarity structural index metric (SSIM) evaluation were obtained, and evasion steganalysis rates of up to 93% for stego-images, the data embedded average is 3.2 bpp

Region Adaptive Digital Image Watermarking System using DWT-SVD algorithm

Improving the robustness of watermark in withstanding attacks has been one of the main research objectives in digital image watermarking. In this paper we propose a novel region-adaptive watermarking technique that can provide improvements in both robustness and visual quality of the watermarks when compared to the original, non-region-adaptive, embedding technique. The proposed technique, which is derived from our previously published research finding, shows that the relative difference in spectral distributions between the watermark data and the host image plays an important role in improving the watermark robustness and transparency

Audio watermarking techniques using singular value decomposition

In an increasingly digital world, proving ownership of files is more and more difficult. For audio files, many schemes have been put into place to attempt to protect the rights of the digital content owners. In general, these techniques fall under the classification of Digital Rights Management (DRM). Audio watermarking is one of the less invasive schemes which embeds security into the data itself instead of in an outside layer meant to encapsulate and protect the data. There are many domains in which an audio watermark can be applied. The simplest is that of the time domain; often, however, other domains may be more desirable due to greater imperceptibility and robustness to attack. Common domains include the frequency domain, or domains similar to frequency through functions such as the Wavelet Transform. One domain of particular interest is that of the Singular Value Decomposition. The goal of this thesis is to propose and test many different watermarking schemes as well as test an existing watermarking scheme operating in the SVD domain in order to assess the viability of the SVD as a watermarking carrier domain. Different carrier matrices as well as bit embedding methods are explored. The use of a standard set of audio files was used to help test the systems; a standard set of watermarking tests was unavailable, so a comparable test bed was implemented and utilized

A New Blind Adaptive Watermarking Method Based on Singular Value Decomposition

A blind watermarking method on the basis of Singular Value Decomposition is proposed in this paper. Each bit of a watermark is being enclosed in 4x4 blocks. The method modifies the both left and right orthonormal matrices in order to embed a bit. A new embedding rule with adjustable parameters has been proposed for watermarking. The modification of orthonormal matrices is accomplished according to Van Elfrinkhof’s rotational model. Distortions of watermark embedding are minimized. A criterion of watermarking performance has been proposed that combines robustness and transparency. An adaptation on the basis of the criterion has been employed. Popular attacks have been applied and experimental results have been represented. The proposed watermarking method demonstrates better robustness toward some attacks in comparison with other known blind watermarking methods