DISSERTATION

ON

Performance Improvement of CRT-based Watermarking Technique

for Digital Media Authentication

MASTER OF TECHNOLOGY
IN
ELECTRONICS AND COMMUNICATION ENGINEERING
Submitted by:
xxxxxx

Under the Guidance of:

Mr. TAZEEM AHMAD KHAN

Assistant Professor, Department of ECE, AFU

Department of Electronics and Communication Engineering

Al-falah School of Engineering &Technology,Dhauj, Faridabad (Haryana),
(2014)

DISSERTATION
ON

SUBMITTED IN PARTIAL FULLFILLMENT OF THE

Performance Improvement of CRT-based Watermarking Technique

for Digital Media Authentication
REQUIREMENT FOR THE AWARD OF THE DEGREE OF
MASTER OF TECHNOLOGY
IN
ELECTRONICS AND COMMUNICATION ENGINEERING
Submitted by:
xxxxxxxx
MTE-12-08

Under the Guidance of:

Mr. TAZEEM AHMAD KHAN

Assistant Professor, Department of ECE, AFU

Department of Electronics and Communication Engineering

Al-falah School of Engineering & Technology, Dhauj, Faridabad (Haryana)
(2014)

CERTIFICATE
I hereby certify that the work which is being presented in M.Tech Dissertation Performance
Improvement of CRT-based Watermarking Technique for Digital Media Authentication
, in the partial fulfillment of requirements of award of Master of Technology in the field of
Electronics and Communication Engineering and submitted to the Department of Electronics
and Communication Engineering, Al-Falah School of Engineering &Technology (AFSET),
MDU Rohtak is an authentic record of my own work carried out during M. Tech under the
supervision Mr. TAZEEM AHMAD KHAN, Assistant Professor Electronics and
Communication Department,AFSET.
The matter presented in this thesis has not been submitted by me for the award of any other
degree elsewhere.
xxxxxxxx
Roll No.: MTE-12-08
This is to certify that above statement made by the candidate is correct to the best of my
knowledge.

..
Sign of Supervisor

Mr. TAZEEM AHMAD KHAN

Assistant Professor,
Department of ECE, Al-Falah University

CERTIFICATE
I hereby certify that the work which is being presented in M.Tech Dissertation Performance
Improvement of CRT-based Watermarking Technique for Digital Media Authentication
, in the partial fulfillment of requirements of award of Master of Technology in the field of
Electronics and Communication Engineering and submitted to the Department of Electronics
and Communication Engineering, Al-Falah School of Engineering & Technology (AFSET),
MDU Rohtak is an authentic record of my own work carried out during M. Tech under the
supervision Mr. TAZEEM AHMAD KHAN, Assistant Professor Electronics and
Communication Department,AFSET
The matter presented in this thesis has not been submitted by me for the award of any other
degree elsewhere.
xxxxxxxx
Roll No.: MTE-12-08
This is to certify that above statement made by the candidate is correct to the best of my
knowledge.
..
External Examiner

..
Internal Examiner

DECLARATION
I declare that this written submission represents my ideas in my own words and where others
ideas or words have been included. I have adequately cited and referenced the original sources. I
also declare that I have adhered to all principles of academic honesty and integrity and have not
misrepresented or fabricated or falsified any data in my submission. I understand that any
violation of the above will be caused for the disciplinary action by the institute and can also
evoke panel action from the sources which has thus not been properly cited or from whom proper
permission has not been taken when needed.

xxxxxxxxxxx
Roll No.: MTE-12-08

Department of Electronics and Communication Engineering

Al-Falah School of Engineering & Technology

Place: Faridabad
Date:

ACKNOWLEDGEMENT
My sincere thanks to the following people, for taking me ahead in the journey
of writing this thesis.
GOD who granted me health and knowledge to complete this workMr.
Tazeem Ahmad Khan (M.Tech thesis Co-ordinator Department of Electronics and
Communication Engineering for his unwavering support and invaluable guidance
throughout course of the work, which was the essential encouragement that
enables me to pursue my work with renewed vigor.
Dheer Singh Chhikara, my father, for helping me with the edit work.
My friends ,for always keeping my spirits up.
PLACE: FARIDABAD
DATE:

xxxxx
Roll No.: MTE-12-08

ABSTRACT
With the beginning of internet, creation and delivery of images, video and audio files, digital
repositories and libraries, web publishing in the form of digital data 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 add complexity and embedded JPEG image
information and compress the original image, it include grayscale image with logo , video and
logo and also these technique use with 2D, 3D, 4D signals. 4D signal mainly use for video
complexity.
In this thesis, we study concerning transform technique implemented in watermarking, also
Compare watermarking transform technique with help of analytical analysis using simulation
results, In this work mainly focus on Discrete Cosine Transform (DCT) and DCT with CRT
including complexity; and also analysis of compression using DCT and Wavelet transform by
selecting proper threshold method, better result for PSNR have been obtained. Here we used
simulation through using MATLAB simulator.

TABLE OF CONTENTS
CHAPTERS

PAGE NO.

CHAPTER 1
1.1 Background..1
1.2 The Digital Watermark.3
1.3 Objective of watermarking...4

CHAPTE 2
LITEATUE REVIEW
2.1 Digital Watermarking...6
2.2 Types of watermarking.6
2.2.1 Robust and Fragile watermarking..6
2.2.2 Visible and Invisible watermarks...6
2.2.3 Asymmetric and Symmetric watermarking7
2.3 Intelligent Image watermarking application..7
2.3.1 Watermarking Applications7
2.3.2 Broadcast Monitoring.7
2.3.3 Owner Identification...7
2.3.4 Medical Applications.8
2.3.5 Content Authentication..8
2.3.6 Transaction Tracking.8
2.4 Watermarking Requirements8
2.4.1 Imperceptibility..8
2.4.2 Robustness.....9
2.4.3 Capacity/Data Payload...9
2.4.4 Security.10
2.4.5 Low Error Probability...10
8

2.4.6 Real-time Detector Complexity10

2.5 Watermarking Attacks and Countermeasures.....10
2.5.1 Simple attack11
2.5.2 Detection-disabling or Geometric attacks....11
2.5.3 Cropping...11
2.5.4 Rotation and Scaling.....11
2.5.5 Ambiguity attacks.11
2.5.6 Removal attacks11
2.5.7 Protocol attack...12
2.5.8 Copy attack....12
2.6 Watermarking domains12

CHAPTER 3
WATER MARKING- AN OVERVIEW
3.1 Principle of digital watermarks....13
3.2 Dandy roll process13
3.3 Cylinder mould process14
3.4 Watermarks on postage stamps and stationery.14
3.5 Materials suitable for watermarking.15
3.6 Structure of a Digital Watermark.15

CHAPTER 4
DIGITAL WATERMARKING
4.1 The Importance of Digital Watermarks17
4.2 Evaluation of Watermarking Methods..17
4.3 Imperceptibility.17
4.4 Mean Squared Error..18
4.5 The Purposes of Digital Watermarks18
9

4.6 Overview of Copyright Law.19

4.7 Types of Digital Watermarks19
4.8 Effective Digital Watermarks...21
4.8.1 Features of a Good Watermark..21

CHAPTER 5
DESIGN ALGORITHM AND PROCESS
5.1 The Watermarking Process23
5.2 Introduction to Transformation..24
5.3 Error Metrics..25
5.4 Data Compression Transformation25
5.4 Mean Square Error (MSE).26
5.5 Peak Signal-To-Noise Ratio (PSNR).26
5.6 Discrete Cosine Transform (DCT)27
5.7 Proposed DCT Algorithm..28

CHAPTER 6
SIMULATION RESULTS AND DISCUSSION
6.1 Steps of Watermarking Done For BASE WORK and IMPROVED WORK29
6.2 Desired Characteristics of Visible Watermarks.38
6.3 Desired Characteristics of Video Watermarks...38
6.4 Flowchart39
6.4.1 DCT Domain Watermarking...39
6.5 Watermarking Using DCT.40
6.6Analysis...42

CHAPTER 7
10

CONCLUSION AND FUTURE WORK

7.1 Conclusion..43
7.2 Future Work43
REFRENCES..44

APPENDIX A
LIST OF PUBLICATION47

LIST OF FIGURES
FIGURES PAGE NO.
Figure: 1.1 Watermarking..3
Figure: 3.1 Structure of a Digital Watermark..15
Figure: 3.2 Check for watermark.16
Figure: 4.1 Types of Watermarking Techniques.19
Figure: 4.2 Schematic of Dual Watermarking.20
Figure: 5.1 Components of Typical Image/Video Transmission System24
Figure: 5.2 Image Compression using DCT28
Figure: 6.1 Source of Watermarking...29
Figure: 6.2 Leena image..30
Figure: 6.3 Logo in tiff format.30
Figure: 6.4 Generate extract logo with original message30
Figure: 6.5 Extract logo...31
Figure: 6.6 Graph and Extract logo with Leena image (Base work)...31
Figure: 6.7 Graph and Extract logo with CAM.JPG...32
Figure: 6.8Graph and Extract logo with MANDRIL_GRAY.JPG.33
Figure: 6.9 Graph and Extract logo with SCAN007 (JYOTI PIC).33
11

Figure: 6.10 Graph and Extract logo with LIVINGROOM.JPG34

Figure: 6.11 Bar Graph of Base work with different images..34
Figure: 6.12 Graph and Extract logo with Leena image (Improved work).35
Figure: 6.13 Chart of Improved Work.36
Figure: 6.14 Chart of Base work & improved work36
Figure: 6.15 Graph and Extract logo with LIVING ROOM image.37
Figure: 6.16 DCT watermarking simulation Tool...40
Figure: 6.17 Input image in DCT40
Figure: 6.18 Input image with Browse Input MSG.41
Figure: 6.19 DCT Embed Message.41
Figure: 6.20 DCT Extract Message.....42

SIMULATION PSNR TABLES

TABLES PAGE NO.
TABLE: 1
PSNR CODE OF BASE WORK...32
TABLE: 2
PSNR CODE OF IMPROVED WORK.35

ABBREVIATIONS
CRT:- Cathode Ray Tube
DCT: -Discrete Cosine Transform
MSE: - Mean Square Error

CHAPTER 1
12

INTRODUCTION
1.1 Background
In recent years, the distribution of works of art, including pictures, music, video and textual
documents, has become easier. With the widespread and increasing use of the Internet, digital
forms of these media (still images, audio, video, text) are easily accessible. This is clearly
advantageous, in that it is easier to market and sell one's works of art. However, this same
property threatens copyright protection. Digital documents are easy to copy and distribute,
allowing for pirating. There are a number of methods for protecting ownership. One of these is
known as digital watermarking.
Digital watermarking is the process of inserting a digital signal or pattern (indicative of the
owner of the content) into digital content. The signal, known as a watermark, can be used later to
identify the owner of the work, to authenticate the content, and to trace illegal copies of the
work.
Watermarks of varying degrees of obtrusiveness are added to presentation media as a guarantee
of authenticity, quality, ownership, and source.
To be effective in its purpose, a watermark should adhere to a few requirements. In particular, it
should be robust, and transparent. Robustness requires that it be able to survive any alterations or
distortions that the watermarked content may undergo, including intentional attacks to remove
the watermark, and common signal processing alterations used to make the data more efficient to
store and transmit. This is so that afterwards, the owner can still be identified. Transparency
requires a watermark to be imperceptible so that it does not affect the quality of the content, and
makes detection, and therefore removal, by pirates less possible.
The media of focus in this paper is the still image. There are a variety of image watermarking
techniques, falling into 2 main categories, depending on in which domain the watermark is
constructed: the spatial domain (producing spatial watermarks) and the frequency domain
(producing spectral watermarks). The effectiveness of a watermark is improved when the
technique exploits known properties of the human visual system. These are known as
perceptually based watermarking techniques. Within this category, the class of image-adaptive
watermarks proves most effective.
13

A digital watermark is a kind of marker covertly embedded in a noise-tolerant signal such as

audio or image data. It is typically used to identify ownership of the copyright of such signal.
"Watermarking" is the process of hiding digital information in a carrier signal; the hidden
information should, but does not need to contain a relation to the carrier signal. Digital
watermarks may be used to verify the authenticity or integrity of the carrier signal or to show the
identity of its owners. It is prominently used for tracing copyright infringements and
for banknote authentication. Like traditional watermarks, digital watermarks are only perceptible
under certain conditions, i.e. after using some algorithm, and imperceptible anytime else.If a
digital watermark distorts the carrier signal in a way that it becomes perceivable, it is of no
use. Traditional Watermarks may be applied to visible media (like images or video), whereas in
digital watermarking, the signal may be audio, pictures, video, texts or 3D models. A signal may
carry several different watermarks at the same time. Unlike metadata that is added to the carrier
signal, a digital watermark does not change the size of the carrier signal.
The needed properties of a digital watermark depend on the use case in which it is applied. For
marking media files with copyright information, a digital watermark has to be rather robust
against modifications that can be applied to the carrier signal. Instead, if integrity has to be
ensured, a fragile watermark would be applied.
The information to be embedded in a signal is called a digital watermark, although in some
contexts the phrase digital watermark means the difference between the watermarked signal and
the cover signal. The signal where the watermark is to be embedded is called the host signal. A
watermarking system is usually divided into three distinct steps, embedding, attack, and
detection. In embedding, an algorithm accepts the host and the data to be embedded, and
produces a watermarked signal.
Then the watermarked digital signal is transmitted or stored, usually transmitted to another
person. If this person makes a modification, this is called an attack. While the modification may
not be malicious, the term attack arises from copyright protection application, where third parties
may attempt to remove the digital watermark through modification. There are many possible
modifications, for example, lossy compression of the data (in which resolution is diminished),
cropping an image or video, or intentionally adding noise.
14

Detection (often called extraction) is an algorithm which is applied to the attacked signal to
attempt to extract the watermark from it. If the signal was unmodified during transmission, then
the watermark still is present and it may be extracted. In robust digital watermarking
applications, the extraction algorithm should be able to produce the watermark correctly, even if
the modifications were strong. In fragile digital watermarking, the extraction algorithm should
fail if any change is made to the signal.

Figure 1.1 watermarking

1.2 THE DIGITAL WATERMARK

Digital watermarking is a technology for embedding various types of information in digital
content. In general, information for protecting copyrights and proving the validity of data is
embedded as a watermark.
A digital watermark is a digital signal or pattern inserted into digital content. The digital content
could be a still image, an audio clip, a video clip, a text document, or some form of digital data
that the creator or owner would like to protect. The main purpose of the watermark is to identify
who the owner of the digital data is, but it can also identify the intended recipient.
Why do we need to embed such information in digital content using digital watermark
technology? The Internet boom is one of the reasons. It has become easy to connect to the
Internet from home computers and obtain or provide various information using the World Wide
Web (WWW).
All the information handled on the Internet is provided as digital content. Such digital content
can be easily copied in a way that makes the new file indistinguishable from the original. Then
the content can be reproduced in large quantities.
15

For example, if paper bank notes or stock certificates could be easily copied and used, trust in
their authenticity would greatly be reduced, resulting in a big loss. To prevent this, currencies
and stock certificates contain watermarks. These watermarks are one of the methods for
preventing counterfeit and illegal use.
Digital watermarks apply a similar method to digital content. Watermarked content can prove its
origin, thereby protecting copyright. A watermark also discourages piracy by silently and
psychologically deterring criminals from making illegal copies.
1.3 Objective of watermarking:
A number of contemporary digital watermarking techniques exist to support copy right
protection for Internet users. This thesis has discussed the importance of these watermarking
methods for understanding them and a help for new researchers in related areas. We classified
these works based on the inserted media category, the perceptivity, the robustness, the inserting
watermark type, the processing method and the necessary data for the watermark extraction.
Most of the researches handled the watermark techniques on image media. Spatial domain and
frequency domain watermark techniques are the most concern areas for embedding watermark in
to the media. In terms of processing domain, transform domain has been used rather than the
spatial domain in most of the techniques. Especially DCT-based approach has been widely used
among the transform domain approaches, however, currently we are using dct using crt with
complexity to increase the robustness of watermarking images we propose a Chinese Remainder
Theorem (CRT) based watermarking scheme that works in the Discrete Cosine Transform (DCT)
domain.
The proposed CRT based scheme is more resistant to different types of attacks, particularly to
JPEG compression; in addition, it improves the security feature of the watermarking scheme.
Experimental results have shown that the proposed scheme makes the watermark perceptually
invisible and has better robustness to common image manipulation techniques such as JPEG
compression, brightening and sharpening effects compared to the spatial domain based CRT
scheme; in addition, its computational complexity is much lower than the DCT-based scheme.In
this approach which has the multi-resolution characteristic, is getting its popularity day by day.
With the broad spreading of internet, audio and video based services such as MP3 and VOD are
also being widely used.
16

CHAPTER 2
LITERATURE REVIEW
2.1 Digital Watermarking
Digital watermarking is the practice of embedding a secret information into the original data
imperceptibly. The watermark is inserted in such a manner that it should be resistant to all types
of intentional or unintentional attacks as long as the perceptual quality of the original data is at
an acceptable height. To prove the ownership a reverse process called watermark detection is
used. In watermark detection process the embedded watermark is extracted from the
watermarked data to prove the ownership.
The process of watermarking brings some distortion to the cover media. This intentional
distortion is called marks, and all the marks are combined to form the watermark. The marks are
inserted in such a way so that they have an insignificant impact on the usefulness of the cover
media and are placed in a manner so that a malicious attacker cannot demolish these marks
without making the data considerably less useful.
In malice of the very vigorous research and the serious industrial demand, booming real world
applications have not been developed yet.
2.2 Types of watermarking
Depending on the type of application, the watermarks are classified into a number of ways. Some
types of watermarking schemes are explained below
2.2.1 Robust and Fragile watermarking
A watermark is called a robust watermark which cannot be destroyed easily. In other words
intentional or unintentional distortions such as compression, scaling, cropping etc to a
watermarked image does not have an effect on the watermark. The watermarks that can be easily
destroyed by making a slight change in the contents of the watermark are called fragile
watermarks. The absence or change in watermark indicates that data has been tempered.
2.2.2 Visible and Invisible watermarks
Watermark can be classified as visible or invisible, depends on the application, type and
problem area. Visible watermarks change the original content in such a manner that the new
digital content can easily be differentiated from the original one. Thats why these
17

watermarks are easily visible in the cover media. This kind of watermark usually identifies
the owner of the content and consists of a logo or seal of an organization. This is so that the
copyright is easily visible in the content. Although this watermark is visible but it does not
completely vague the primary image. In this case it is important to overlay the watermark in
such that to it make robust against the attacks. On the other hand Invisible watermarks or
imperceptible and can hardly be detected. Invisible watermarks are used to track the original
owner of digital media such as images, videos and documents.
2.2.3 Asymmetric and Symmetric watermarking
In asymmetric watermarking different keys are used for embedding and detecting a
watermark while symmetric watermarking uses the same set of keys for both operations
2.3 Intelligent Image watermarking application
2.3.1 Watermarking Applications
Although the major application of digital watermarking is to protect the copyright, but its
applications are not that limited. It has a wide range of applications. Some important
applications are:
2.3.2 Broadcast Monitoring
We can use digital watermarking to monitor that how many times a particular advertisement has
been broadcasted. In broadcast monitoring the system receives the broadcast. Then the system
searches for the detection of watermarks and identifies when, where and how many times this
work /advertisement is broadcasted. Television is an example where news contains watermarked
videos from broadcasters.
2.3.3 Owner Identification
In this application watermarking is used to confirm the owner. The creator of art work such
as songs, book, and painting hold the copyright as soon as it is published /printed. Textural
copyright notices have been used but they have some limitation. It can be easily removed
from a document and then be copied even by those who dont have any wrong intentions. As
the watermark can be concealed imperceptibly in to the work, it can identify the owner of
watermark better than the textual form of owner identification.

18

2.3.4 Medical Applications

Watermarking is used to identify the medical x -ray images and other records of patients
thereby reducing the chances of tampering of the medical records.
2.3.5 Content Authentication
Content authentication is another application of digital watermarking. Signature information are
embedded into the content. Later it is verified whether the content information has been
changed/modified. If a small change made to thecover, the same distortion will also be reflected
on the watermark and hence the authentication work becomes invalid. Such types of watermark
are called fragile watermark.
2.3.6 Transaction Tracking
In this application, watermark is used to recognize the procurer of digital commodities like
audios, images and videos etc. manufacturer of such products conceal a fingerprint for the unique
identification of each customer. In this way legal/illegal customers and illegal distribution can be
easily identified.
2.4 Watermarking Requirements
Watermarking techniques can be evaluated on the basis of some properties. These properties are
called watermarking requirements. For a watermarking system to be effective one should take
into account the properties of imperceptibility/Fidelity, robustness/survival against attacks, cost
of computation, bit rate of data embedding process, capacity / payload data, the speed of
integration and retrieval process, the capability of embedding and detection process[38].
Different watermarking applications have different necessities. The fundamental requirements of
a watermark are:
2.4.1 Imperceptibility
In Watermarking requirements the most important requirement is imperceptibility or fidelity.
Fidelity means that the original work and watermarked work be perceptually indistinguishable.
The imperceptibility requirement of the watermarked medium is tested by means of some
subjective measures. The watermark should be embedded in such a manner that it does not bring
any distortion to the cover media which is visible to the naked eye and make the watermarking
system of very little use. In other words the watermarking method must change the contents of
19

the cover medium such that the information of the cover medium are not modified in any
informative manner that may show the existence of a watermark. Many researchers have made
the efforts to embed the watermark using DCT and comparative study of watermark using DCT,
DCT with CRT and complexity
2.4.2 Robustness
Robustness means the capability of a watermarking technique to survive different types of
intentional or unintentional attacks. Digital contents like songs, image, videos etc go through
different types of attacks especially digital images before the retrieval of the watermark. Attack is
any kind of processing of the watermarked data to destroy the embedded watermark. Attacks can
be filtering, compression, cropping, contrast enhancement, resizing, rotation, and translation etc.
Effective watermarking techniques are able to resist/detect the watermark successfully after any
kind of possible attack. Therefore robustness is a fundamental requirement while designing a
watermarking system. To achieve better robustness one should insert the watermark in significant
areas of the cover media. Such type of watermarking technique can be applied for copyright
protection. The robustness requirement of a watermarking technique varies from operation to
operation. Even though for image watermarking, it is possible that a watermarking technique
which is robust against signal processing operations, but it may not be able to survive geometric
attacks like rotation, cropping, resizing and translation etc.
Not all the types of watermarking application need robustness e.g. fragile watermark which is
used for authentication purpose. Even a small change in the cover image is detectable in fragile
watermark technique.
2.4.3 Capacity/Data Payload
It refers to the optimum amount of information encoded in a signal. The amount of
information can be transmitted by a watermark, depends on the intended use. Different
applications require different data payloads. This capacity can range from a single or few bits
to paragraphs. Copy right application may require 1 to 4 bit to allow or not to allow copying.
In case of broad cast monitoring, might require at least 24 bits of information to identify a
commercial. Other such as intellectual property application need 60 to 70 bit to store
information about the owner i-e International standard book number (ISBN), international
standard recording code.
20

2.4.4 Security
Security means the ability of a watermarking system to withstand a watermark to aggressive
attacks. There are two types of attacks are active attacks that require the unauthorized removal
and embedding. Unauthorized removal can be either elimination or masking of water mark. This
type of attack will change the media after the attack. The second type is the passive attacks
include unauthorized detection. Normally, it could recognize the existence of a watermark. A
watermark is secure if the knowledge of the algorithms for insertion and extraction does not help
unauthorized to detect or remove the watermark.
2.4.5 Low Error Probability
Detection of watermark, although it does not exist, i.e. false-positive must be very low. Similarly
the probability of failing to detect the watermark, i.e. false-negative under no attacks or
distortion of the signal, must be very low. Typically, the watermarking techniques that are based
on statistical methods have no problem in satisfying this requirement. But for the watermarking
technique to be effective, this requirement must be established.
2.4.6 Real-time Detector Complexity
In this application of watermarking it is of prime importance that the complexity of watermark
detection and extraction must be low, especially for consumer-oriented watermarking
applications.
2.5 Watermarking Attacks and Countermeasures
An attack can be defined as the process which makes it hard for the decoder to extract the
embedded watermark. An attack may not necessarily be intentional. An unintentional attack can
just be the distortion caused by the channel.
A watermark data can be attacked through different methods. Detail discussion about the types of
attacks and levels of required robustness for a specific watermark application can be found in
[33, 39]. They also have discussed the countermeasures of different attacks. According to
Voloshynovsky watermarking attacks can be divide into four basic categories [40, 41]. These
categories are protocol attacks, removal and interference attacks, cryptographic and geometrical
attacks. Similarly Frank Hartung have divided the watermarking attacks into four main groups.
21

2.5.1 Simple attack

In simple attack an effort is made to smash up the embedded watermark by modifying the entire
cover image without extraction of the watermark. Examples of such attacks include compression,
addition of noise, and editing.
2.5.2 Detection-disabling or Geometric attacks
The attackers try to break the correlation and make it impossible to detect the watermark. The
objective of these attacks is not removal of watermark but to damage the watermark. Watermark
still exist but not detectable. Normally, they make some geometric distortions such as zooming,
rotating the object, cropping or pixel permutation, shift in spatial/temporal direction and
removal/insertion etc. The watermark exists in the cover media and can be detected or/recovered
with a superior brainpower in the detection phase.
2.5.3 Cropping
In most cases, the emphasis is on attacking asmall portionof thewatermarked object. It can be
encounter only if the watermark is distributed throughout in an image specifically those portions
which has more chances to be interested part of an attacker.
2.5.4 Rotation and Scaling
Most of watermarked objects are rotated to some degree or scaled to some factor. In majority of
cases the watermark could not be detected by the correlation based detector. It is because of
scaling and rotations that the same type of spatial patterns are no moremaintained.
2.5.5 Ambiguity attacks
These attacks try to deceive the detection process through false watermarked data. In this attack
many additional watermarks to discredit the original owner so that it is not clear that which
watermark is the original watermark.
2.5.6 Removal attacks
The objective of these attacks is to detect and then remove the embedded watermark without
harming the cover media. From watermarked data removal attack tries to remove the watermark
without cracking the security of watermarking algorithm i-e without the key used for watermark
embedding. Removal attacks try to estimate the watermark by using different watermarked
22

copies. Extract and discard the watermark. The aim and objective of these techniques are
complete removal of the watermark, this may be not possible always but most methods do
significant damage.
Examples include collusion attack, denoising, use of the conceptual cryptographic weakness of
the watermarking system, quantization, averaging, filtering, printing and scanningGeneral
counter attacks include embedding host data information andadjacent coefficient information in
watermark. Using transform domain for embedding watermark, and use of non-invertible for the
above mentioned attacks could be other types of attacks.
Other Common types of attacks are:
2.5.7 Protocol attack
Protocol attacks intend to attack the whole model of the watermarking application. Copy
attack is one example of protocol attack. The main idea behind the copy attack is to create
ambiguity in terms of the real ownership of data.
In this attack the embedded watermark is copied from one image to another image without
knowing the key used for embedding a watermark.
2.5.8 Copy attack
It involves finding watermark pattern and then copy the same watermark to new host data. In
other words a valid watermark is embedded into wrong host data e.g. in case of least significance
bit, patterns can be copied to new host data.
This type of attack can be encounter by making the watermark depend on host image.
2.6 Watermarking domains
According to domain watermarking techniques can be divided into two domains, spatial
domain and frequency domain watermarking. The simpler of the two to conceal a watermark
is the spatial domain. Spatial domain techniques work with changing the values of the pixels
directly according to the watermark signal pattern. This kind of watermarking is simple and
less complex as no transform is used, but are not robust to attacks like compression and
image manipulations such as cropping, re-sampling or format conversion.

23

CHAPTER 3
WATER MARKING-AN OVERVIEW
3.1 Principle of Digital Watermarks
A watermark on a bank note has a different transparency than the rest of the note when a light is
shined on it. However, this method is useless in the digital world.
Currently there are various techniques for embedding digital watermarks. Basically, they all
digitally write desired information directly onto images or audio data in such a manner that the
images or audio data are not damaged. Embedding a watermark should not result in a significant
increase or reduction in the original data.
Digital watermarks are added to images or audio data in such a way that they are invisible or
inaudible unidentifiable by human eye or ear. Furthermore, they can be embedded in content
with a variety of file formats. Digital watermarking is the content protection method for the
multimedia era.
3.2 Dandy roll process
A watermark is made by impressing a water-coated metal stamp or dandy roll onto the paper
during manufacturing. While watermarks were first introduced in Fabriano, Italy, in 1282, the
invention of the dandy roll in 1826 by John Marshall revolutionized the watermark process and
made it easier for producers to watermark their paper.
The dandy roll is a light roller covered by material similar to window screen that is embossed
with a pattern. Faint lines are made by laid wires that run parallel to the axis of the dandy roll,
and the bold lines are made by chain wires that run around the circumference to secure the laid
wires to the roll from the outside. Because the chain wires are located on the outside of the laid
wires, they have a greater influence on the impression in the pulp, hence their bolder appearance
than the laid wire lines.

24

This embossing is transferred to the pulp fibres, compressing and reducing their thickness in that
area. Because the patterned portion of the page is thinner, it transmits more light through and
therefore has a lighter appearance than the surrounding paper. If these lines are distinct and
parallel, and/or there is a watermark, then the paper is termed laid paper. If the lines appear as a
mesh or are indiscernible, and/or there is no watermark, then it is called wove paper. This method
is called line drawing watermarks.
3.3 Cylinder mould process
Another type of watermark is called the cylinder mould watermark. A shaded watermark, first
used in 1848, incorporates tonal depth and creates a greyscale image. Instead of using a wire
covering for the dandy roll, the shaded watermark is created by areas of relief on the roll's own
surface. Once dry, the paper may then be rolled again to produce a watermark of even thickness
but with varying density. The resulting watermark is generally much clearer and more detailed
than those made by the Dandy Roll process, and as such Cylinder Mould Watermark Paper is the
preferred type of watermarked paper for banknotes, passports, motor vehicle titles, and other
documents where it is an important anti-counterfeiting measure.
3.4 Watermarks on postage stamps and stationery
In philately, the watermark is a key feature of a stamp, and often constitutes the difference
between a common and a rare stamp. Collectors who encounter two otherwise identical stamps
with different watermarks consider each stamp to be a separate identifiable issue. The "classic"
stamp watermark is a small crown or other national symbol, appearing either once on each stamp
or a continuous pattern. Watermarks were nearly universal on stamps in the 19th and early 20th
centuries, but generally fell out of use and are not commonly used on modern U.S. issues, but
some countries continue to use them.
Some types of embossing, such as that used to make the "cross on oval" design on early stamps
of Switzerland, resemble a watermark in that the paper is thinner, but can be distinguished by
having sharper edges than is usual for a normal watermark. Stamp paper watermarks also show
various designs, letters, numbers and pictorial elements.

25

The process of bringing out the stamp watermark is fairly simple. Sometimes a watermark in
stamp paper can be seen just by looking at the unprinted back side of a stamp. More often, the
collector must use a few basic items to get a good look at the watermark. For example,
watermark fluid may be applied to the back of a stamp to temporarily reveal the watermark.Even
using the simple watermarking method described, it can be difficult to distinguish some
watermarks. Watermarks on stamps printed in yellow and orange can be particularly difficult to
see. A few mechanical devices are also are used by collectors to detect watermarks on stamps
such as the Morley-Bright watermark detector and the more expensive Safe Signoscope. Such
devices can be very useful for they can be used without the application of watermark fluid and
also allow the collector to look at the watermark for a longer period of time to more easily detect
the watermark.
3.5 Materials Suitable For Watermarking
Digital watermarking is applicable to any type of digital content, including still images,
animation, and audio data. It is easy to embed watermarks in material that has a comparatively
high redundancy level ("wasted"), such as color still images, animation, and audio data; however,
it is difficult to embed watermarks in material with a low redundancy level, such as black-andwhite still images.
To solve this problem, we developed a technique for embedding digital watermarks in black-andwhite still images and a software application that can effectively embed and detect digital
watermarks.
3.6 Structure of a Digital Watermark:
The structure of a digital watermark is shown in the following figures.

Figure: 3.1 Structure of a Digital Watermark

26

The material that contains a digital watermark is called a carrier. A digital watermark is not
provided as a separate file or a link. It is information that is directly embedded in the carrier file.
Therefore, simply viewing the carrier image containing it cannot identify the digital watermark.
Special software is needed to embed and detect such digital watermarks. Kowa 's SteganoSign is
one of these software packages.
Both images and audio data can carry watermarks. A digital watermark can be detected as shown
in the following illustration.

Figure: 3.2 Check for watermark

27

CHAPTER 4
DIGITAL WATERMARKING
4.1 The Importance of Digital Watermarks
The Internet has provided worldwide publishing opportunities to creators of various works,
including writers, photographers, musicians and artists. However, these same opportunities
provide ease of access to these works, which has resulted in pirating. It is easy to duplicate audio
and visual files, and is therefore probable that duplication on the Internet occurs without the
rightful owners' permission.
An example of an area where copyright protection needs to be enforced is in the on-line music
industry. The Recording Industry Association of America (RIAA) says that the value of illegal
copies of music that are distributed over the Internet could reach $2 billion a year.
Digital watermarking is being recognized as a way for improving this situation. RIAA reports
that "record labels see watermarking as a crucial piece of the copy protection system, whether
their music is released over the Internet or on DVD-Audio". They are of the opinion that any
encryption system can be broken, sooner or later, and that digital watermarking is needed to
indicate who the culprit is.
Another scenario in which the enforcement of copyright is needed is in newsgathering. When
digital cameras are used to snapshot an event, the images must be watermarked as they are
captured. This is so that later, image's origin and content can be verified. This suggests that there
are many applications that could require image watermarking, including Internet imaging, digital
libraries, digital cameras, medical imaging, image and video databases, surveillance imaging,
video-on-demand systems, and satellite-delivered video.
4.2 Evaluation of Watermarking Methods

28

Several Functions are used to qualify the watermarking algorithm, examining tests on the
resulted watermarked image.
4.3 Imperceptibility
The imperceptibility of the watermark is tested through comparing the watermarked image with
the original one. Several tests are usually used in this regard.
4.4 Mean Squared Error
Mean Squared Error (MSE) is one of the earliest tests that were performed to test if two
Pictures are similar. A function could be simply written according to equation.
function out = MSE (pic1, pic2)
e=0;
[m,n]=size(pic1);
for i=1:m
for j=1:n
e = e + double((pic1(i,j)-pic2(i,j))^2);
end
end
out = e / (m*n);
end
PSNR
Pick Signal to Noise Ratio (PSNR) is a better test since it takes the signal strength into
consideration (not only the error). Equation describes how this value is obtained.
PSNR = 10.log10 ( MAX2/MSE)
function out=PSNR(pic1, pic2)
e=MSE(pic1, pic2);
m=max(max(pic1));
out=10*log(double(m)^2/e);
end
4.5 The Purposes of Digital Watermarks
Watermarks are a way of dealing with the problems mentioned above by providing a number of services:
1. They aim to mark digital data permanently and unalterably, so that the source as well as the intended
recipient of the digital work is known. Copyright owners can incorporate identifying information
into their work. That is, watermarks are used in the protection of ownership. The presence of a
watermark in a work suspected of having been copied can prove that it has been copied.
2. By indicating the owner of the work, they demonstrate the quality and assure the authenticity of the
work.
3. With a tracking service, owners are able to find illegal copies of their work on the Internet. In
addition, because each purchaser of the data has a unique watermark embedded in his/her copy; any
unauthorized copies that s/he has distributed can be traced back to him/her.
29

4. Watermarks can be used to identify any changes that have been made to the watermarked data.
5. Some more recent techniques are able to correct the alteration as well.

4.6 Overview of Copyright Law

"In essence, copyright is the right of an author to control the reproduction of his intellectual creation.
When a person reproduces a work that has been copyrighted, without the permission of the owner, s/he
may be held liable for copyright infringement. To prove copyright infringement, a copyright owner needs
to prove 2 things.
1. S/he owns the copyright in the work, and
2. The other party copied the work (usually determined by establishing that the other party had access
to the copyrighted work, and that the copy is "substantially similar" to the original).
In cases where it cannot be said that the owner's work and the possible illegal copy are identical, the
existence of a digital watermark could prove guilt.
The damages charge can be higher if it can be proven that the party's conduct constitutes willful
infringement; that is, s/he copied the work even though s/he knew that it was copyrighted (for example,
copying even after having discovered a watermark in the work).
4.7 Types of Digital Watermarks
Watermarks and watermarking techniques can be divided into various categories in various ways. The
watermarks can be applied in spatial domain. An alternative to spatial domain watermarking is frequency
domain watermarking. It has been pointed out that the frequency domain methods are more robust than
the spatial domain techniques. Different types of watermarks are shown in the figure below:-

30

Figure: 4.1 Types of Watermarking Techniques

Watermarking techniques can be divided into four categories according to the type of document to be
watermarked as follows.

Image Watermarking

Video Watermarking

Audio Watermarking

Text Watermarking

According to the human perception, the digital watermarks can be divide into three different types as
follows.

Visible watermark

Invisible-Robust watermark

Invisible-Fragile watermark

Dual watermark

Visible watermark is a secondary translucent overlaid into the primary image. The watermark appears
visible to a casual viewer on a careful inspection. The invisible-robust watermark is embed in such a way
that an alternation made to the pixel value is perceptually not noticed and it can be recovered only with
appropriate decoding mechanism. The invisible-fragile watermark is embedded in such a way that any
31

manipulation or modification of the image would alter or destroy the watermark. Dual watermark is a
combination of a visible and an invisible watermark .In this type of watermark an invisible watermark is
used as a backup for the visible watermark as clear from the following diagram.

Figure: 4.2 Schematic of Dual Watermarking

An invisible robust private watermarking scheme requires the original or reference image for watermark
detection; whereas the public watermarks do not. The class of invisible robust watermarking schemes that
can be attacked by creating a counterfeit original is called invertible watermarking scheme from
application point of view digital watermark could be as below.

Source based or

Destination based.

Source-based watermark are desirable for ownership identification or authentication where a unique
watermark identifying the owner is introduced to all the copies of a particular image being
distributed.Source-based watermark could be used for authentication and to determine whether a received
image or other electronic data has been tampered with. The watermark could also be destination based
where each distributed copy gets a unique watermark identifying the particular buyer. The destination
-based watermark could be used to trace the buyer in the case of illegal reselling.

4.8 Effective Digital Watermarks

4.8.1 Features of a Good Watermark
The following are features of a good watermark:
1. It should be difficult or impossible to remove a digital watermark without noticeably degrading the
watermarked content. This is to ensure that the copyright information cannot be removed.
2. The watermark should be robust. This means that it should remain in the content after various types
of manipulations, both intentional (known as attacks on the watermark) and unintentional
(alterations that the digital data item would undergo regardless of whether it contains a watermark or
not). These are described below. If the watermark is a fragile watermark, however, it should not

32

remain in the digital data after attacks on it, but should be able to survive certain other alterations (as
in the case of images, where it should be able to survive the common image alteration of cropping).
3. The watermark should be perceptually invisible, or transparent. That is, it should be imperceptible (if
it is of the invisible type). Embedding the watermark signal in the digital data produces alterations,
and these should not degrade the perceived quality of the data. Larger alterations are more robust,
and are easier to detect with certainty, but result in greater degradation of the data.
4. It should be easy for the owner or a proper authority to readily detect the watermark. "Such
decodability without requiring the original, unwatermarked [digital document or] image would be
necessary for efficient recovery of property and subsequent prosecution".
5. Hybrid watermarking refers to the embedding of a number of different watermarks in the same
digital carrier signal. Hybrid watermarking allows intellectual property rights (IPR) protection, data
authentication and data item tracing all in one go.
6. Watermark key: it is beneficial to have a key associated with each watermark that can be used in the
production, embedding, and detection of the watermark. It should be a private key, because then if
the algorithms to produce, embed and detect the watermark are publicly known, without the key, it is
difficult to know what the watermark signal is.

The key indicates the owner of the data.It is of interest to identify the properties of a digital data item
(the carrier signal) that assist in watermarking:
1. It should have a high level of redundancy. This is so that it can carry a more robust watermark
without the watermark being noticed. (A more robust watermark usually requires a larger number of
alterations to the carrier signal).
2. It must tolerate at least small, well-defined modifications without changing its semantics.

33

CHAPTER 5
Design Algorithm and Process
5.1The Watermarking Process:
The watermarking process comprises of the following stages:
Embedding stage
Extraction phase
Distribution stage
Decision stage
Embedding stage: In this stage, the image to be watermarked is preprocessed to prime it for
embedding. This involves converting the image to the desired transform. This includes the
discrete cosine transform (DCT), the discrete Fourier transform (DFT) and the wavelet domains.
The watermark to be embedded may be a binary image, a bit stream or a pseudo-random number
that adheres to, say, a Gaussian distribution. The watermark is then appended to the desired
coefficients (low frequency or intermediate frequency) of the transform, as recommended by
Human Visual System (HVS) research.
34

Distribution stage: The watermarked image obtained above is then distributed through digital
channels (on an Internet site). In the process, this may have undergone one of several mappings,
such as compression, image manipulations that downsize the image, enhancements such as
rotation, to name a few. Peter Meerwald refers to the above as coincidental attack. In addition,
malicious attacks also are possible in this stage to battle with the watermark.
Extraction stage: In this stage, an attempt is made to regain the watermark or signature from the
distributed watermarked image. This stage may need a private key or a shared public key, in
combination with the original image, or just the watermarked image.
Decision stage: In this stage, the extracted watermark is compared with the original watermark
to test for any discrepancies that might have set in during distribution. A common way of doing
this is by computing the Hamming distance.
HD = (Wmod . W)
||Wmod||.||W||where both the numerator and denominator are dot products.

5.2 Introduction to Transformation:

Transform coding constitutes an integral component of contemporary image/video processing
applications. Transform coding relies on the premise that pixels in an image exhibit a certain
level of correlation with their neighboring pixels. Similarly in a video transmission system,
adjacent pixels in consecutive frames show very high correlation. Consequently, these
correlations can be exploited to predict the value of a pixel from its respective neighbors. A
transformation is, therefore, defined to map this spatial (correlated) data into transformed
(uncorrelated) coefficients. Clearly, the transformation should utilize the fact that the information
content of an individual pixel is relatively small i.e., to a large extent visual contribution of a
pixel can be predicted using its neighbors. A typical image/video transmission system is outlined
in Figure 5.1. The objective of the source encoder is to exploit the redundancies in image data to
provide compression. In other words, the source encoder reduces the entropy, which in our case
means decrease in the average number of bits required to represent the image. On the contrary,
the channel encoder adds redundancy to the output of the source encoder in order to enhance the
reliability of the transmission. In the source encoder exploits some redundancy in the image data
in order to achieve better compression. The transformation sub-block de correlates the image
35

data thereby reducing inter pixel redundancy. The transformation is a lossless operation,
therefore, the inverse transformation renders a perfect reconstruction of the original image.
The quantize sub-block utilizes the fact that the human eye is unable to perceive some visual
information in an image. Such information is deemed redundant and can be discarded without
introducing noticeable visual artifacts.

Figure: 5.1 Components of Typical Image/Video Transmission System

Such redundancy is referred to as psycho visual redundancy. This idea can be extended to low
bit-rate receivers which, due to their stringent bandwidth requirements, might sacrifice visual
quality in order to achieve bandwidth efficiency. This concept is the basis for rate distortion
theory, that is, receivers might tolerate some visual distortion in exchange for bandwidth
conservation. The entropy encoder employs its knowledge of the transformation and quantization
processes to reduce the output number of bits required to represent each symbol at the quantize.
Discrete Cosine Transform (DCT) has emerged as the de-facto image transformation in most
visual systems. DCT has been widely deployed by modern video coding standards, for example,
MPEG, JVT etc.
5.3 Error Metrics
Two of the error metrics used to compare the various image compression techniques are the
Mean Square Error (MSE) and the Peak Signal to Noise Ratio (PSNR) to achieve desirable
compression ratios. The MSE is the cumulative squared error between the compressed and the

36

original image, whereas PSNR is a measure of the peak error. The mathematical formulae for the
two are :
MSE =

_(1)

PSNR = 20 * log10 (255 / sqrt(MSE)_(2)

where I(x,y) is the original image, I'(x,y) is the approximated version (which is actually the
decompressed image) and M,N are the dimensions of the images. A lower value for MSE means
lesser error, and as seen from the inverse relation between the MSE and PSNR, this translates to
a high value of PSNR. Logically, a higher value of PSNR is good because it means that the ratio
of Signal to Noise is higher. Here, the 'signal' is the original image, and the 'noise' is the error in
reconstruction. So, if you find a compression scheme having a lower MSE (and a high PSNR),
you can recognise that it is a better one.

5.4 Data Compression Transformation:

Data compression ratio, also known as compression power, is used to quantify the reduction in
data-representation size produced by data compression. The data compression ratio is analogous
to the physical compression ratio it is used to measure physicalcompression of substances, and is
defined in the same way, as the ratio between the uncompressed size and the compressed size.
Thus a representation that compresses a 10MB file to 2MB has a compression ratio of 10/2 = 5,
often notated as an explicit ratio, 5:1 (read "five to one"), or as an implicit ratio, 5X. Note that
this formulation applies equally for compression, where the uncompressed size is that of the
original. Sometimes the space savings is given instead, which is defined as the reduction in size
relative to the uncompressed size. Thus a representation that compresses 10MB file to 2MB
would yield a space savings of 1 - 2/10 = 0.8, often notated as a percentage, 80%. For signals of
indefinite size, such as streaming audio and video, the compression ratio is defined in terms of
uncompressed and compressed data rates instead of data sizes.
When the uncompressed data rate is known, the compression ratio can be inferred from the
compressed data rate.
37

5.4 Mean Square Error (MSE):

Mean square error is a criterion for an estimator: the choice is the one that minimizes the sum of
squared errors due to bias and due to variance. The average of the square of the difference
between the desired response and the actual system output. As a loss function, MSE is called
squared error loss. MSE measures the average of the square of the "error. The MSE is the second
moment (about the origin) of the error, and thus incorporates both the variance of the estimator
and its bias. For an unbiased estimator, the MSE is the variance. In an analogy to standard
deviation, taking the square root of MSE yields the root mean squared error or RMSE. Which
has the same units as the quantity being estimated for an unbiased estimator, the RMSE is the
square root of the variance, known as the standard error.

Where m x n is the image size and I(i,j) is the input image and K(i,j) is the retrieved image.
5.5 Peak Signal-To-Noise Ratio (PSNR):
It is the ratio between the maximum possible power of a signal and the power of corrupting noise
.Because many signals have a very wide dynamic range, PSNR is usually expressed in terms of
the logarithmic decibel scale. The PSNR is most commonly used as a measure of quality of
reconstruction in image compression etc. It is most easily defined via the mean squared error
(MSE) which for two mn monochrome images I and K where one of the images is considered
noisy.

Here, MAXi is the maximum possible pixel value of the image. When the pixels are represented
using 8 bits per sample, this is 255. More generally, when samples are represented using linear
PCM with B bits per sample, MAXI is 2B-1.Typical values for the PSNR in Lossy image and
38

video compression are between 30 and 50 dB, where higher is better. PSNR is computed by
measuring the pixel difference between the original image and compressed image. Values for
PSNR range between infinity for identical images, to 0 for images that have no commonality.
PSNR decreases as the compression ratio increases for an image.
5.6 Discrete Cosine Transform (DCT):
The discrete cosine transform (DCT) is a technique for converting a signal into elementary
frequency components. Like other transforms, the Discrete Cosine Transform (DCT) attempts to
de correlate the image data. After de correlation each transform coefficient can be encoded
independently without losing compression efficiency.

Figure: 5.2 Image Compression using DCT

5.7 Proposed DCT Algorithm:

The following is a general overview of the JPEG process.

The image is broken into 8x8 blocks of pixels.

Working from left to right, top to bottom, the DCT is applied to each block.

Each block is compressed through quantization.

The array of compressed blocks that constitute the image is stored in a drastically reduced
amount of space.

When desired, the image is reconstructed through decompression, a process that uses the
inverse Discrete Cosine Transform (IDCT).

39

CHAPTER 6
SIMULATION RESULTS AND DISCUSSION
In this chapter implemented watermarking techniques and analytical analysis for simulation
results, which is simulated using MATLAB simulator. Here showing code which is for Base
work and Improved Work, 2D & 3D signal & image considered under Base Work it may be Gray
scale or color image , improved work mainly use for 4D signal but if we want to do DCT with
CRT including complexity then improved work considered 2D & 3D signal.
6.1 Steps of Watermarking done for BASE WORK and IMPROVED WORK.
1. Run the code in MATLAB software version greater than 2010 it may be 2012b or 2013b.
2. When run the code it ask to select the signal ( which is 2D, 3D, 4D) shows in the figure 6.1

Figure: 6.1 Source of Watermarking

40

3. After selection of signal select Base Work or Improved Work which is depend on which type
of information user want to receive from sender.
4. If we talking about Base Work then we need to select Base Work from method Selection, it
offer to select the image in gray scale.
5. Here I select Leena image (figure 6.2) in grayscale then it ask for logo (figure 6.3) which is
hidden information.

Figure: 6.2 Leena image

Figure: 6.3 logo in tiff format

1. After selection logo it start computing complexity
2. During computing complexity it generate the original image and result image with logo
which is actually watermark information shows in figure 6.4.

Figure: 6.4 Generate extract logo with original message

41

3. After computing it extract the logo image shows in figure 6.5

Figure: 6.5 Extract logo

4. During extracting the logo it generate the PSNR code.
5. Now same Leena image take further more 4 images in grayscale and generate the PSNR
code and compare them which is shows the graph (figure 6.6) with Leena image

42

Figure: 6.6Graph and Extract logo with Leena image (Base work)
PSNR code generate with different grayscale images in Base work are following:IMAGE NAME
Bray.jpg
CAM.jpg
Mandril_gray.jpg
Scan007.jpg
Living room.jpg

PSNR
LOGO PSNR
BER
4.35E+1
inf
1.95+03
4.37+01
255
1
4.30E+01
255
1
4.66E+01
255
1
4.53+01
inf
3.71+02
TABLE: 1 PSNR CODE OF BASE WORK

NC
8.92+01
0
0
0
7.40E+01

Note: Here bgray.jpg (Leena image)

43

Figure: 6.7Graph and Extract logo with CAM.JPG

Figure: 6.8Graph and Extract logo with MANDRIL_GRAY.JPG

44

Figure: 6.9 Graph and Extract logo with SCAN007

Figure: 6.10Graph and Extract logo with LIVINGROOM.JPG

45

Now showing all PSNR code of Base Work with their images here we understood the
comparison which is most probably same in Chart Title (figure 6.11).

Figure: 6.11 Bar Graph of Base work with different images

Similarly we follow all above steps for Improved work (DCT with CRT including complexity)
and found graph shows in figure 6.12 Difference in Improved Work is it embedding
watermarking then computing complexity.

46

Figure: 6.12 Graph and Extract logo with Leena image (Improved work)
PSNR code generate with different grayscale images in Improved work are following:TABLE: 2 PSNR CODE OF IMPROVED WORK
IMAGE NAME
Bray.jpg
CAM.jpg
Mandril_gray.jpg
Scan007.jpg
living room.jpg

PSNR
4.35E+1
4.37+01
4.30E+01
4.66E+01
4.53+01

LOGO
PSNR
inf
255
255
255
inf

BER
1.95+03
1
1
1
3.71+02

NC
8.92+01
0
0
0
7.40E+01

Chart of Improved Work

47

Figure: 6.13 Chart of Improved Work

Figure 6.14 shows comparison of both PSNR code of Base Work & Improved Work.

Figure: 6.14 Chart of Base work &improved work

In above graph each image have own line of graph in different colors.
48

Watermarking with video file in which use 4D signal showing the graph and code in figure 6.15.

Figure: 6.15 Graph and Extract logo with LIVING ROOM image
Information about video watermarking:Height

- 512

Width

- 512

Duration - 6.833333e+00
Frames

- 205

Frame Rate - 30
Video Result is written in result.avi
Data is embedded in frame no. 186
PSNR = 4.413186e+01

49

By observing all three watermarking DCT with CRT and including complexity found in between
not much difference after extracting same logo with same bits. So without much difference
transmission of information with image is create very high security of any data.
6.2Desired Characteristics of Visible Watermarks

A visible watermark should be obvious in both color and monochrome images.

The watermark should spread in a large or important area of the image in order to prevent its

deletion by clipping.
The watermark should be visible yet must not significantly obscure the image details

beneath it.
The watermark must be difficult to remove. Rather, removing a watermark should be more

costly and labor intensive than purchasing the image from the owner.
The watermark should be applied automatically with little human intervention and labor.

6.3 Desired Characteristics of Video Watermarks

The presence of watermark should not cause any visible or audible effects on the playback

of the video.
The watermark should not affect the compressibility of the digital content.
The watermark should be detected with high degree of reliability. The probability of false

detection should be extremely small.

The watermark should be robust to various intentional and unintentional attacks
The detection algorithm should be implemented in circuitry with small extra cost.

6.4 Flowchart : Bloc diagram shown below Flow chart of Image watermark

50

6.4.1

DCT

Domain

Watermarking
Middle Frequency Band

6.5 WATERMARKING USING DCT

51

For DCT domain code is different after running that code it open the tab of watermarking using
DCT shows in Figure 6.16

Figure: 6.16 DCT watermarking simulation Tool

1. Now select input image that is shows in figure as original image

Figure: 6.17 Input image in DCT

2. Select message image shows in figure 6.18

52

Figure: 6.18 Input image with Browse Input

MSG
3. Then Embed message

Figure: 6.19 DCT Embed Message

4. Finally extract the message

53

Figure: 6.20DCT Extract Message

Only with DCT found PSNR code is 41.416.

6.6 Analysis:
During simulation of CRT with DCT and only DCT watermarking with selecting signal (2D, 3D,
4D) based on Base work and Improved Work found only DCT is more secure and fast
watermarking techniques but CRT with DCT watermarking process have advance techniques in
which we secure any type of message with different format of information (including text, gray
images, colored images, those are considered by selecting signal format, even we can secure our
video information). Processing of CRT watermarking is much faster than CRT with DCT
watermarking but it doesnt contain video information as a security purpose. CRT with DCT
watermarking is most recommended process to enhance and improve the performance of CRT
based watermarking techniques for Digital Media Techniques.

CHAPTER 7
54

CONCLUSION AND FUTURE WORK

7.1 Conclusion
In this thesis, we study watermarking techniques and issues of watermarking technique mainly
security. In this work analytical analysis with the help of Matlab software simulation results, and
also compare watermarking based on CRT with DCT & for watermarking of images in the DCT
domain for authentication and copyright protection. The use of CRT provides advantage in terms
of improved security and low computational complexity. In this comparative study of CRT and
DCT domain watermarking and understood the difference via steps of work and their plotting
graph.
7.2 Future Work
For the future work we can increase the robustness and security of watermarking images using
Discrete Walvet transform in walvet domain.

REFRENCES
[1] W. Bender, D. Gruhl, N. Morimoto, A. Lu, Techniques for data hiding, IBM Systems J. 35
(3&4)

(1996) 313336.

[2] I.J. Cox, J. Kilian, F.T. Leighton, T. Shamoon, Secure spread spectrum watermarking for
multimedia,

IEEE Trans. Image Process. 6 (12) (Dec. 1997)16731687.

[3] I.J. Cox, M.L. Miller, A.L. Mckellips, Watermarking as communication with side
information, Proc. IEEE 87 (7) (Jul. 1999) 11271141.
[4] Electronic For You
[5] www.digitalwatermarking.com
[6] Cox, J.; Miller, M. L.; Bloom, J. A.; Fridrich J. & Kalker T. (2008). Digital Watermarking and
Steganography, Morgan Kaufmann Pub., Elsevier Inc.
[7] C. C. Chang, P. Tsai and C. C. Lin, SVD-based digital image watermarking image scheme,
Pattern Recognition Letters, vol.26, pp. 1577-1586, 2005.

55

[8] A. A. Mohammad, A. Alhaj and S. Shaltaf, An improved SVD-based watermarking scheme

for protecting rightful ownership, Signal Processing, vol. 88, pp. 2158-2180, 2008.
[9] K. L. Chung, W. N. Yang, Y. H. Huang, S. T. Wu, and Y .C. Hsu, On SVD-based
watermarking algorithm, Applied Mathematics & Computation, vol. 188, pp. 54-57, 2007.
[10] Hsiang-Cheh Huang, C.-M.C.a.J.-S.P., The optimized copyright protection system with
genetic watermarking. A FUSION OF FOUNDATIONS, METHODOLOGIES AND
APPLICATIONS, (2008).
[11] P. S. Murty, K. S. Dileep and P. R. Kumar, A Semi Blind Self Reference Image
Watermarking in Discrete Cosine Transform using Singular Value Decomposition, International
Journal of Computer
Applications, vol. 62, issue 13, January 2013, pp. 29-36.
[12] S. K. Prajapati, A. Naik and A. Yadav, Robust Digital Watermarking using DWT-DCTSVD, International Journal of Engineering Research and Applications Vol. 2, Issue 3, May-Jun
2012, pp.991-997.
[13] Dr. M. A. Dorairangaswamy, A Robust Blind Image Watermarking Scheme in Spatial
Domain for
Copyright Protection, International Journal of Engineering and Technology Vol. 1, No.3,
August,
2009.
[14] A. Al-Haj, Combined DWT-DCT Digital Image Watermarking, Journal of Computer
Science3 (9): 740-746, 2007.
[15] M. Calagna, H. Guo, L. V. Mancini and S. Jajodia, A Robust Watermarking System Based
on SVD Compression, Proceedings of ACM Symposium on Applied Computing
(SAC2006),Dijon, France, pp. 1341-1347, 2006.
[16] F. Cayre, C. Fontaine and T. Furon, Watermarking security: theory and practice, Signal
Processing, IEEE Transactions on, vol. 53, no. 10, pp. 39763987, Oct. 2005.

56

[17] P. Taoaand and A. M. Eskicioglu, A robust multiple watermarking scheme in the Discrete
Wavelet Transform domain, Internet Multimedia Management Systems Proceedings of the
SPIE,Volume 5601, pp. 133-144 (2004).
[18] F. Huang and ZH. Guan, A hybrid SVD-DCT
watermarking method based on LPSNR, Pattern Recognition Letters, vol.25, pp.1769 1775,
2004.
[19] Y. Wang, J. F. Doherty and R. E. Van Dyck, A Wavelet-Based Watermarking Algorithm for
Ownership Verification of Digital Images, IEEE Transactions on Image Processing, Volume 11,
No.2, February 2002, pp. 77-88. [10] R. Liu and T. Tan, A SVD-Based Watermarking Scheme
for Protecting Rightful Ownership, IEEE Transactions on Multimedia, 4(1), March 2002,
pp.121-128.
[20] S. D. Lin and C. F. Chen, A Robust DCT-Based Watermarking for Copyright
Protection,IEEE
Transactions on Consumer Electronics, Volume 46, No. 3, August 2000, pp. 415-421.
[21] N. Nikolaidis and I.Pitas,Robust image watermarking in the spatial domain, Signal
Processing Vo1.66, pp.385-403, 1998.
[22] S. Mukherjee and A. K. Pal, A DCT-SVD based Robust Watermarking Scheme for
Grayscale Image, International Conference on Advances in Computing, Communications and
Informatics (ICACCI-2012).
[23] N. H. Divecha, N. N. Jani, Image Watermarking Algorithm using Dct, Dwt and Svd, IJCA
Proceedings on National Conference on Innovative Paradigms in Engineering and Technology
(NCIPET 2012), ncipet Number 10.
[24] Z. Zhou, B. Tang and X. Liu, A Block SVD Based Image Watermarking Method,
Proceedings of the 6th World Congress on Intelligent Control and Automation, June 21 - 23,
2006, Dalian, China.
57

[25] E. Ganic and A. M. Eskicioglu, Robust DWT-SVD Domain Image Watermarking:

Embedding Data in All Frequencies, 13thEuropean Signal Processing Conference (EUSIPCO
2005), Antalya, Turkey, September 4-8, 2005.

Appendix A

List of Publications
List of Publications
1. xxxxxx, Tazeem Ahmad Khan, Performance Optimized DCT Domain Watermarking
Technique with JPEG", International Journal of Innovative Technology and Exploring
Engineering (IJITEE), ISSN: 2278-375, Volume-4, Issue-2, July 2014, pp 20-24.
2. xxxxxxx, Tazeem Ahmad Khan, Performance Improvement of CRT-based Watermarking
Technique for Digital Media Authentication, VSRD International Journal of Electrical,
Electronics and Communication Engineering (VSRDIJEECE), e-ISSN: 2231-3346,
p-ISSN: 2319-2232, Volume- , Issue- , July 2014, pp
.

58