Professional Documents
Culture Documents
PROJECT REPORT
On
In
Department of Computer Engineering
(2009-10)
CERTIFICATE
This is to certify that project report entitled “Study and implement Digital Watermarking
algorithm on Images using Scale Invariant Feature Transformation” is submitted by
We are deeply indebted to our guide Dr. Vijay Laxmi, professor in the department of computer
engineering, MNIT Jaipur for their incomparable encouragement and valuable support in the
project.
We owe our deep regard to Dr. M. S. Gaur, professor in the department of computer
engineering, MNIT Jaipur, whose noble suggestion and guidance as our project coordinator was
instrumental in completing the project.
We would like to acknowledge our sincere regards to all faculty members of department of
Computer Engineering, MNIT and especially to Mrs. Reena Gunjan for her help and valuable
suggestions in the project.
We would like to thank our friend and classmate Roopesh Chuggani for his direct and indirect
help in the project.
Pritam Hinger
Vikas Sarda
Vishal Pareek
With the advent of internet, creation and delivery of digital data (images, video and audio files,
digital repositories and libraries, web publishing) has grown many fold. With this, issues like,
protection of rights of the content and proving ownership, arises. Digital watermarking came as a
technique and a tool to overcome shortcomings of current copyright laws for digital data. To
prove ownership and protect right, a watermark is embedded in data but to save watermark from
counterfeiters we need to find locations which are invariant to all kind of attacks (rotation,
expansion, compression, cropping, filtering, and blurring). Every image has regions, also known
as patches, which are invariant to attacks. These patches can be found by using Scale Invariant
Feature Transform (SIFT) over image. As these patches are very stable and resistant to attacks so
watermark is inserted in these patches and can also be successfully extracted with low error
probability.
Chapter 1 INTRODUCTION
We are living in the era of information where billions of bits of data is created in every fraction
of a second and with the advent of internet, creation and delivery of digital data (images, video
and audio files, digital repositories and libraries, web publishing) has grown many fold. Since
copying a digital data is very easy and fast too so, issues like, protection of rights of the content
and proving ownership, arises. Digital watermarking came as a technique and a tool to overcome
shortcomings of current copyright laws for digital data. The specialty of watermark is that it
remains intact to the cover work even if it is copied. So to prove ownership or copyrights of data
watermark is extracted and tested. It is very difficult for counterfeiters to remove or alter
watermark. As such the real owner can always have his data safe and secure.
Our aim was to study different watermarking techniques and implement the one which is
most resistant to all types of attack, scalar or geometric. Counterfeiters try to degrade the quality
of watermarked image by attacking an image (generally attacks are median and Gaussian filter,
scaling, compression and rotation of watermarked image).By attacking watermarked image it
become very difficult to recover watermark back from the watermarked image and even if it
extracted one may no longer use it to prove the ownership and copyrights. So our main idea was
to find such regions, also known as patches, in an image which are very stable and resistant to
attacks.
The report is divided mainly in 4 chapters coving literature on watermarking (chapter2), our
methodology and step by step procedure (chapter3), test images and results (chapter4),
conclusion and future work (chapter5).
Chapter 2 gives full insight of digital watermarking, its history, requirements, application
and possible attacks. The first subheading tells how, with information revolution, the need to
have some technique to prevent piracy and illegal copying of data arises. This need give rise to a
new technique, known as Digital Watermarking. While proposing any algorithm some
parameters are needed to keep in mind on which the proposed algorithm must be consistent.
These parameters are discussed in following section. Following sections are dedicated to
watermarking application and attacks. A lot of work is going on for making watermarking
techniques immune towards attack to retain the originality of watermark and assuring successful
extraction of watermark with low error probabilities so to sort out disputes, if any, over
copyrights or ownership.
Chapter 3 starts with a flowchart showcasing the complete flow of project. Flowchart also
contains names of all the functions written to implement the proposed method. The next few
sections explain the complete process followed by us in full detail, listing all the mathematical
steps and explaining all the concepts used, like SIFT.
Chapter 4 lists all the test images and test results. The proposed method is tested for over
30 random images (all 150x200 .jpeg images) covering over 7500 patches. Each image is
attacked (13 different types of attacks) and tested. Results are listed in next section.
Chapter 5 concludes the report with possible work which may be done in future. Since
threats like piracy and counterfeiting are increasing day by day so a lot more work and research
can be done.
Appendix A contains code snippets and all functions’ signature.
Chapter 2 Overview
Hold a Rs100 note up or your offer letter up to light. What you will see is a picture of
Mahatma Gandhi or company’s logo respectively. This is what is known as a watermark mainly
used to prove the ownership (in case of offer letter, watermark prove that the document is official
document of company meant for official work) or authenticity (in case of Rs 100, watermark rule
out the forgery and authenticate the piece of paper of its worth).
The watermark on the Rs100 (Figure2.1), just like most paper watermarks today, has two
properties. First, the watermark is hidden from view during normal use, only becoming visible as
a result of a special viewing process (in this case, holding the bill up to the light). Second, the
watermark carries information about the object in which it is hidden (in this case, the watermark
indicates the authenticity of the bill).
Watermark
Fig 2.1 Image showing an INR 100 note having watermark at its left side which is considerably visible
when note hold under light.
In addition to paper, watermarking can be applied to other physical objects and to electronic
signals. Fabrics, garment labels, and product packaging are examples of physical objects
that can be watermarked using special invisible dyes and inks Electronic representations of
music, photographs, and video are common types of signals that can be watermarked.
Thus, watermarking is defined as, “the practice of imperceptibly altering a Work to embed a
message about that Work.”
As is clear from the figure, digital watermarking model consist of an embedder and a detector.
The embedder takes two inputs. One is the payload we want to embed (the watermark ),
and the other is the cover work in which we want to embed the payload. The output of the
embedder is typically transmitted or recorded. Later, that Work (or some other Work that
has not been through the embedder) is presented as an input to the detector. Most detectors try
to determine whether a payload is present, and if so, output the message encoded by it.
The watermarking model is analogous to a communication model in which sender encode a
message before transmitting it over communication channel and on receiving, receiver decode
the encoded message.
2.1 History of Watermarking
Although the art of papermaking was invented in China over one thousand years
earlier, paper watermarks did not appear until about 1282, in Italy. The marks were made by
adding thin wire patterns to the paper molds. The paper would be slightly thinner where the wire
was and hence more transparent. The meaning and purpose of the earliest watermarks are
uncertain. They may have been used for practical functions such as identifying the molds
on which sheets of papers were made, or as trademarks to identify the paper maker. On
the other hand, they may have represented mystical signs, or might simply have served as
decoration. By the eighteenth century, watermarks on paper made in Europe and
America had become more clearly utilitarian. They were used as trademarks, to record the date
the paper was manufactured, and to indicate the sizes of original sheets. It was also
about this time that watermarks began to be used as anticounterfeiting measures on money
and other documents. The term watermark seems to have been coined near the
end of the eighteenth century and may have been derived from the German term wassermarke
(though it could also be that the German word is derived from the English). The term is actually
a misnomer, in that water is not especially important in the creation of the mark. It was probably
given because the marks resemble the effects of water on paper.
About the time the term watermark was coined, counterfeiters began developing methods
of forging watermarks used to protect paper money. Counterfeiting prompted advances in
watermarking technology. William Congreve, an Englishman, invented a technique for making
color watermarks by inserting dyed material into the middle of the paper during papermaking.
The resulting marks must have been extremely difficult to forge, because the Bank of
England itself declined to use them on the grounds that they were too difficult to make. A more
practical technology was invented by another Englishman, William Henry Smith. This replaced
the fine wire patterns used to make earlier marks with a sort of shallow relief sculpture,
pressed into the paper mold. The resulting variation on the surface of the mold produced
beautiful watermarks with varying shades of gray. This is the basic technique used today for the
face of President Jackson on the $20 bill.
Four hundred years later, in 1954, Emil Hembrooke of the Muzak Corporation filed a
patent for “watermarking” musical Works. An identification code was inserted in music by
intermittently applying a narrow notch filter centered at 1 kHz. The absence of energy at this
frequency indicated that the notch filter had been applied and the duration of the absence used to
code either a dot or a dash. The identification signal used Morse code.
It is difficult to determine when digital watermarking was first discussed.
In 1979, Szepanski described a machine-detectable pattern that could be placed on documents for
anti-counterfeiting purposes. Nine years later, Holt described a method for embedding an
identification code in an audio signal. However, it was Komatsu and Tominaga, in 1988, which
appear to have first used the term digital watermark. Still, it was probably not until the early
1990s that the term digital watermarking really came into vogue. About 1995, interest in digital
watermarking began to mushroom. In addition, about this time, several organizations began
considering watermarking technology for inclusion in various standards. The Copy Protection
Technical Working Group (CPTWG) tested watermarking systems for protection of video on
DVD disks. The Secure Digital Music Initiative (SDMI) made watermarking a central
component of their system for protecting music. Two projects sponsored by the European Union,
VIVA [110] and Talisman, tested watermarking for broadcast monitoring. The International
Organization for Standardization (ISO) took an interest in the technology in the context of
designing advanced MPEG standards. In the late 1990s several companies were established to
market watermarking products. Technology from the Verance Corporation was adopted into the
first phase of SDMI and was used by Internet music distributors such as Liquid
Audio. In the area of image watermarking, Digimarc bundled its watermark
embedder and detectors with Adobe’s Photoshop. More recently, a number of companies have
used watermarking technologies for a variety of applications.
The sudden increase in watermarking interest is most likely due to the increase in concern
over copyright protection of content. The Internet had become user friendly with the introduction
of Marc Andreessen’s Mosaic web browser in November 1993, and it quickly became clear that
people wanted to download pictures, music, and videos. The Internet is an excellent distribution
system for digital media because it is inexpensive, eliminates warehousing and stock, and
delivery is almost instantaneous. However, content owners (especially large Hollywood studios
and music labels) also see a high risk of piracy. This risk of piracy is exacerbated by the
proliferation of high-capacity digital recording devices. When the only way the average
customer could record a song or a movie was on analog tape, pirated copies were
usually of a lower quality than the originals, and the quality of second-generation pirated
copies (i.e., copies of a copy) was generally very poor. However, with digital recording devices,
songs and movies can be recorded with little, if any, degradation in quality. Using these
recording devices and using the Internet for distribution, would-be pirates can easily
record and distribute copyright-protected material without appropriate compensation being
paid to the actual copyright owners. Thus, content owners are eagerly seeking technologies that
promise to protect their rights. The first technology content owners turn to is cryptography.
Cryptography is probably the most common method of protecting digital content. It is certainly
one of the best developed as a science. The content is encrypted prior to delivery, and a
decryption key is provided only to those who have purchased legitimate copies of the
content. The encrypted file can then be made available via the Internet, but would be useless to a
pirate without an appropriate key. Unfortunately, encryption cannot help the seller monitor how
a legitimate customer handles the content after decryption. A pirate can actually purchase the
product, use the decryption key to obtain an unprotected copy of the content, and then
proceed to distribute illegal copies. In other words, cryptography can protect content in
transit, but once decrypted, the content has no further protection. Thus, there is a strong need
for an alternative or complement to cryptography: a technology that can protect content even
after it is decrypted. Watermarking has the potential to fulfill this need because it places
information within the content where it is never removed during normal usage. Decryption,
reencryption, compression, digital-to-analog conversion, and file format changes—a watermark
can be designed to survive all of these processes. Watermarking has been considered for many
copy prevention and copyright protection applications. In copy prevention, the watermark may
be used to inform software or hardware devices that copying should be restricted. In
copyright protection applications, the watermark may be used to identify the copyright
holder and ensure proper payment of royalties.
Although copy prevention and copyright protection have been major driving forces
behind research in the watermarking field, there is a number of other applications for which
watermarking has been used or suggested. These include broadcast monitoring, transaction
tracking, authentication (with direct analogy to our Rs100 example), copy control, and device
control.
2.4 Applications of Digital Watermarking
Copy prevention or control. Watermarks can also be used for copy prevention and
control. For example, in a closed system where the multimedia content needs special
hardware for copying and/or viewing, a digital watermark can be inserted indicating the
number of copies that are permitted. Every time a copy is made the watermark can be
modified by the hardware and after a point the hardware would not create further copies
of the data. An example of such a system is the Digital Versatile Disc (DVD). In fact, a
copy protection mechanism that includes digital watermarking at its core is currently
being considered for standardization and second generation DVD players may well
include the ability to read watermarks and act based on their presence or absence.
Another example is in digital cinema, where information can be embedded as a
watermark in every frame or a sequence of frames to help investigators locate the scene
of the piracy more quickly and point out weaknesses in security in the movie’s
distribution. The information could include data such as the name of the theater and the
date and time of the screening. The technology would be most useful in fighting a form
of piracy that’s surprisingly common, i.e., when someone uses a camcorder to record the
movie as it’s shown in a theater, then duplicates it onto optical disks or VHS tapes for
distribution.
Fraud and tamper detection. When multimedia content is used for legal purposes,
medical applications, news reporting, and commercial transactions, it is important to
ensure that the content was originated from a specific source and that it had not been
changed, manipulated or falsified. This can be achieved by embedding a watermark in the
data. Subsequently, when the photo is checked, the watermark is extracted using a unique
key associated with the source, and the integrity of the data is verified through the
integrity of the extracted watermark. The watermark can also include information from
the original image that can aid in undoing any modification and recovering the original.
Clearly a watermark used for authentication purposes should not affect the quality of an
image and should be resistant to forgeries. Robustness is not critical as removal of the
watermark renders the content inauthentic and hence of no value.
The following diagram depicts the complete flow of project with the respective modules
or function names:
The following is the step by step procedure with detailed description is as follows:
3.2.2 SIFT:
Scale-invariant feature transform (or SIFT) is an algorithm in computer
vision to detect and describe local features in images. The algorithm was published
by David Lowe in 1999. For any object in an image, interesting points on the object can
be extracted to provide a "feature description" of the object. This description, extracted
from a training image, can then be used to identify the object when attempting to locate
the object in a test image containing many other objects. It is important that the set of
features extracted from the training image is robust to changes in image scale, noise,
illumination, and local geometric distortion to perform reliable recognition. Lowe's
patented method can robustly identify objects even among clutter and under partial
occlusion, because his SIFT feature descriptor is invariant to scale, orientation, and
affine distortion, and partially invariant to illumination changes.
The following is an image (Figure 3.1(a)) on which sift is applied to find
keypoints. Initially (Figure 3.1(b)) 832 keypoints locations at maxima and minima of the
difference-of-Gaussian function. After applying a threshold on minimum contrasts, 729
keypoints remain (Figure 3.1(c)). Figure3.1 (d) shows image with 536 keypoints that
remained following an additional threshold.
Fig 3.4. This figure shows the stages of keypoints selection. (a) The 233x189 pixel original image.
(b) The initial 832 keypoints locations at maxima and minima of the DoG function. (c) After
applying a threshold on minimum contrast, 729 keypoints remain. (d) The final 536 keypoints that
remain following an additional threshold.
The selection of features is important for robust watermarking in content-based
synchronization methods. We believe that local image characteristics are more useful
than global ones. The scale-invariant feature transform, SIFT, extracts features by
considering local image properties and is invariant to rotation, scaling, translation, and
partial illumination changes. We implemented a proposed watermarking method, using
the SIFT, that is robust to geometric distortions. Using the SIFT, we generate circular
patches that are invariant to translation and scaling distortions. The watermark is inserted
into the circular patches in an additive way in the spatial domain. Rotation invariance is
achieved using the translation property of the polar-mapped circular patches. We have
performed an intensive simulation to show the robustness of the proposed method with
25 test images. The simulation results confirm that our method is robust against
geometric distortion attacks as well as signal-processing attacks.
In order to extract candidate locations for features, the scale space D(x,
y,) is computed using a DoG function. As shown in Fig. 3.2, they successively
smooth original images with a variable-scale (1, 2, and 3) Gaussian function
and calculate the scale-space images by subtracting two successive smoothed
images. The parameter is a variance (called a scale) of the Gaussian function.
The scale of the scale-space images is determined by the nearby scale (1, 2, or
3) of the Gaussian-smoothed image. In these scale-space images, they retrieve all
local maxima and minima by checking the closest eight neighbors in the same
scale and nine neighbors in the scales above and below. These extrema determine
the location (t1, t2) and the scale s of the SIFT features, which are invariant to the
scale and orientation change of images. In our experiment, to generate the scale-
space images, we apply scales of the Gaussian function from 1.0 to 32.0 and
increase the scale by multiplying by a constant factor 2.
Fig 3.5 Scale space by using Difference-of-Gaussian (DoG) function and neighbor of a
pixel.
After candidate locations have been found, a detailed model is fitted by a 3-D
quadratic function to determine accurately the location (t1, t2) and scale s of each
feature. In addition, candidate locations that have a low contrast or are poorly
localized along edges are removed by measuring the stability of each feature
using a 2-by-2 Hessian matrix H as follows:
Here e is the ratio of the largest to the smallest Eigen value and is used to control
stability. They use e=10. The quantities Dxx, Dxy, and Dyy are the derivatives of the
scale space images. In order to achieve invariance to image rotation, they assign a
consistent orientation to each feature. In the Gaussian-smoothed image with the
scale of the extracted SIFT features, they calculate gradient orientations of all
sample points within a circular window about a feature location and form an
orientation histogram. The peak in this histogram corresponds to the dominant
direction of that feature.
The width and height of the image are denoted by w and h, respectively. The r
value is a constant to control the distance between adjacent features and is set at
16 and 32 in the insertion and detection processes, respectively. Figure 2 shows a
circular patch from our proposed synchronization method in spatial filters,
additive uniform noise, rotation, and scaling of the image. For convenience of
identification, we represent only one patch and find that the patch is formulated
robustly, even when the image is distorted.
Fig 3.6Circular patch from our proposed method in (a) the original image, (b) the mean-filtered
image, (c) the median-filtered image, (d) the additive uniform noise image, (e) the 10-deg rotated
image, and (f) the 1.2x scaled image.
To generate the circular watermark, the x- and the y-axes of the rectangular watermark
are inversely polar-mapped into the radius and angle directions of the patch. The relation
between the coordinates of the rectangular watermark and the circular watermark is
represented as follows:
where x and y are the rectangular watermark coordinates, ri and are the coordinates of
the circular watermark, rM is equal to the radius of the patch, and r0 is a fixed fraction of
rM. In our project, we set r0 to rM /4.
For effective transformation, r0 should be larger than M /, and the difference between
rM and r0 should be larger than N. If these constraints are not satisfied, the rectangular
watermark must be sampled. As a result, it is difficult to transform efficiently. To
increase the robustness and invisibility of the inserted watermark, we transform the
rectangular watermark to be mapped to only the upper half of the patch, i.e., the y-axis of
the rectangular watermark is scaled by the angle of a half circle (), not the angle of a
full circle (2 ). The lower half of the patch is set symmetrically with respect to the
upper half (see Fig. 3).
In aspect of the image, watermarks constitute a kind of noise. When noise of
similar strength gathers together, we can perceive it. In our scheme, a pixel in the
rectangular watermark is mapped to adjacent several pixels in the circular watermark
during polar mapping. In other words, the same noise is inserted into the homocentric
region of a circular patch. Therefore, if the size of the homocentric region is large, the
inserted watermark is visible (as an embossing effect). Through symmetrical mapping,
we can make the size of the homocentric region small and thus render the watermark
invisible. Moreover, we can increase the likelihood that the watermark will survive
attacks such as cropping.
where is the lower bound of visibility in flat and smooth regions and is the upper
bound in edged and texture regions. The noise visibility function is calculated as follows:
where 2x(ij) and 2 x max denote the local variance and maximum of neighboring pixels
within five pixels, and D is a scaling constant.
Fig 3.8 Diagrammatic representation of Watermark insertion scheme
Step b.3. Finally, we insert this circular watermark additively into the spatial
domain. The insertion of the watermark is represented as the spatial addition
between the pixels of images and the pixels of the circular watermark as follows:
Here vi and wci denote the pixels of images and of the circular watermark,
respectively, and denotes the perceptual mask that controls the insertion
strength of the watermark.
3.2.5 Watermark Detection:
Similarly to watermark insertion, the first step for watermark detection is
analyzing the image contents to extract patches. The watermark is then detected from the
patches. If the watermark is detected correctly from at least one patch, we can prove
ownership successfully. Our watermark detection process is shown in Fig. 4(B).
Step a. To extract circular patches, we use the SIFT descriptor, as described in Sec. 2.
There are several patches in an image, and we try to detect the watermark from all
patches.
Step b.1. The additive watermarking method in the spatial domain inserts the watermark
into the image contents as noise. Therefore, we first apply a Wiener filter to extract this
noise by calculating the difference between the watermarked image and its Wiener-
filtered image, and then regard that difference as the retrieved watermark.6 As with the
watermark insertion process, we compensate for the modification by perceptual masks,
but such compensation does not greatly affect the performance of watermark detection.
Step b.2. To measure the similarity between the reference watermark generated during
watermark insertion and the retrieved watermark, the retrieved circular watermark should
be converted into a rectangular watermark by applying the polar-mapping introduced in
Sec3.2.4. Considering the fact that the watermark is inserted symmetrically, we take the
mean value from the two semicircular areas. By this mapping, the rotation of circular
patches is represented as a translation, and hence we achieve rotation invariance for our
watermarking scheme.
Fig 3.9 Diagrammatic representation of Watermark extraction scheme
Step b.3. We apply circular convolution to the reference watermark and the retrieved
watermark. The degree of similarity between the two, called the response of the
watermark detector, is represented by the maximum value of circular convolution as
follows:
where w is the reference watermark and w* is the retrieved watermark. The range of
similarity values is from −1.0 to 1.0. We can identify the rotation angle (/ r) of the
patches by finding the r with the maximum value. If the similarity exceeds a predefined
threshold, we can be satisfied that the reference watermark has been inserted. The method
of determining the threshold is described in the following section.
Step c. As mentioned, there are several circular patches in an image. Therefore, if the
watermark is detected from at least one patch, ownership is proved, and not otherwise.
The fact that we insert the watermark into several circular patches, rather than just one,
makes it highly likely that the proposed scheme will detect the watermark, even after
image distortions. Our watermarking scheme is robust against geometric distortion
attacks as well as signal-processing attacks. Scaling and translation invariance is achieved
by extracting circular patches from the SIFT descriptor. Rotation invariance is achieved
by using the translation property of the polar mapped circular patches.
We applied various attacks: median filter [2x2], [3x3], and [4x4], JPEG
compression quality factor 40, 60, 90, Gaussian filtering [3x3], and scaling 0.7x, 0.8x,
0.9x, 1.1x, 1.2x and 1.3x.
Detection ratio refers to the ratio of the number of extracted patches from attacked
images to the number of correctly redetected patches from original image. Detection
failure refers to the number of images in which no patch is redetected.
Chapter 4 RESULTS
Detection ratio refer to the ratio of the number of patches correctly redetected from
watermarked image to total number of patches in which watermark inserted. Among 30 images,
detection failure refers to the number of images where inserted watermark could not be detected
with minimum similarity to prove ownership and hence we fail to prove ownership in those
images. Similarity is the average of similarity values from correctly detected watermark patches.
Table 4.1 Fraction of correctly detected watermark patches, number of failure images, and similarity under common
signal-processing and geometric attacks
The result set as shown in Table 4-1, clearly depicts the inserted watermark is
successfully detected even after using additive watermarking method in spatial domain, which is
very unlikely as in case of attacks pixel values may change abnormally and it may be difficult to
recover the original pixel value and thus watermark may be lost.
Our major contribution is that we have proposed a robust watermarking scheme that uses
local invariant features. In order to resist geometric distortions, we extracted circular patches
using the SIFT descriptor, which is invariant to translation and scaling distortion. These patches
were watermarked additively in the spatial domain. Rotation invariance was achieved using the
translation property of the polar-mapped circular patches. We performed an intensive simulation,
and the results showed that our method would be robust against geometric distortion attacks as
well as signal-processing attacks. We believe that the consideration of local features is important
for the design of robust watermarking schemes, and our method is a solution that uses such
features
Drawbacks of the proposed watermarking scheme are related to its vulnerability to large
distortion of the aspect ratio. In addition, due to the computation time for the SIFT descriptor and
for the compensation of alignment errors, our scheme cannot be used effectively in real-time
applications.
Future work will focus on eliminating those drawbacks. In future this work can also be
extended for inserting watermark on videos. A Video is a sequence of images, called as frames,
and these frames are more or less same with slight changes and thus position of patches may not
vary considerably in adjacent patches. This property may be exploited to derive a new technique
for watermarking on videos. The time complexity may be an issue as a lot of computation needs
to be done and computational time for SIFT descriptor is already very large.
Appendix A
The following are the signature and brief description of functions used during
implementation of the proposed scheme:
1. processWatermark:
Input parameters:
o watermarkFileName
o radius
Output parameters:
o W: processed watermark image matrix
o P: radius matrix of circular watermark
o Q: theta matrix of circular watermark
Description: This module performs the polar mapping of rectangular
watermark to circular watermark.
2. insertWatremark:
Input parameters:
o I: cover work
o W: processed Watermark
o X: x-co-ordinate
o Y: y-co-ordinate
Output parameters:
o I: watermarked image
Description: This module inserts watermark into image.
3. extractWatermark:
Input parameters:
o I: watermarked Image
o I1: original cover work
o X: x-co-ordinate
o Y: y-co-ordinate
o [a,b]:size of watermark
Output parameters:
o RW: retrieved watermark
Description: This module extract watermark from watermarked image.
4. compareWatermark:
Input parameters:
o W: reference watermark
o RW: retrieved watermark
o Diff: Pixel Error
Output parameters:
o Ratio: similarity ratio.
Description: This module compares the retrieved watermark with
reference watermark and gives the similarity as a ratio.
5. calculateDetectionratio:
Input parameters:
o frame: sift frame matrix for original cover work
o f1: sift frame matrix for attacked image
o diff: pixel error
Output parameters:
o ratio: detection ratio
Description: This module calculates the detection ratio for the attacked
image.
References
[1] H.Y. lee, H.S. Kim and H.K. Lee, “Robust image watermarking using local invariant
features” optical engineering vol45 (3)(2006)037002(page 1-11)
[2] D.G. Lowe, “Distinctive Image Features from Scale-Invariant Keypoints” International
Journal of Computer Vision 60(2) (2004) page 91-110.
[3] Leida LI, Xiaoping YUAN, Zhaolin LU, Jeng-Shyang PAN “Rotation Invariant Watermark
Embedding Based on Scale-Adapted Characteristic Regions” Informational Sciences (November
2009) page 1-22.
[4] Xia-mu Niu, Zhe-ming Lu, Sheng-ho Sun, “Digital Watermarking of Still Images with Gray-
Level Digital Watermarks” IEEE transaction on Consumer Electronics, Vol. 46, No.1 (February
2000) page 137-145.
[8]A. Nikolaidis and I. Pitas, “Region-based Image Watermarking” IEEE Transactions on Image
Processing, VOL.10, NO.11 (2001) page 1726-1740.
[9] Book on Digital Watermarking and Steganography by Ingemar J. Cox and Matthew L.
Miller, The Morgan Kaufmann Series in Multimedia Information and Systems, Second Edition.