A Paper On Non Blind Image Watermarking

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

IJSTE - International Journal of Science Technology & Engineering | Volume 3 | Issue 05 | November 2016

ISSN (online): 2349-784X

A Paper on Non-Blind Image Watermarking


Mr. Ashwini Baban Babar
PG Student
Department of Electronics & Telecommunication Engineering
SVERIs College of Engineering, Pandharpur (MH), India

Prof. J. A. Kendule
Assistant Professor
Department of Electronics & Telecommunication Engineering
SVERIs College of Engineering, Pandharpur (MH), India

Abstract
Recent years have seen the rapid growth of digital media, and their proliferation, especially images. This makes protecting
multimedia information become more and more important and a lot of copyright owners are concerned about protecting any
illegal duplication of their data or work. Some serious work needs to be done in order to maintain the availability of multimedia
information but, in the meantime, the industry must come up with ways to protect intellectual property of creators, distributors or
simple owners of such data. This is an interesting challenge and this is probably why so much attention has been drawn toward
the development of digital images protection schemes. Of the many approaches possible to protect visual data, digital
watermarking is probably the one that has received most interest. The idea of robust watermarking of images is to embed
information data within the image with an insensible form for human visual system but in a way that protects from attacks such
as common image processing operations. The goal is to produce an image that looks exactly the same to a human eye but still
allows its positive identification in comparison with the owner's key if necessary.
Keywords: Blind Embedding, Watermarks, PSNR, Visual Data
________________________________________________________________________________________________________
I.

INTRODUCTION

Digital watermarking is the act of hiding a message related to a digital signal (i.e. an image, song, video) within the signal itself.
It is a concept closely related to steganography, in that they both hide a message inside a digital signal. However, what separates
them is their goal. Watermarking tries to hide a message related to the actual content of the digital signal, while in steganography
the digital signal has no relation to the message, and it is merely used as a cover to hide its existence. Watermarking has been
around for several centuries, in the form of watermarks found initially in plain paper and subsequently in paper bills. However,
the field of digital watermarking was only developed during the last 15 years and it is now being used for many different
applications.
II. WATERMARKING APPLICATIONS
The increasing amount of research on watermarking over the past decade has been largely driven by its important applications in
digital copyrights management and protection. One of the first applications for watermarking was broadcast monitoring. It is
often crucially important that we are able to track when a specific video is being broadcast by a TV station. This is important to
advertising agencies that want to ensure that their commercials are getting the air time they paid for. Watermarking can be used
for this purpose. Information used to identify individual videos could be embedded in the videos themselves using watermarking,
making broadcast monitoring easier.
III. WATERMARKING PROPERTIES
Every watermarking system has some very important desirable properties. Some of these properties are often conflicting and we
are often forced to accept some trade-offs between these properties depending on the application of the watermarking system.
The first and perhaps most important property is effectiveness. This is the probability that the message in a watermarked
image will be correctly detected. We ideally need this probability to be 1. Another important property is the image fidelity.
Watermarking is a process that alters an original image to add a message to it, therefore it inevitably affects the images quality.
We want to keep this degradation of the images quality to a minimum, so no obvious difference in the images fidelity can be
noticed.
IV. WATERMARKING MODELS
There are several ways in which we can model a watermarking process. These can be broadly classified in one of two groups.
The first group contains models which are based on a communication-based view of watermarking and the second group
contains models based on a geometric view of watermarking. In the rest of this essay, I only refer to image watermarking
because I only concentrated on images during the development of example watermarking systems

All rights reserved by www.ijste.org

144

A Paper on Non-Blind Image Watermarking


(IJSTE/ Volume 3 / Issue 05 / 030)

Communication-based Models
Communication-based models describe watermarking in a way very similar to the traditional models of communication systems.
Watermarking is in fact a process of communicating a message from the watermarking embedder to the watermarking receiver.
Therefore, it makes sense to use the models of secure communication to model this process.

Fig. 1: Standard model of a communications channel with key-based encoding

In general, communication-based watermarking models can be further divided into two sub-categories. The first uses sideinformation to enhance the process of watermarking and the second does not use side-information at all. The term sideinformation refers to any auxiliary information except the input message itself that can be used to better encode or decode it.
Geometric Models
It is often useful to think of watermarking in geometric terms. In this type of model, images, watermarked and unwatermarked,
can be viewed as high-dimensional vectors, in what is called the media space. This is also a high-dimensional space that contains
all possible images of all dimensions. For example a 512 X 512 image would be described as a 262144 elements vector in a
262144-dimensional space.
Geometric models can be very useful to better visualize the watermarking process using a number of regions based on the
desirable properties of watermarking. One of these regions is the embedding region, which is the region that contains all the
possible images resulting from the embedding of a message inside an unwatermarked image using some watermark embedding
algorithm.

Fig. 2: The region of acceptable fidelity (defined by MSE) and the detection region (defined by linear correlation)

When thinking about complex watermarking systems, it is sometimes more useful to consider a projection of the media space
into a possibly lower-dimension marking space in which the watermarking then takes place as usual. This projection can be
handled more easily by computers because of the smaller number of vector elements and can be possibly expressed by blockbased watermarking algorithms which separate images into blocks instead of operating on a pixel basis. As described earlier,
some communication-based watermarking models do not take advantage of the channel side-information. In this kind of models,
the image is simply considered as another form of channel noise that distorts the message during its transmission. This can be
seen in Figure 3. The watermark embedder encodes a message using a watermark encoder and a key

All rights reserved by www.ijste.org

145

A Paper on Non-Blind Image Watermarking


(IJSTE/ Volume 3 / Issue 05 / 030)

V. WATERMARKING WITHOUT SIDE-INFORMATION


As described earlier, some communication-based watermarking models do not take advantage of the channel side-information. In
this kind of models, the image is simply considered as another form of channel noise that distorts the message during its
transmission. This can be seen in Figure 3.

Fig. 3: Standard model for watermarking with no side-information

Blind Embedding and Linear Correlation Detection


An example of the embedding process can be seen in Figure 4. The top left image is the original image, the bottom left image is
the reference pattern and the watermarked image resulting from embedding a 1, with =1, is seen on the right. As we can see,
there is no perceptual difference between the original and the watermarked image

Fig. 4: Embedding process

Peak Signal-to-Noise Ratio (PSNR)


Peak Signal to Noise Ratio (PSNR) is computed to analyze the concealing effect of the watermark. It is calculated as the ratio
between the maximum power of the original image and the power of unwanted noise which is added to the image (which will
affect the exactness of its representation). The formula to find out PSNR is shown in (3).

(3)
Normalized Correlation (NC)
The robustness of the proposed algorithm is analyzed by using Normalized Cross Correlation (NC). It is a metric to evaluate the
degree of similarity (or dissimilarity) between two compared images. The original watermark and the extracted watermark are
compared. The equation to compute NC is given in (4).

(4)
Where, W(i, j) is the original watermark and W(i, j) is the extracted watermark.

All rights reserved by www.ijste.org

146

A Paper on Non-Blind Image Watermarking


(IJSTE/ Volume 3 / Issue 05 / 030)

VI. RESULT

Fig. 5: Result

VII. CONCLUSION
Watermarking is a very active research field with a lot of applications. Although it is a relatively new field, it has produced
important algorithms for hiding messages into digital signals. These can be described by many different models. Two broad
categories for these models were described in this essay. These are communication-based models and geometric models.
Communication-based models can be further divided into those which use side-information and those that dont. The choice of
which to use relies on the underlying applications requirements.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]

M. Yeung and F. Mintzer Invisible Watermarking for Image Verification. Journal of Electronic Imaging, pp. 576-591, 1998
Namita Chandrakar Performance Analysis of DWT Based Digital Image Watermarking Using RGB Color Space Volume 4, Issue 1, January 2015
Pratibha Sharma Digital Image Watermarking Using 3 level Discrete Wavelet Transform Conference on Advances in Communication and Control
Systems 2013 (CAC2S 2013)
Aparna J Ra Image Watermarking using Diffie Hellman Key Exchange Algorithm Procedia Computer Science 46 ( 2015 ) 1684 1691
Rahul Saxena Blind digital watermarking using AES technique for colour imagespp54-57,2015
Manjusha Tikariha An Efficient JND based Digital Image Watermarking using Hybrid DWT-DCT-SVD Approach, Volume-10, Number - 01, 2015
D.Vaishnavi Robust and Invisible Image Watermarking in RGB Color space using SVD , Procedia Computer Science 46 ( 2015 ) 1770 1777
Farzaneh Sarkardeh Effective Svd-Ycbcr Color Image Watermarking, Vol. 3, No. 3, March 2015, 110116.

All rights reserved by www.ijste.org

147

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy