Digital

Watermarking for
Big Data
Arunothpol Debnath (ECE/13/124)
Advaitaa Biswas(ECE/13/030)
Sohini Mondal(ECE/13/034)
Anirban Dasgupta (ECE/13/092)
CONTENT
Abstract
Introduction
Problem Statement
Project Planning
Proposed Algorithm & Block Diagrams.
Conclusion
 ABSTRACT
In the past few years, digital multimedia distribution over the Internet
has grown rapidly as a result of the latest developments in technologies.
Due to the continuously increasing availability of the Internet, the digital
data can be easily shared, processed or used causing serious security
problems. So protecting digital data is becoming very urgent.
As a solution to this problem, different authentication techniques are
used. As watermarking is identified as a major technology to achieve
copyright protection, in this project a Fragile/Robust Digital
Watermarking for Big data is proposed.
Digital data can be copied easily without any degradation in quality, so
the protection of the data is necessary.
Digital watermarking is a technology to embed additional information
into the host signal to ensure security and protection of multimedia data.
 INTRODUCTION
Adigital watermarkis a kind of marker covertly
embedded in a noise-tolerantsignalsuch as an audio,
video 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 acarrier 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 COPY CONTROL, CONTENT AUTHENTICATION,
OWNERSHIP IDENTIFICATION, BROADCAST
MONITORING etc.
 Properties of Digital Watermarking
Robustness
A digital watermark is called "fragile" if it fails to be detectable after the slightest modification. Fragile
watermarks are commonly used for tampering detection (integrity proof).

A digital watermark is calledsemi-fragileif it resists benign transformations, but fails detection after
malignant transformations.

A digital watermark is calledrobustif it resists a designated class of transformations. Robust

watermarks may be used in copy protection applications to carry copy and no access control
information.

Imperceptibility
A digital watermark is calledimperceptibleif the original cover signal and the marked signal are
perceptually indistinguishable. The artefacts produced by watermark embedding should not
degrade the quality of the original content in such a way that it is detectable by viewers.

A digital watermark is calledperceptibleif its presence in the marked signal is noticeable.

Capacity
The data capacity of a watermark is an indication of the amount of information that can be
embedded with a watermark. The capacity varies with the application.
TYPES OF DIGITAL WATERMARKS
 Problem Statement
Design a fragile/robust digital watermarking scheme for Big
Data
 Project Planning
The most common and easily available source of big data is a video. Video
watermarking introduces some issues not present in image watermarking.
Due to large amounts of data and inherent redundancy between frames,
video signals are highly susceptible to pirate attacks, including frame
averaging, frame dropping, frame swapping, statistical analysis, etc.

Though SPATIAL DOMAIN approach is easy to implement and relatively

computationally efficient, but not robust against common digital signal
processing operations such as video compression. So we selected to take
FREQUENCY DOMAIN approach, as it disperses the watermark in the
spatial domain of the video frame, hence making it very difficult to remove
the embedded watermark.

The DISCRETE WAVELET TRANSFORM offers the advantage that it can take
advantage of special properties of alternate domains to address the
limitations of pixel-based methods. Normalization performed in both
insertion and detection phase makes the watermark to be robust to
resizing of the video frame. It is robust against format conversions
because the watermark is inserted before compression.
Discrete Wavelet Transform
Level 1 Transform: The DWT of a signalis calculated by
passing it through a series of filters.

Cascading and filter banks: This decomposition can be

repeated to further increase the frequency resolution and the
approximation coefficients decomposed with high and low
pass filters and then down-sampled.
Proposed Algorithm
Step1: Decompose the video in individual
frames and convert the frames in Gray
scale images.
Step2: Apply Level 3, 2D DWT on each
frame to decompose into various sub-
bands using db2 Wavelet. This leads to
LL3 frequency band.
Step3: For each frame calculate mean of
low freq coefficient using:
k = 1,2,P; P is total frames
N is total no. of coefficients in each LL3
components of corresponding frame.
Continued Step4: For k-th frame compare the LL3
coefficient with the mean Tk to generate
a binary pattern: Wk(i) = 1, if ak(i)>=
Tk and = 0, if ak(i)
< Tk.
Step5: Now the key is generated by
using XOR on Wk and G. G is the
watermark image.
Keyk(i) = Wk(i) XOR G(i); i = no. of
coefficients
Step6: Now by applying IDWT we get
the watermarked video.
Extracting
Watermark

With the key available, the

watermark can be
extracted from each frame
by this algorithm.
CONCLUSION
We are working on updating and
validating the design with respect to
the objective of proposed work.
THANK YOU!