Article Fingerprint
ReserarchID
CSTGVARLS2
With the exponential growth of internet and high speed networks operating throughout the world it is a challenging task to protect copyright of an individual’s creation. In this paper, a spreadspectrum-like discrete cosine transform (DCT) domain watermarking technique for copyright protection of still digital images is analyzed. In our approach, the watermark is embedded in the mid frequency band of the DCT blocks only in the sub band which is carrying low frequency components and the high frequency sub band components remain untouched. With this approach we are developing an application for copyright protection and X-ray medical application too .For further security we are using ZIP Compression Technique. In effect, the main purpose of image compression is to trim down redundancy of the image data in order to be able to store or transmit data in an efficient form.
Raunak Phade. 1970. \u201cDigital Image Watermarking using DCT and Zip Compression Technique\u201d. Global Journal of Computer Science and Technology - F: Graphics & Vision GJCST-F Volume 13 (GJCST Volume 13 Issue F3).
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 104
Country: India
Subject: Global Journal of Computer Science and Technology - F: Graphics & Vision
Authors: Raunak Phade, Rucha Mahajan, Sampurna Mankar, Pratik Patil (PhD/Dr. count: 0)
View Count (all-time): 272
Total Views (Real + Logic): 25484
Total Downloads (simulated): 11286
Publish Date: 1970 01, Thu
Monthly Totals (Real + Logic):
This study aims to comprehensively analyse the complex interplay between
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.