Chapter 1

Introduction and Objective

1.1 Introduction

A watermark is a symbol which represents origin, ownership and copy control etc. A
watermark is logo in an image or video that may be a combination of lightness or darkness.
Watermark can be seen on passports, postage stamps, bank notes, government documents
etc. The watermark can be embedded either in image or in video the process of embedding
watermark in video is called video watermarking and the process of embedding watermark
in an image is known as video watermarking. Watermark can be embedded and extracted as
per requirement. The difference between video watermarking and the image watermarking
is the availability of the data. This proper availability of data in video watermarking make
this technique more reliable and redundant because information hide in watermark is more
secure and qualitative in nature. Digital watermark can be defined as hiding the information
in the digital form which may be digitized music, video, picture or any other file. In this the
carrier signal hides the information. The hidden information should contain a relation to the
carrier signal but it is not compulsory. If it contains a relation with the carrier signal it helps
to check the authenticity of the carrier signal.

Digital watermarks are pieces of information added to digital data (audio, video, or still
images) that can be detected or extracted later to make an assertion about the data. This
information can be textual data about the author, its copyright, etc; or it can be an image
itself. The information to be hidden is embedded by manipulating the contents of the digital
data, allowing someone to identify the original owner, or in the case of illicit duplication of
purchased material, the buyer involved. These digital watermarks remain intact under
transmission / transformation, allowing us to protect our ownership rights in digital form.

Watermarks may be visible, in which case their use is two-fold to discourage unauthorized
usage, and also act as an advertisement. However, the focus is on invisible watermarks, as
they do not cause any degradation in the aesthetic quality or in the usefulness of the data.
They can be detected and extracted later to facilitate a claim of ownership, yielding
relevant information as well. Watermarks may also be classified as robust or fragile. Robust
watermarks are those which are difficult to remove from the object in which they are
embedded, despite various attacks they might be subjected to, discussed later. Fragile
1
watermarks are those that are easily destroyed by any attempt to tamper with them.
Absence of a watermark in a previously watermarked document would lead to the
conclusion that the data has been tampered with.

For a digital watermark to be effective for ownership assertion, it must be robust,

recoverable from a document, provide the original information embedded reliably, be non-
intrusive, and also removable by authorized users.

There are 3 main processes involved in watermarking insertion of a watermark, detection

of a watermark, and removal of a watermark.

A general block diagram for the insertion of a watermark is shown which provides a
generic approach to watermarking any digital data. It consists of a watermark insertion unit
that uses the original image, the watermark, and a user key to obtain the watermarked
image.

Watermark Insertion Unit: - Similarly, watermark extraction and detection can also be
performed using the units shown below as well as the user key.

Watermark Extraction Unit: - Extracting the watermark can be divided into two phases,
locating the watermark, and recovering the watermark information. Two kinds of extraction
are available using the original document and in the absence of the original document. A
watermarked detection unit consists of an extraction unit to first extract the watermark, and
later compare it with the original watermark inserted. The output is Yes or No depending
on whether the watermark is present.

Watermark Detection Unit: - Image watermarking depends on the domain in which the
watermarking is done the spatial and frequency domains. Watermarking in the spatial
domain involves selecting the pixels to be modified based on their location within the
image and is very susceptible to cropping and the mosaic attack.

1.2 Applications

Digital watermarking may be used for a wide range of applications, such as:

2
 I. Content identification and management: - Digital watermarking enables
effective content identification by providing a unique digital identity to all forms of media
content in a way that persists with the content wherever it may travel. Digital watermarks
are easily embedded into content without interfering with the consumer's enjoyment of it. It
is imperceptible to humans, but easily detected and understood by computers, networks and
a wide range of common digital devices. The watermark can carry such information as who
owns it, how it may be used or anything else the owner wants to convey. It can also trigger
predefined actions, including linking to websites or other rich consumer experiences.

II. Content protection for audio and video content: - Digital watermarking
provides an added layer of security to the content protection chain to deter unauthorized
use of content by embedding watermarks that identify the permitted uses of the content into
the music or motion picture soundtrack prior to theatrical, packaged media (Blu-ray Discs,
DVDs) and online digital distribution. Devices read the watermark during playback or
copying of content. If the watermark indicates that the use is unauthorized, the playback or
copying is stopped or the audio is muted, and an explanatory message may be displayed.

III. Forensics and piracy deterrence: - Forensic watermark applications enhance a

content owner's ability to detect and respond to misuse of its assets. Forensic watermarking
is used not only to gather evidence for criminal proceedings, but also to enforce contractual
usage agreements between a content owner and the people or companies with which it
shares its content. It provides positive, irrefutable evidence of misuse for leaked content
assets. Watermarking can also complement digital rights management (DRM) in many
situations, by balancing content owner copyrights with consumer fair use allowances.
Watermarking can be effectively used with no restrictions on playback devices to maximize
content promotional opportunities. Watermarking requires no costly recipient-support
infrastructure requirements, post-delivery or ongoing support activities.

IV. Content filtering: -The lean-back experience of watching television has radically
changed over the last few years. Today people want to watch content in their own time and
place. The proliferation of set top boxes (STB) in homes evidences this, as people want to
watch video on demand or on a time-shifted schedule. Today, more than a device to watch
films/series, sports or even play games, the STB has become an interactive device
providing multiple services. Content owners, cable and network operators as well as
3
 advertisers can all benefit in such advances in the technology. With the Internet or
connected STB device, the television set is now becoming a far more advanced
entertainment companion. Digital watermarks offer new opportunity for content owners,
advertisers and more generally marketers looking for new ways to engage consumers with
richer media experiences from the STB and Television set.

V. Communication of ownership and copyrights : - Digital watermarking is the

process of embedding a persistent digital identity into all forms of media content, providing
the means for effective management and tracking of digital assets on the Web. Digital
watermarks contain imperceptible digital data that can convey anything the owner chooses,
including ownership information, contact details, and usage rights. Watermarks stay with
content as it is forwarded and travels across the internet and can be detected at any point to
determine the content's unique identity. Watermarks also survive many different file
manipulations and transformations, unlike standard metadata that is often lost leaving the
content "orphaned."

1.3 Digital watermarking life cycle:

The digital watermark can be defined as the information where information is embedded in
the signal. The signal in which the watermark is embedded is known as host signal. This
whole process takes place in three steps, embedding, attack & detection.

Figure 1.1: - Block diagram of a watermarking system.

In embedding an algorithm accepts the host and the data to be embedded and produces a
watermarked signal. Then this watermarked signal is stored an forwarded to another
person. If this person any change or modification in the received signal, is known as or
termed as attack. Attack can be defined as the effort make by third party to make any

4
change in the watermark. The modifications that can be done on watermark are cropping,
rotating, scaling etc. Detection is also known as extraction this algorithm is applied to the
attack signal in order to extract watermark. If there is no change or modification made in
the signal then the watermark maintained its quality and can be extracted.

1.4 Types of watermarking:

1.4.1 Visible Watermarking: - Visible watermarks are similar to watermarks used on

paper, such as a copyright notice, a verification message stating who owns the material, or
the addition of a digital stamp. Since visual watermarks change the look of an image or
video, they are effective in eliminating potential commercial value for Internet pirates. You
can't claim to own an image with someone else's logo on top, or a video with another
television station's logo in the corner.

Figure 1.2: - Visible Watermark.

1.4.2 Invisible Watermarking: - Invisible digital watermarks are generally undetectable

to the human eye and ear, but can be detected by computers, DVD recorders, digital
cameras or other devices that are equipped with the appropriate software. If an image is
used illegally, an invisible watermark not only notifies the user of the legal copyright
owner, but may also show the prosecution methods the owner will use if the image is used
or copied illegally. To combat the estimated 500,000 movies illegally downloaded every
day, the movie industry frequently uses invisible watermarks causing the words "do not
copy" to appear on illegal copies.
5
 Figure 1.3: - Invisible Watermark.

1.5 Media watermarking: -

a. An Audio Watermark: - In this the watermark in embedded in the audio signal. E.g.:-
audio in a way that is very difficult to remove if the signal in copied then the information is
also carried in the copy. Watermarking is becoming very important in order to keep the data
secure and reliable.
b. Digital Image Watermark: - In this, watermark is embedded in the digital image, due
to which it is very difficult for attack. A Digital image watermarking is Watermarking is the
process of embedding information into digital image a in a way that is difficult to remove.
If the digital images copied, then the information is also carried in the copy. Watermarking
has become increasingly important to enable copyright protection and ownership
verification.
c. Video Watermarking: - In this, watermark embedded in the video.

1.6 Hiding Techniques are:

a. Steganography.
b. Cryptography.
c. Watermarking.

6
S
IW
C
ta
r
n
ety
fgep
o
art
n
rmo
oag
m
gr
a
rka
tip
a
p
inh
hgy
o
y
n

Fig 1.4: Classification of Information Hiding

a. Steganography: - A term derived from the Greek words steganos and graphia
(The two words mean covered and writing, respectively).The art and science of writing
hidden messages in such a way that no one apart from the intended recipient knows of the
existence of the message. The existence of information is secret.
Steganography is classified into 3 categories: -
1) Pure steganography where there is no stego key. It is based on the assumption that
no other party is aware of the communication.
2) Secret key steganography where the stego key is exchanged prior to
communication. This is most suspectible to interception.
3) Public key steganography where a public key and a private key is used for secure
communication.
b. Cryptography: - The conversion of data into a secret code for transmission over a
public network. Today, most cryptography is digital, and the original text ("plaintext") is
turned into a coded equivalent called "cipher text" via an encryption algorithm. The cipher
text is decrypted at the receiving end and turned back into plaintext.
Encryption and Decryption

Plaintext cipher text Plaintext

7
There are two general categories of cryptographic keys: Private key and public key
systems.

1) Private Key Cryptography: -

Private key systems use a single key. The single key is used both to encrypt and decrypt the
information. Both sides of the transmission need a separate key and the key must be kept
secret from. The security of the transmission will depend on how well the key is protected.
The US Government developed the Data Encryption Standard ("DES") which operates on
this basis and it is the actual US standard. DES keys are 56 bits (16) long. The length of the
key was criticized and it was suggested that the short key was designed to be long enough
to frustrate corporate eavesdroppers, but short enough to be broken by the National
Security Agency ("NSA") (17). Export of DES is controlled by the State Department. DES
system is getting old and becoming insecure. US government offered to replace the DES
with a new algorithm called Skipjack which involves escrowed encryption.

2) Public Key Cryptography: -

In the public key system there are two keys: a public and a private key. Each user has both
keys and while the private key must be kept secret the public key is publicly known. Both
keys are mathematically related. If A encrypts a message with his private key then B, the
recipient of the message can decrypt it with A's public key. Similarly anyone who knows
A's public key can send him a message by encrypting it with his public key. A will than
decrypt it with his private key. Public key cryptography was developed in 1977 by Rivest,
Shamir and Adleman ("RSA") in the US. This kind of cryptography is more eficient than
the private key cryptography because each user has only one key to encrypt and decrypt all
the messages that he or she sends or receives.

c. Watermarking: -

1) A distinguishing mark impressed on paper during manufacture; visible when paper

is held up to the light (e.g. $ Bill)

2) Physical objects can be watermarked using special dyes and inks or during paper
manufacturing.

8
 Fig 1.5: Watermarked currency

1.7 Steganography vs. Watermarking: -

1) The main goal of steganography is to hide a message m in some audio or

video (cover) data d, to obtain new data d', practically indistinguishable from d, by
people, in such a way that an eavesdropper cannot detect the presence of m in d'.

2) The main goal of watermarking is to hide a message m in some audio or

video (cover) data d, to obtain new data d', practically indistinguishable from d, by
people, in such a way that an eavesdropper cannot remove or replace in d'.

3) It is also often said that the goal of steganography is to hide a message in

one-to-one communications and the goal of watermarking is to hide message in
one-to-many communications.

4) Shortly, one can say that cryptography is about protecting the content of
messages, steganography is about concealing its very existence.

5) Steganography methods usually do not need to provide strong security

against removing or modification of the hidden message. Watermarking methods
need to to be very robust to attempts to remove or modify a hidden message.

1.8 Cryptography Vs. Watermarking: -

9
 1) Watermarking is a totally different technique from cryptography.
Cryptography only provides security by encryption and decryption. However,
encryption cannot help the seller monitor how a legitimate customer handles the
content after decryption. So there is no protection after decryption. Unlike
cryptography, watermarks can protect content even after they are decoded.
2) Other difference is cryptography is only about protecting the content of the
messages. Because watermarks are inseparable from the cover in which they are
embedded, so in addition to protecting content they provide many other
applications also, like copyright protection, copy protection, ID card security etc.

1.9 Need of Watermarking: -

A watermark is a form, image or text that is printed on to a paper which provide the
property of authenticity. Digital watermarking is a new technique of digital world. Digital
watermarking is a technique that prevents the digital data from being get distorted. Digital
data has due following properties for which it is being used.

Ownership assertion: - Watermark is used to maintain or established the ownership

over the content.
Authentication and integrity verification: - Watermark is used to maintain the
authenticity and integrity of the content
Usage control: - in order to avoid the copyright of the content blocking is done by
using watermark.
Content labeling: - Extra information is provided by the bits which are embedded in
the watermark.

1.10 Encoding: -
Encoding is the process of changing data into a format which is required for a number of
information processing needs.

Programming, compiling and execution.

Data transmission, storage and compression/decompression.
Application data processing such as file conversion.

1.10.1 Type of encoding techniques:

10
The image compression techniques are broadly classified into two categories depending
whether or not an exact replica of the original image could be reconstructed using the
compressed image.
These are:
a. Lossless technique.
b. Lossy technique.
a. Lossless compression technique:

In lossless compression techniques, the original image can be perfectly recovered form the
compressed (encoded) image. These are also called noiseless since they do not add noise to
the signal (image).It is also known as entropy coding since it use statistics/decomposition
techniques to eliminate/minimize redundancy. Lossless compression is used only for a few
applications with stringent requirements such as medical imaging.
Following techniques are included in lossless compression:
1) Run length encoding.
2) Huffman encoding.
3) LZW coding.
4) Area coding.

1) Run Length Encoding: - This is a very simple compression method used for
sequential data. It is very useful in case of repetitive data. This technique replaces
sequences of identical symbols (pixels) ,called runs by shorter symbols. The run length
code for a gray scale image is represented by a sequence { Vi , Ri } where Vi is the
intensity of pixel and Ri refers to the number of consecutive pixels with the intensity Vi as
shown in the figure. If both Vi and Ri are represented by one byte, this span of 12 pixels is
coded using eight bytes yielding a compression ratio of 1: 5.

82 82 82 82 82 82 82 82 82 90 90

{82,5} {89,4} {90,2}

Fig 1.6 : Run Length Encoding

2) Huffman encoding: - Huffman code is prefix code found using the algo which was
developed by David. It was a common technique in entropy encoding include in lossless
data compression. Huffman scheme uses a table of frequency of occurrence of each symbol
11
in the input. This table may be derive from the input itself or from data which is
representative of the input. For instance the frequency of occurrence of letters in normal
english might be derived from processing a large number of text documents and then used
for encoding all text documents. We then need to assign a variable length bit string to each
character that unambiguously represents that character. This means that the encoding for
each character must have unique prefix. If the character to be encoded are arranged in a
binary tree.

Figure 1.7 : - Encoding tree for ETASNO

An encoding for each character is found by following the tree from the root to the character
in the leaf: The encoding is the string of symbols on each branch followed.

For Example:

String Encoding

TEA 10 00 010

SEA 011 00 010

TEN 10 00 110

3) LZW coding: - LZW (Lempel- Ziv Welch ) is a dictionary based coding. Dictionary
based coding can be static or dynamic. In static dictionary coding, dictionary is fixed
during the encoding and decoding processes. In dynamic dictionary coding, the dictionary
is updated on fly. LZW is widely used in computer industry and is implemented as
compress command on UNIX.

12
4) Area coding: - Area coding is an enhanced form of run length coding, reflecting the
two dimensional character of images. This is a significant advance over the other lossless
methods. For coding an image it does not make too much sense to interpret it as a
sequential stream, as it is in fact an array of sequences, building up a two dimensional
object. The algorithms for area coding try to find rectangular regions with the same
characteristics. These regions are coded in a descriptive form as an element with two points
and a certain structure. This type of coding can be highly effective but it bears the problem
of a nonlinear method, which cannot be implemented in hardware. Therefore, the
performance in terms of compression time is not competitive, although the compression
ratio is.
b. Lossy compression technique:

Lossy schemes provide much higher compression ratios than lossless schemes. Lossy
schemes are widely used since the quality of the reconstructed images is adequate for most
applications .By this scheme, the decompressed image is not identical to the original image,
but reasonably close to it. In this prediction transformation decomposition process is
completely reversible .The quantization process results in loss of information. The entropy
coding after the quantization step, however, is lossless. The decoding is a reverse process.
Firstly, entropy decoding is applied to compressed data to get the quantized data. Secondly,
dequantization is applied to it &finally the inverse transformation to get the reconstructed
image.
Major performance considerations of a lossy compression scheme include:
Compression ratio.
Signal - to noise ratio.
Speed of encoding & decoding.
Lossy compression techniques includes following schemes:
1) Transformation coding.
2) Vector quantization.
3) Fractal coding.
4) Block Truncation Coding.
5) Subband coding.

1) Transformation Coding:

13
In this coding scheme, transforms such as DFT (Discrete Fourier Transform) and DCT
(Discrete Cosine Transform) are used to change the pixels in the original image into
frequency domain coefficients (called transform coefficients).These coefficients have
several desirable properties. One is the energy compaction property that results in most of
the energy of the original data being concentrated in only a few of the significant transform
coefficients. This is the basis of achieving the compression. Only those few significant
coefficients are selected and the remaining are discarded. The selected coefficients are
considered for further quantization and entropy encoding. DCT coding has been the most
common approach to transform coding. It is also adopted in the JPEG image compression
standard.
2) Vector Quantization
The basic idea in this technique is to develop a dictionary of fixed-size vectors, called code
vectors. A vector is usually a block of pixel values. A given image is then partitioned into
non-overlapping blocks (vectors) called image vectors. Then for each in the dictionary is
determined and its index in the dictionary is used as the encoding of the original image
vector. Thus, each image is represented by a sequence of indices that can be further entropy
coded.
3) Fractal Coding
The essential idea here is to decompose the image into segments by using standard image
processing techniques such as color separation, edge detection, and spectrum and texture
analysis. Then each segment is looked up in a library of fractals. The library actually
contains codes called iterated function system (IFS) codes, which are compact sets of
numbers. Using a systematic procedure, a set of codes for a given image are determined,
such that when the IFS codes are applied to a suitable set of image blocks yield an image
that is a very close approximation of the original. This scheme is highly effective for
compressing images that have good regularity and self-similarity.
4) Block truncation Coding
In this scheme, the image is divided into non overlapping blocks of pixels. For each block,
threshold and reconstruction values are determined. The threshold is usually the mean of
the pixel values in the block. Then a bitmap of the block is derived by replacing all pixels
whose values are greater than or equal (less than) to the threshold by a 1 (0). Then for each
segment (group of 1s and 0s) in the bitmap, the reconstruction value is determined. This is
the average of the values of the corresponding pixels in the original block.
14
 5) Sub band Coding
In this scheme, the image is analyzed to produce the components containing frequencies in
well-defined bands, the sub bands. Subsequently, quantization and coding is applied to
each of the bands. The advantage of this scheme is that the quantization and coding well
suited for each of the sub bands can be designed separately.

1.11 Research Methodology:-

1.11.1 Types of research: - There are 2 main types of research methodology. With the
major growth in types of research methods over the years, its important to be considered
the basic structure of methodology, which is generally of two types: quantative and
qualitative. Both approaches represents a different contaxt for the study. Researchers must
be able to determine which form of methodology is best suited for their work by
understanding it.

Quantitative Methodology: It allows researchers to evaluate with in a more controlled

context these types of studies infer a tendency to assign numbers to data that is
gathered. Several different types of experiments are part of this larger methodology.
These studies includes statistical and correlation analysis, surveys and controlled
experiments. Statistical and co relational analysis consist of analyzing the relation
between multiple variables. Surveys studies are conducted by collecting information to
measure different variable on the participants beliefs about the variety of topics.
Controlled experiments provides researcher with the ability to test and independent
variable by applying it to one group of cases but not the second group.

Qualitative Methodology: Qualitative Methodology is differ greatly from quantative

model, as they seek to get information that will reflect the contet and the mening of
event of an individual. Qualitative Methodology includes interviews, observation, field
research, service.

Adopted Research: The research methodology that we have adopted for this
desertation is quantative because here, we are not doing any kind of surveys or taking
any kind of interviews we are proposing a new technique by analyzing different
algorithms

15
1.12 Objectives:-
To Study previous algorithms for digital video watermarking.
To Design and implementation of a robust watermarking algorithm.
To check the decryptability of algorithm for extraction of watermark.
To Parameter analysis of proposed watermarking.

Chapter 2
Review of Literature

Abbas Cheddad, Joan Condell, Kevin Curran and Paul Mc Kevitt (2010)
Steganography is the science that involves communicating secret data in an appropriate
multimedia carrier, e.g., image, audio, and video files. It comes under the assumption that if
the feature is visible, the point of attack is evident, thus the goal here is always to conceal
the very existence of the embedded data. Steganography has various useful applications.
However, like any other science it can be used for ill intentions. It has been propelled to the
forefront of current.
Atallah M. Al-Shatnawi (2012) Steganography word is classified into two parts: Steganos
which means secret or covered (where you want to hide the secret messages) and the
graphic which means writing (text). In this paper, a new Steganography technique is
presented, implemented and analyzed. The proposed method hides the secret message
based on searching about the identical bits between the secret messages and image pixels
values. The proposed method is compared with the LSB benchmarking method. It is
implemented to hide the secret message "I will come to see you on the first of June" on two
Bmp images, with size (24 x 502 x 333) and (24 x 646 x 165) respectively. The results of
the proposed and LSB hiding methods are discussed and analyzed based on the ratio
between the number of the identical and the non identical bits between the pixel color
values and the secret message values. The proposed method is efficient, simple and fast it
robust to attack and improve the image quality, hence it obtained an accuracy ratio of 83%.

Saeed Ahmed Sohag, Dr. Md. Kabirul Islam, Md. Baharul Islam (2013) This paper
studies that Steganography is a system that hides information in an application cover
carrier like image, text, audio, and video. Considerable amount of work has been carried
16
out by different researchers on this subject. Least Significant Bit (LSB) insertion method
was more suspicious and low robustness against attacks. The objectives of this study were
to analyze various existing system and implement a dynamic substitution based Image
Steganography (IS) with a secret key. Our proposed method is more difficult to attack
because of message bits are not inserted in to the fixed position. In our method, the
message bits are embedded into deeper layer depending on the environment of the host
image and a secret key resulting increased robustness. The robustness specially would be
increased against those intentional attacks which try to reveal the hidden message.
Vipul Sharma, Sunny Kumar (2013) We have proposed a new steganography algorithm
that is used to hide text file inside an image. In order to increase maximize the storage
capacity we have used a compression algorithm that compresses the data to be embedded.
The compression algorithm we have used works in a range of 1bit to 8 bits per pixel ratio.
By applying this algorithm we have developed an application in that would help users to
efficiently hide the data.
Anil Kumar, Rohini Sharma (2013) In this study Steganography is a method of hiding
secret messages in a cover object while communication takes place between sender and
receiver. Security of confidential information has always been a major issue from the past
times to the present time. It has always been the interested topic for researchers to develop
secure techniques to send data without revealing it to anyone other than the receiver.
Therefore from time to time researchers have developed many techniques to fulfill secure
transfer of data and steganography is one of them. In this paper we have proposed a new
technique of image steganography i.e. Hash - LSB with RSA algorithm for providing more
security to data as well as our data hiding met hod. The proposed technique use hash
function to generate a pattern for hiding data bits into LSB of RGB pixel values of the
cover image. This technique makes sure that the message has been encrypted before hiding
it into a cover image. If in any case the cipher text got revealed from the cover image, the
intermediate person other than receiver can't access the message as it is in encrypted form.
R.Poornima and R.J.Iswarya, (2013) In this study Hiding Capacity plays a vital role for
efficient covert communication. This is achieved by Steganography. Steganography is the
science of hiding the information into the other information so that the hidden information
appears to be nothing to the human eyes. There are many ways to hide information inside
an image, audio video, document etc. But Image Steganography has its own advantages
and is most popular among the others. This paper gives a review of various methods such
17
as image domain and transformation domain algorithms available for implementing Image
Steganography. In this paper, a high capacity Image Steganography schemes are discussed
for different file formats. Covert communication is taking place by encrypting the
password for information to be protected. The intended receiver will decrypt the
information using that password.
Jian Lu (2014) One of the main objectives of watermarking is to achieve a better tradeoff
between robustness and high visual quality of a host image. In recent years, there has been
a significant development in gray-level image watermarking using fractal-based method.
This paper presents a human visual system (HVS) based fractal watermarking method for
color images. In the proposed method, a color pixel is considered as a 3-D vector in rgb
space. And a general form of 3 3 matrix is utilized as the scaling operator. Meanwhile,
the luminance offset vector is substituted by the range block mean vector. Then an
orthogonalization fractal color coding method is achieved to obtain very high image
quality. We also show that the orthogonalization fractal color decoding is a mean vector-
invariant iteration. So, the range block mean vector is a good place for hiding watermark.
Furthermore, for consistency with the characteristics of the HVS, we carry out the
embedding process in the CIE space and incorporate a just noticeable difference (JND)
profile to ensure the watermark invisibility. Experimental results show that the proposed
method has good robustness against various typical attacks, at the same time, with an
imperceptible change in image quality.
Jasleen Kour (2014) Steganography is defined as the study of invisible communication.
Steganography usually deals with the ways of hiding the existence of the communicated
data in such a way that it remains confidential. It maintains secrecy between two
communicating parties. In image steganography, secrecy is achieved by embedding data
into cover image and generating a stego image. There are different types of steganography
techniques each have their strengths and weaknesses. In this paper, we review the different
security and data hiding techniques that are used to implement a steganography such as
LSB, ISB, and MLSB etc.
Priya Porwal (2014) From the previous millennium there has been a significant change
from the analog to digital world. In today's ti me Audio cd's, Internet and DVD's are more
widespread than before. Though the film and music content owners are relu ctant to release
digital contend. This situation is because if this digital content is left unprotected, there are
high chances of it being copied rapidly, on a large scale, with no limitations on the number
18
of copies and it can be easily distributed via Internet. [3]As there is a rapid development in
the current Information Technology, electronic publishing like the distribution of digitized
images and videos, are becoming more and more popular. So there is a need of protecting
as well as authenticating 3 dimensional data. Copyright protection is an important issue for
electronic publishing. This paper presents the different video watermarking techniques. It
provides a review on various available algorithms. In addition to it, focus on Combined
Least Significant Bit (LSB) and Discrete Cosine Transform(DCT) Technique and also LSB
with modifications Technique.
Mrs. Rashmi Soni (2014) Digital watermarking is the most important technology in
todays world, to avoid illegal copying of data. This technique can be applied to audio,
video, text or images. This paper surveys the features and concepts pertaining to the
various watermarking techniques such as DCT, DWT and purpose of digital watermarking
& image watermarking. The sudden increase in watermarking interest is most likely due to
the increase in concern over copyright protection of content copyright-protected digital
contents are easily recorded and distributed due to: occurrence of high-capacity digital
recording devices & the explosive growth in using Internet. The watermark carries
information about the object in which it is hidden.
Ekta Miglani (2014) According to a Survey, today, in the market, the protection of
copyrighted material has become a new challenge, as the importance of the internet is
increasing day by day in information acquisition. For protection of copyright material
watermarking is introduced. Digital Watermarking is the process to authenticate user files
by embedding and hiding digital code behind an image, text, audio and video file. For
examples copyright symbols, signature or even images are used. This paper categorizes the
various watermarking techniques along with the comparison that can help to know which
one technique is more robust and better than others.
Dr.V.Seenivasagam (2014) Digital video is a sequence of consecutive still images. Digital
watermarking was developed to provide the copy right protection and owners
authentication. Digital video watermarking is a method for embedding some data into
digital video sequences.E.g. text, audio, image, video. In this paper,we survey on video
watermarking and its methods, Attacks on watermarking, classification of watermarking
and applications.
Pawan Singh Shekhawat (2014) Watermarking technology insert ownership information
in suitable form inside any media like audio, video, image etc, so that owner of the object
19
will claim his/her ownership when anyone claim his/her false ownership on that object.
Proposed work, proposes a new algorithm for watermark insertion and extraction named as
Non Blind DWT Based Multiplicative SVD Watermarking algorithm which is new
version of the algorithm proposed by Bhargava[8] in his paper Digital Image
Authentication System Based on Digital Watermarking .In this paper he is utilizing
additive approach for watermark embedding and extraction algorithm and proposed
algorithm utilize the multiplicative approach also he embeds watermark in one sub-band
i.e. approximation sub-band and proposed algorithm utilize all four sub-bands for
watermark embedding.
De Li1 (2014) We propose a robust video watermarking algorithm based on dual transform
domain using the adaptive quantization method. In order to increase the robustness of
watermark, Particle Swarm Optimization algorithm is used for embedding watermarks.
Firstly, one-level wavelet decomposition is employed for the two-dimensional carrier
signal by using the characteristics of the wavelet multi-resolution analysis, and then the
low frequency and middle-frequency coefficients are extracted. After dividing the
coefficients into small blocks, discrete cosine transform is applied to each block
coefficient. Then, the adaptive quantization algorithm is designed. The optimal embedding
positions in the two dimensional space of the carrier signal are determined dynamically by
using Particle Swarm Optimization algorithm, and the coefficients in the optimal
embedding positions are also extracted. According to the characteristics of these
coefficients, the optimal quantization step sizes are determined dynamically in three
dimensional space. Finally, the watermark is embedded into watermarking vector
adaptively by using the optimal embedding positions and optimal quantization step sizes,
then the watermarked vector will be received. The experimental results show that
compared with traditional watermark algorithms, the presented robust watermark algorithm
not only eliminate the block effects that might arise in the transform process, but also make
full use of Particle Swarm Optimization algorithm to determine the optimal embedding
positions and optimal quantization step sizes of the watermark embedding algorithm. It has
implemented the adaptive embedding and increased the non-sentience and robustness of
the watermark. A series of attacks and comparative experiments.
Lianjie Dong (2014) With the rapid development of network communication and broad
application of multimedia technology, copyright protection of digital media work is
becoming more and more important. Digital watermarking is viewed as an effective tool
20
for copyright protection of multimedia data. At first the princip1e, research background and
status of digital watermark is described. Then, a blind watermarking algorithm based on
DWT is proposed. The watermark image is scrambled by a generalized Arnold transform
so as to improve the security of the watermark; the watermark is embedded into the
middle-frequency subband which guarantees the robustness of the algorithm; In order to
implement the blind extraction, this paper improves an embedding algorithm based on
HVS, which enhances the applicability of the algorithm. This paper tests the algorithm by
VC++6.0, and quantity of experiment data shows that algorithm has good robustness, and
the imperceptibility of watermark can be guaranteed at the same time.
Myasar Mundher (2014) This study presents digital images watermarking approach to
sustain the ownership and true authentication. To secure intellectual belongings of images,
audio and videos, watermark W is converted into a sequence of bits and in order to encrypt
the watermark, sequence of size R is selected randomly. Additionally, a pseudo random
number is generated to calculate pixels for selection key generation. Finally, 2-level
discrete slanlet transform (DST) on the host image is applied to divide it into Red, Green
and Blue channels. The results thus produced from proposed methodology exhibit
robustness against the existing state of the art. Further, proposed approach effectively
extract watermark in the absence of the original images.
Mr. Jagtap. D. V (2014) Now days, internet resulted in an considerable growth in
multimedia applications. The explosive advancement of internet has made it easier to send
the data/image accurate and faster to the destination. Besides this, it is easier to modify and
misuse the valuable information through hacking at the same time. Digital watermarking is
one of the proposed solutions for copyright protection of multimedia data. A watermark is a
technique, image or text is impressed onto the another image, which provides evidence of
its authenticity. Here an invisible watermarking technique (least significant bit) and a
visible watermarking technique is implemented. This paper presents the general overview
of image and text watermarking and different security issues such as ambiguity attack,
cryptographic attacks etc. Various attacks such as ambiguity attack, cryptographic attacks
etc. are also performed on watermarked images and their impact on quality of images is
supplementary of paper. In paper, Image Watermarking using Least Significant Bit (LSB)
algorithm has been used for embedding the message/ into the image. This work has been
implemented through MATLAB.

21
Ravikant s. Mendegar (2014) Now a days multimedia is becoming a part of our life, with
the growing popularity and digital media, we propose a method of non-blind transform
domain video watermarking scheme which is based on the Discrete Wavelet Transform
(DWT), Singular Value Decomposition (SVD) and Arnold Transform. The DWT based
compression offers scalability so its coefficients are used to embed the watermarking
information. The ARNOLD transform has been used for scrambling the watermark so that
strangers cannot be identifying the watermark. We also used SVD based digital
watermarking which is a method of authentication data embedding in image characteristics
with expectation to show resiliency against different types of unintentional or deliberate
attacks. Here DWT plays the important role of an efficient tool due to its multi-resolution
capability. Along with this wavelet transform we mix up another very strong mathematical
tool called the singular value decomposition (SVD). Though till date both of them have
individually been used as a tool for watermarking of digital media, very few works have
utilized their skills in tandem, especially in this area. This scheme provides a hybrid
technique developed the protection of the intellectual property with better robustness
against the popular malicious attacks. This we have seen practically by attacking the
watermarked image against simulated attacks and recovering the watermark from it.
Sunil Sharma (2014) It has been observed that many numbers of researches has been done
in field of digital video watermarking using transformation technique. Digital media
protection and security is major concern in todays world because of explosion of data
exchange on the Internet and the extensive use of digital media. In this paper, a
comprehensive approach for managing robustness and security of video watermarking is
introduced. We propose a digital video watermarking scheme based on combination
transformation and pixel domain technique. For any reliable water marking Robustness and
Fidelity are the major requirements. In pervious work, a robustness scene-based
watermarking scheme is proposed. We focus on improving the fidelity at higher extent of
scheme in this paper. The fidelity of the scheme is enhanced by applying using
combination of our proposed and DWT watermarking algorithm, which optimizes the
quality of the watermarked video. We have performed a series of experiments for
effectiveness of this scheme.
Monika Sharma (2014) Security of digital products (audio, video, image, and text) on the
internet is very essential these days, for these digital watermarking techniques are used.
Digital watermarking is the process of embedding data into digital multimedia content.
22
This is used to validate the reliability of the content or to recognize the identity of the
digital content's owner. Sophisticated watermarking techniques have recently been
developed, and they can be used to embed in printed text, graphics, or images as well as in
digital images, graphics, audio, or video. This present survey is on DWT (Discrete Wavelet
Transform) technique used in watermark. DWT transform more computationally efficient
than other transform methods, because of its outstanding localization properties which offer
the compatibility with the Human Visual System (HVS).
Neeta Deshpande (2014) Current paper proposes a novel robust dual watermarking
scheme that entrench a decipherable sample in the spatial domain and an invisible
watermark in frequency domain of a color video. Visible watermark facilitate in the
protection of publicly accessible data thus providing an imperative contribution for
avoiding illegal duplication of data. The adaptive visible watermarking algorithm exploits
various histogram features and not only embeds a visible watermark in the spatial domain
but also facilitates its extraction and removal thus endowing with the facet of
reconstruction of the video. For enhancing the robustness of the scheme and increasing the
degree of protection of the watermark, invisible watermark is scrambled in parts and
embedded in various frames of the video in DCT domain. These dual watermarks are
embedded in host video. The robustness of the scheme is verified with various signal
processing attacks, geometric attacks and video watermarking attacks like frame averaging.
Reconstruction of the video helps the authorized subscribers to refurbish the original video.
Sivakami (2014) This study represents an implementation of a digital watermarking
system that can insert visible, semi fragile watermark information into compressed video
streams. The watermark embedding is processed in the discrete cosine transform domain.
To achieve high performance, the proposed system architecture employs pipeline structure
and uses parallelism. Experimental results are watermarking technique features minimum
video quality degradation and can withstand certain potential attacks, i.e., cover-up attacks,
cropping, and segment removal on video sequences. Furthermore, the proposed system
based watermarking system features low power consumption, low cost implementation,
high processing speed, and reliability.
Liu Yan (2014) Digital watermarking is the process of embedding information into a
digital signal in a way that is difficult to remove. The digital watermarking for video is an
effective method to protect the video copyright. This paper introduces the basic
classification of video watermarking and the basic concepts of the motion vector, and
23
introduces a combination of motion vectors with different compression standards to
produce a variety of video watermarking algorithms and analyze its advantages and
disadvantages. Analyze some kinds of attacks of the video watermarking, summarize and
looking out the future of video watermarking based on motion vector.
S.Manikanda prabu1 (2014) The copyright protection of digital data became a crucial
issue nowadays. Watermarking is one of the powerful solutions, in which a specified signal
or image is embedded in digital data that can be extracted or detected later for
authentication purpose. In this paper, a new watermarking approach based on wavelet
coefficient quantization using back propagation neural network in discrete wavelet
transform domain is proposed. The host image is decomposed up to three levels using
discrete wavelet transform. The secret image is chosen as a watermark. The back
propagation neural network is used while embed and extract the watermark. Peak signal to
noise ratio and normalized cross correlation coefficient are computed to measure the image
quality of the proposed technique. Experimental results demonstrate that the proposed
watermarking algorithm has good imperceptibility and robustness against several types of
attacks, such as salt and pepper, Gaussian and speckle noise addition, compression and
rotation.

24
Chapter 3
Requirements

3.1 Need of study:

Many algorithms have been introduced in this concern but they lack in few stages. Video
watermarking approaches can be classified into two main categories based on the method
of hiding watermark bits in the host video. The two categories are: one in which embedding
and detection of watermark are performed by just manipulating the pixel intensity values of
the video frame. Second alter spatial pixel values of the host video according to a pre-
determined transform and are more robust than spatial domain techniques since they
disperse the watermark in the spatial domain of the video frame making it difficult to
remove the watermark through malicious attacks like cropping, scaling, rotations and
geometrical attacks. The commonly used transform domain techniques are Discrete Fourier
Transform (DFT), the Discrete Cosine Transform (DCT), and the Discrete Wavelet
Transform (DWT), PCA and SVD.
But they are not efficient in finding the interest points where to embed the watermark. Even
they all are not so stable. Thus to overcome these issue a new technique is introduced in
implementation of watermarking. In general, there are two types of techniques for
embedding a predefined watermark into a Video frame. One is pseudo random sequence
used for objective detection; the other is binary image or gray image used for subjective
detection. In this thesis, in order to subjectively verify the ownership of Video frame with
the aid of extracting a watermark, a binary logo image is used. And the watermark bit is
either 1 or 0. One of the main challenges of the watermarking is to achieve a tradeoff
between robustness and perceptivity. In general, increasing the strength of the embedded
watermark can achieve robustness, but it would lead to an increase in the visible distortion
as well, and vice versa. Since the orthogonal zed fractal decoding is mean-invariant
iteration, the range block mean is a good robust place to hide a watermark. After fractal
decoding, the embedded watermark diffuses throughout the reconstructed Video frame .In

25
order to gain high robustness as well as low sensitivity in Video frame watermarking, the
knowledge of human visual perception of color stimuli must be well utilized in designing
embedding algorithms.

3.2 Requirement Specification

MATLAB: - MATLAB stands for matrix laboratory which is a multi-

paradigm numerical computing environment and fourth-generation programming language.
A proprietary programming language developed by MathWorks, MATLAB allows
matrix manipulations, plotting of functions and data, implementation of algorithms,
creation of user interfaces, and interfacing with programs written in other languages,
including C, C++, Java, Fortran and Python. Although MATLAB is intended primarily for
numerical computing, an optional toolbox uses the MuPADsymbolic engine, allowing
access to symbolic computing capabilities. An additional package, Simulink, adds
graphical multi-domain simulation and model-based design for dynamic and embedded
systems. In 2004, MATLAB had around one million users across industry and
academia. MATLAB users come from various backgrounds of engineering, science,
and economics. MATLAB is widely used in academic and research institutions as well as
industrial enterprises.

Advantage of using MATLAB: -

1) A very large (and growing) database of built-in algorithms for image processing and
computer vision applications.

2) MATLAB allows you to test algorithms immediately without recompilation. You can
type something at the command line or execute a section in the editor and immediately see
the results, greatly facilitating algorithm development.
3) The MATLAB Desktop environment, which allows you to work interactively with your
data, helps you to keep track of files and variables, and simplifies common
programming/debugging tasks.
4) The ability to read in a wide variety of both common and domain-specific image
formats.
5) The ability to call external libraries, such as Open CV.

26
6) Clearly written documentation with many examples, as well as online resources such as
web seminars ("webinars").
7) Bi-annual updates with new algorithms, features, and performance enhancements.
8) If you are already using MATLAB for other purposes, such as simulation, optimation,
statistics, or data analysis, then there is a very quick learning curve for using it in image
processing.
9) The ability to process both still images and video.
10) Technical support from a well-staffed, professional organization (assuming your
maintenance is up-to-date)
11) A large user community with lots of free code and knowledge sharing.
12) The ability to auto-generate C code, using MATLAB Coder, for a large (and growing)
subset of image processing and mathematical functions, which you could then use in other
environments, such as embedded systems or as a component in other software.
Key features of MATLAB: -
1) High-level language for numerical computation, visualization, and application
development.
2) Interactive environment for iterative exploration, design, and problem solving.
3) Mathematical functions for linear algebra, statistics, Fourier analysis, filtering,
optimization, numerical integration, and solving ordinary differential equations.
4) Built-in graphics for visualizing data and tools for creating custom plots.
5) Development tools for improving code quality and maintainability and maximizing
performance.
6) Tools for building applications with custom graphical interfaces.
7) Functions for integrating MATLAB based algorithms with external applications and
languages such as C, Java, .NET, and Microsoft Excel.

Windows 7: - Windows 7 is built on the Vista kernel. To many end users the biggest
changes between Vista and Windows 7 are faster boot times, new user interfaces and the
addition of Internet Explorer 8. The OS is widely available in three retail editions:
Windows 7 Home Premium, Professional and Ultimate. Starter, OEM and Enterprise
editions are available in some markets.

27
Chapter 4
Design and Coding

4.1 Design: -

Start

Raw Video Sequence

Block
Matching Process

Embedding
Process

Watermarked
Video

28
 A

Embedded
Keys

Extraction
Keys

Watermarked
Video

Block matching
Processing

Extracted
Processing

Extracted
Watermark
Video

Stop

Figure 4.1:- Data Flow Diagram.

29
4.2 Coding: -

Module 1:-

In this firstly we select a video from user.

It will execute the whole video and chose the frame which has highest entropy
level.
It will ask user to select the watermarked image which will embed in the frame and
will change this image into grey scale and simultaneously check the histogram. This
will also convert the watermarked image in the described ratio.
Now it will apply fractal encoding method.
After encoding it will reconstruct the video.

Module 2:-

Select the encoded video.

Applying fractal decoding method.
Final watermarked image will be decoded.

30
Chapter 5
Testing and Implementation

5.1 Testing: -
Software testing is the process of evaluation a software item to detect differences between
given input and expected output. Also to assess the feature of A software item. Testing
assesses the quality of the product. Software testing is a process that should be done during
the development process. In other words software testing is a verification and validation
process.

Verification
Verification is the process to make sure the product satisfies the conditions imposed at the
start of the development phase. In other words, to make sure the product behaves the way
we want it to.

Validation
Validation is the process to make sure the product satisfies the specified requirements at the
end of the development phase. In other words, to make sure the product is built as per
customer requirements.

5.2 Basics of software testing: -

There are two basics of software testing: black box testing and white box testing.

5.2.1 Black box Testing

Black box testing is a testing technique that ignores the internal mechanism of the system
and focuses on the output generated against any input and execution of the system. It is
also called functional testing.

5.2.2 White box Testing

White box testing is a testing technique that takes into account the internal mechanism of a
system. It is also called structural testing and glass box testing.
Black box testing is often used for validation and white box testing is often used for
verification.
31
5.3 Types of testing
There are many types of testing which are as given below:-
a. Unit Testing: - Unit testing is the testing of an individual unit or group of related units.
It falls under the class of white box testing. It is often done by the programmer to test that
the unit he/she has implemented is producing expected output against given input.
b. Integration Testing: - Integration testing is testing in which a group of components are
combined to produce output. Also, the interaction between software and hardware is tested
in integration testing if software and hardware components have any relation. It may fall
under both white box testing and black box testing.
c.Functional Testing: - Functional testing is the testing to ensure that the specified
functionality required in the system requirements works. It falls under the class of black
box testing.
d. System Testing: - System testing is the testing to ensure that by putting the software in
different environments (e.g., Operating Systems) it still works. System testing is done with
full system implementation and environment. It falls under the class of black box testing.
e.Stress Testing: - Stress testing is the testing to evaluate how system behaves under
unfavorable conditions. Testing is conducted at beyond limits of the specifications. It falls
under the class of black box testing.
f. Performance Testing: - Performance testing is the testing to assess the speed and
effectiveness of the system and to make sure it is generating results within a specified time
as in performance requirements. It falls under the class of black box testing.
g. Usability Testing: - Usability testing is performed to the perspective of the client, to
evaluate how the GUI is user-friendly? How easily can the client learn? After learning how
to use, how proficiently can the client perform? How pleasing is it to use its design? This
falls under the class of black box testing.
h. Acceptance Testing: - Acceptance testing is often done by the customer to ensure that
the delivered product meets the requirements and works as the customer expected. It falls
under the class of black box testing.
i. Regression Testing: - Regression testing is the testing after modification of a system,
component, or a group of related units to ensure that the modification is working correctly
and is not damaging or imposing other modules to produce unexpected results. It falls
under the class of black box testing.

32
j. Beta Testing: - Beta testing is the testing which is done by end users, a team outside
development, or publicly releasing full pre-version of the product which is known as beta
version. The aim of beta testing is to cover unexpected errors. It falls under the class of
black box testing.
k. Adopted Testing: - In this we have used black box testing because the outputs depends
upon the inputs provided to the system. For testing purposes a class that takes as input both
a Watermark and a selected video frame. It will insert the watermark into the selected video
frame video frame and then try to detect the resultant file for the corresponding watermark.
If it cant detect the freshly inserted watermark there is an error in the implementation. The
modules were designed to be self-contained and therefore able to be tested separately by
both an individual test harness and by hand using a debugger and visualization tools.

5.4 Implementation: -
Steps of Data Encoding:

1. Extract the frame from the video.

2. Calculate the visibility of each frame.

3. Selection of video frame which has high visibility value.

4. Now apply fractal encoding on selected frame.

5. Convert into LAB color space through the XYZ space.

6. Now embed the watermark into frame.

7. Apply fractal decoding.

8. Convert into original form i.e. RGB space with help xyz space from LAB space.

9. Reconstruct the video again.

10. Create final encrypted video.

Steps of Data Decoding:

1. Select encrypted video for extraction the information from the video.

2. After selection of video select the frame which has watermarked embedded.
33
3. Convert into again LAB color space through the XYZ space.

4. Also select the original frame.

5. Then extract pixel information from the video.

6. Final original image is decoded.

Chapter 6
Results and Discussion

6.1 Results: -

6.1.1 Encryption

a. Select a video: -

In this user is requested to select a video in which the watermark has to be

embedded.

34
 Fig 6.1 : - Selection of video

b. Selected frame: -

It is the frame which is chosen from the entire video and has highest entropy
level.

35
Fig 6.2 : - Highest entropy frame

36
c. Select a watermark: -

In this user will select a image.

Fig 6.3 : - Selection of image

37
d. Selected watermark image:-

From the above givem options user has chosen this image to embed in video.

38
 Fig 6.4 : - Watermark Image

Now this image will change in to gray scale.

Fig 6.5 : - Final Watermark Image

e. Reconstructed Final video:-

39
 Fig 6.6 : - Final Video

6.1.2 Decryption

a. Chose the video:-

Fig 6.7 : - Chose the video

40
 b. Recovered Watermark:-

Fig 6.8 : - Retrieved watermark

6.2 Discussion: -

a. Calculation of mean square error: - We are having the lowest mean square
error at point 0.2.

41
 Fig 6.9 : - Calculated Mean square error.

b. Calculation of Bit Error Rate: - We are having the lowest Bit Error Rate at
point 0.034.

Fig 6.10: - Calculated Bit error.

c. Calculation of PSNR: - We are having the higest PSNR value.

42
 Fig 6.11: - Calculated PSNR.

d. Q factor of encrypted video: - We are having the lowest PSNR value.

43
 Fig 6.12 : - Calculated lowest MSE, BER and highest PSNR.

e. Comparisons: - Problem solving using fractal provides better results as it has higher
PSNR ratio.

44
Fig 7.2 (e): - Comparision betweenDCT and Fractral .

Fig 6.13 : - Calculated higher PSNR.

45
f. Comparisons: - Problem solving using fractal provides better results as it has lower
BER.

Fig 6.14 : - Comparisons between DCT and Fractal (BER).

46
g. Comparisons: - Problem solving using fractal provides better results as it has lower
MSE.

47
 Fig 6.15: - Comparisons between DCT and Fractal (MSE).

Chapter 7
Future Scope and Suggestions

A basic concept of Fractal based video watermarking is to add a watermark signal to the
host signal in uncompressed domain. Various techniques can be used to embed watermark
like DCT, DWT, SVD and PCA in order to get better results.

48
Bibliography

[1] A. E. Jacquin, Image coding based on a fractal theory of iterated contractive image
transformations, IEEE Transactions of Image Processing, vol. 1, no. 1, pp. 1830, 1992.
[2] C. S. Tong and M. Pi, Fast fractal image encoding based on adaptive search, IEEE
Transactions on Image Processing, vol. 10, no. 9, pp. 12691277, 2001.
[3] M. Ghazel, G. H. Freeman, and E. R. Vrscay, Fractal image denoising, IEEE
Transactions on Image Processing, vol. 12, no. 12, pp. 15601578, 2003.
[4] M. Pi, M. K. Mandal, and A. Basu, Image retrieval based on histogram of fractal
parameters, IEEE Transactions on Multimedia,vol. 7, no. 4, pp. 597605, 2005.
[5] M.H. Pi, C. H. Li, and H. Li, Anovel fractal image watermarking,IEEE Transactions
on Multimedia, vol. 8, no. 3, pp. 488498, 2006.
[6] J. Lu, Z. Ye, Y. Zou, and R. Ye, An enhanced fractal image denoising algorithm,

49
Chaos, Solitons & Fractals, vol. 38, no. 4, pp. 10541064, 2008.
[7] X.-Y. Wang and L.-X. Zou, Fractal image compression based on matching error
threshold, Fractals, vol. 17, no. 1, pp. 109115, 2009.
[8] X.Wang, F. Li, and S.Wang, Fractal image compression based on spatial correlation
and hybrid genetic algorithm, Journal of Visual Communication and Image
Representation, vol. 20, no. 8, pp. 505510, 2009.
[9] T. Jayamalar, Dr. V. Radha, Survey on Digital Video Watermarking Techniques and
Attacks on Watermarks, International Journal of Engineering Science and Technology,
vol. 12, 6963- 6967, 2010.
[10] H.-N. Chen, K.-L. Chung, and J.-E. Hung, Novel fractal image encoding algorithm
using normalized one-norm and kick-out condition, Image and Vision Computing, vol. 28,
no. 3, pp. 518525, 2010.
[11] X. Y.Wang, Y. X. Wang, and J. J. Yun, An improved no-search fractal image coding
method based on a fitting plane, Image and Vision Computing, vol. 28, no. 8, pp. 1303
1308, 2010.
[12] E.Vahedi, R. A. Zoroofi, andM. Shiva, Toward a newwaveletbased watermarking
approach for color images using bioinspired optimization principles,Digital Signal
Processing, vol.22, no. 1, pp. 153162, 2012.

List of Papers published

1. Digvijay Puri, Priyanka Sharma A Review paper on Digital video watermarking for
data prevention in copyrighting Vol.3 Issue 4 July-August 2015 Edition.

50
51