A Singular Value Decomposition Based Low-Computational Zero-Watermark Algorithm for Digital Right Management
K. Premkumar1, T. Manikandan2, V. Sapthagirivasan3, V. Nandalal4
1K. Premkumar, Research Scholar, Anna University, Meenakshi College of Engineering, Chennai (Tamil Nadu), India.
2Dr. T. Manikandan, Professor, Department of ECE, Rajalakshmi Engineering College, Chennai (Tamil Nadu), India.
3Dr. V. Sapthagirivasan, Professor, Department of BME, Rajalakshmi Engineering College, Chennai (Tamil Nadu), India.
4Dr. V. Nandalal, Associate Professor, Department of ECE, Sri Krishna College of Engineering &Technology, Coimbatore (Tamil Nadu), India.
Manuscript received on 15 August 2019 | Revised Manuscript received on 27 August 2019 | Manuscript Published on 06 September 2019 | PP: 51-56 | Volume-8 Issue- 6S, August 2019 | Retrieval Number: F10100886S19/19©BEIESP | DOI: 10.35940/ijeat.F1010.0886S19
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: 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.
Keywords: Computational Cost, Digital Rights Management, Similarity Measure Singular Value Decomposition, Watermark.
Scope of the Article: Digital System and Logic Design