Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/15723
Full metadata record
DC FieldValueLanguage
dc.contributor.authorP., ASWATHI-
dc.date.accessioned2017-06-14T12:11:02Z-
dc.date.available2017-06-14T12:11:02Z-
dc.date.issued2013-07-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/15723-
dc.description.abstractAlways,the copy of any digital image is similar to the original. This has in many instances, laid way to the use of content of the digital image with malicious intent. So in order to protect any multimedia data against recording and transmitting illegally is to embed a digital signature or copyright label or watermark that acts on behalf of the owner of the data. These schems i.e,Data hiding, to embed secondary data in digital media, is making considerable progress in recent years and attracted attention from both academia and industry. Many Techniques have been developed for many applications, i.e,ownership protection, also their authenthication and access control. Some of the data hiding applications are Imperceptibility, having robustness against moderate processing such as compression, and the ability to hide many bits are the basic but rather conflicting requirements for many data hiding applications. For example, a visible “seal” placed over the image to identify the copyright of a person. We have worked on Color image compression and Watermark embedding laid on Block Truncation Coding (BTC) together with Parity checking.Unlike others, the proposed method do not bring considerable changes in the original image during watermark casting.Instead of that watermarkis added during the compression of the original image. First of all, we convert the input image from RGB plane to the NTSC (YIQ) plane. That means the image is transformed to two planes namely-luminance and chrominance . Then we divide Y plane into non-overlapping blocks and each block is coded by Y1&Y2, the representative planes and also a Bit map,hence for the planes I &Q, and we obtain the Bitmap and representative values.we add the watermark to the bit map by means of parity check and alteration. To confirm the robustness we put attacks to the output image obtained and by extracting the watermark information from the attacked image.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD NO.1371;-
dc.subjectWATERMARKINGen_US
dc.subjectMULTIPLE IMAGESen_US
dc.subjectNTSCen_US
dc.subjectBTCen_US
dc.titleWATERMARKING SCHEME FOR MULTIPLE IMAGESen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Electronics & Communication Engineering

Files in This Item:
File Description SizeFormat 
title_page.pdf318.2 kBAdobe PDFView/Open
FULL.pdf1.41 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.