Screen-Shooting Resilient Watermarking Scheme via Learned Invariant Keypoints and QT

This paper proposes a screen-shooting resilient watermarking scheme via learned invariant keypoints and QT; that is, if the watermarked image is displayed on the screen and captured by a camera, the watermark can be still extracted from the photo. A screen-shooting resilient watermarking algorithm should meet the following two basic requirements: robust keypoints and a robust watermark algorithm. In our case, we embedded watermarks by combining the feature region filtering model to SuperPoint (FRFS) neural networks, quaternion discrete Fourier transform (QDFT), and tensor decomposition (TD). First we applied FRFS to locate the embedding feature regions which are decided by the keypoints that survive screen-shooting. Second, we structured watermark embedding regions centered at keypoints. Third, the watermarks were embedded by the QDFT and TD (QT) algorithm, which is robust for capturing process attacks. In a partial shooting scenario, the watermark is repeatedly embedded into different regions in an image to enhance robustness. Finally, we extracted the watermarks from at least one region at the extraction stage. The experimental results showed that the proposed scheme is very robust for camera shooting (including partial shooting) different shooting scenarios, and special attacks. Moreover, the efficient mechanism of screen-shooting resilient watermarking could have propietary protection and leak tracing applications.

A robust watermark algorithm for copyright protection by using 5-level DWT and two logos

<span>Recent growth and development of internet and multimedia technologies have made it significant to upload data; however, in this situation, the protection of intellectual property rights has become a critical issue. Digital media, including videos, audios, and images are readily distributed, reproduced, and manipulated over these networks that will be lost copyright. Also, the development of various data manipulation tools like PDF converter and Photoshop Editor has resulted in digital data copyright issues. So, a digital watermarking technique has emerged as an efficient technique of protecting intellectual property rights by providing digital data copyright authentication and protection. In this technique, a watermarked document was integrated into electronic data to prevent unauthorized access. In this paper, A robust watermark algorithm based on a 5-level DWT and Two Log was proposed to enhance the copyright protection of images in unsecured media. Our lab results validate that our algorithm scheme is robust and forceful against several sets of attacks, and high quality watermarked image was achieved, where the algorithm was assessed by computation of many evaluation metrics such as PSNR, SNR, MAE, and RMSE.</span>

Research on robust audio zero watermarking algorithm based on discrete cosine transform

This paper mainly uses the discrete cosine transform algorithm characteristics, combined with the “zero watermarking” embedding features, to improve the robustness of the watermark algorithm, to balance the uncoordinated relationship between robustness and transparency.

A Singular Value Decomposition Based Low-Computational Zero-Watermark Algorithm for Digital Right Management

Digital rights management (DRM) is a systematic approach used for protecting the exclusive rights in the digital mass media. It uses a set of technologies to control doubling and reproducing exclusive rights for the digital works and software. The digital watermarking is one of the powerful technologies that play a vital role in numeral rights management. In this paper, a low-computational zero watermark (ZW) algorithm has been projected. It depends on the singular value decomposition (SVD) and implemented on standard cameraman, Barbara, Lena and living room images without attack and with various attacks. The significant feature of this algorithm is that it does not fuse any watermarking in the given source image and hence the result of the zero-watermark algorithm is looking very similar to the source image. This zero-watermark property is obtained by using SVD approach in which the ZW sequence is computed in accordance with the equivalence of prior digits of major remarkable worth in every slab. The implementation consequences shows highest similarity measures of 0.8658 for cameraman image. Further, the computational cost of the algorithm is calculated as 4.442 msec of execution time for all the images under watermark embedder and watermark extractor phases. The PSNR values are calculated for the watermarked images for testing the robustness in the algorithm that is proposed, and the observations have shown the promising results against attack