Open AccessA Singular Value Decomposition Based Low-Computational Zero-Watermark Algorithm For Digital Right Management
Author(s) -
K. Premkumar,
Д. Маникандан,
Dr.V. Sapthagirivasan,
Dr.V. Nandalal
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.f1010.0886s19
Subject(s) - watermark , digital watermarking , singular value decomposition , algorithm , computer science , digital rights management , robustness (evolution) , artificial intelligence , computer vision , image (mathematics) , theoretical computer science , computer security , biochemistry , chemistry , gene
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