Final Year Project

on
Designing A Fragile cum Robust Digital
Watermarking Scheme for Big Data Application
By
Arunothpol Debnath(ECE/13/124)

Sohini Mondal(ECE/13/034)

Advaitaa Biswas(ECE/13/030)
Anirban Dasgupta (ECE/13/092)

Under the Guidance of

Dr. Tirtha Sankar Das
Department of Electronics and Communication Engineering
RCC INSTITUTE OF INFORMATION TECHNOLOGY
CONTENT

• Brief Introduction and Literature Survey

• Problem Statement
• Proposed Algorithm
• Results
• Conclusion
• Future Scope
• References
 INTRODUCTION
"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 COPY CONTROL,
CONTENT AUTHENTICATION, OWNERSHIP IDENTIFICATION etc.

Cover Work Channel

Encoder Decoder Extracted
Watermark

Noise Attacks

Watermark
 Properties of Digital Watermarking

• Robustness
• Imperceptibility
• Capacity
TYPES OF DIGITAL WATERMARKS
 Literature Survey
• Maher El’Arbi, Chokri Ben Amar and Henri Nicolas has proposed a video watermarking scheme based on multi resolution
motion estimation and artificial neural network. The results show that embedding watermark where picture content is moving
is less perceptible.[1]
• Mr Mohan A Chimanna , Prof. S.R. Khot has proposed a compressive approach for digital video watermarking ,where
watermark image is embedded into the video frame and each video frame is decomposed into sub images using 2 level
Discrete Wavelet Transform (DWT) and Principal Component Analysis (PCA) Transform is applied for each block in the two
bands LL & HH.The results show no visible difference between watermark frame and original video frame, it shows the
robustness against a wide range of attacks.The proposed algorithm is however,a non blind algorithm. [2]
• Han-Seung Jung, Young-Yoon Lee, Sang Uk Lee proposed a scene-based temporal watermarking algorithm. In each scene,
segmented by scene-change detection schemes, a watermark is embedded temporally to one-dimensional projection vectors of
the log-polar map, which is generated from the DFT of a two-dimensional feature matrix. Each column vectorof the feature
matrix represents each frame and consists of radial projections of the DFT of the frame.The proposed algorithm is not robust
against random temporal attacks. [3] 
• Tahani Al-Khatib, Ali Al-Haj, Lama Rajab and Hiba Mohammed proposed an algorithm based on a cascade of two powerful
mathematical transforms; Discrete Wavelets Transform (DWT) and Singular Value Decomposition (SVD).In the proposed
hybrid algorithm, the watermark bits are not embedded directly on the wavelet coefficients, but rather on the elements of
singular values of the frames' DWT sub-bands. [4] 
• Jaya Jeswani, Dr. Tanuja Sarode proposed an algorithm in which cover video is divided into frames and watermark is
inserted into selected frames. For selected video frames two-dimensional 8×8 discrete cosine transform is carried out on
luminance component. Finally binary watermark is embedded into mid frequency DC coefficients by adjusting coefficients
DCT (4, 3) and DCT (5,2).This algorithm does not embed watermark in all the frames. Also, the result against attacks like
Gaussian Noise, Salt and Pepper Noise etc does not show satisfactory results. [5] 
Past Challenges:
 
1.Most watermarking algorithms are yet to resolve robustness issues completely.
2.In order to maintain the imperceptibility, the capacity of the system is often compromised.
3.The existing algorithms are prone to failure against common attacks.
4.Non-blind detection scheme.

Present Challenges:
1.Maintaining balance between imperceptibility, robustness and capacity.
2.Fragile watermarking, where data recovery against cropping is a challenging issue.
3.More capacity means imperceptibility is compromised. So, equilibrium need to be maintained.
4.Robustness.The watermarking technique should be universal so that it is robust against various kinds of attacks.
5.Other issue is computational cost i.e. cost of inserting and detecting watermark that should be minimized.

Problem Statement
Design a fragile cum robust digital watermarking scheme for Big Data problem. In our project we have tried to resolve the
issues of :

• copyright protection

• tampering detection

• capacity
Proposed Algorithm
Original Video •• Step
 scale1:images. 
Decompose the video in individual frames and convert the frames in Gray

Extraction of Frames • Step 2: Apply Level 6, 2D DWT on each frame to decompose into various sub-bands
using db2 Wavelet. This leads to LL6 frequency band.

RGB to Gray conversion • Step3: For each frame, calculate mean of low frequency coefficient using ; k =
1,2,...P
Application of DWT
• Step 4: Compare the low frequency coefficient with the mean value Tk for k-th frame
obtained in step 3, to generate a binary pattern:
Generation of binary pattern
Wk = 1, if ak ≥ Tk

Key=Binary pattern XOR = 0, if ak < Tk; k = frame number

Watermark

• Step 5: Generate the key ' Kk ' by applying XOR operation between W k and the
Embedding the Key in the
frames watermark image- G, for k-th frame. Let the dimension of the key K k be m×n.

Kk = Wk (i) XOR G(i)

Application of IDWT

Watermarked video
 Continued …
• Step 6: Generate (m×n) number of PN sequences having the same dimension as the HH coefficient at Level 1. Only the states having
their mean value close to 0 are selected. The states are stored for future use in watermark detection.

• Step 7: Embedding the key in the frames

if Kk(i)==1

HH’ = HH + g *pns

else

HH’ = HH - g *pns

• Step-8: Application IDWT, reconstruct the video from the modified frames to get the watermarked video.
Extraction of Watermark
Watermarked Step 1: Decompose the watermarked video in individual frames and convert the
video
 frames in Gray scale images.
Step 2: Apply Level 1, 2D DWT on each frame to decompose into various sub-
bands using db2 Wavelet.
Extraction of
Frames Step3: For each frame, calculate mean of low freq coefficient using:
; k = 1,2,...P
Step 4: Corelate the HH coefficient matrix at Level-1 with the PN sequences
Application of generated using the saved states. The values are saved in the matrix cor_coef(i).
DWT if cor_coef(i) >= 0
cor_value(i) = 1;
else
Co-relating to
PN sequence cor_value(i) = 0;
Step 5: Apply level 6 DWT.Compare the low frequency coefficient with the
mean value Tk for r-th frame, to generate a binary pattern:
Generation of Wr = 1, if ar ≥ Tr
Binary Pattern
= 0, if ar< Tr; r = frame number.

Step-6: Generate the watermark ' G’ ' by applying XOR operation between
Key Extraction
cor_value and the binary pattern Wr, for r-th frame.
G’ = Wr (i) XOR cor_value(i)
Generation of Where G’ is the reconstructed watermark.
Watermark
Results
Attacks
Attacks
 CONCLUSION

• The performance of the algorithm is measured by PSNR, MSE and percentage of mismatch. The algorithm
achieves high PSNR values and low MSE without attacks.
• Watermark was recovered from the frames with no or minimal error as calculated by the percentage of
mismatch.
• It is also found to be robust to most common attacks like Salt and Pepper Noise, Median Filtering etc.
• However, it was not found to be robust against cropping. The watermark is embedded in the diagonal
coefficents. Slightest tampering will be detected as the binary pattern changes. The algorithm is thus,
fragile.
• Therefore, we can say that the algorithm realises blind watermarking which can be applied for both
copyright protection and tampering detection.
 FUTURE SCOPE

• The algorithm can be made more robust by embedding watermark in both the approximation as well as detail
coefficients.

• The gain for embedding the watermark can be made adaptive.

• The capacity can be improved by multi bit embedding procedure.

• PN sequences used can be modified so as to get better correlation values.

 References
• [1] M. El'arbi, C. B. Amar and H. Nicolas, "Video Watermarking Based on Neural Networks" 2006 IEEE International
Conference on Multimedia and Expo, Toronto, Ont., 2006, pp. 1577-1580.
doi: 10.1109/ICME.2006.262846
• [2] “ Digital Video Watermarking Techniques for Secure Multimedia Creation and Delivery”, Mr Mohan A Chimanna,
Prof.S.R.Khot / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 3,
Issue 2, March -April 2013, pp.839-844
• [3] “RST-Resilient VideoWatermarking UsingScene-Based Feature Extraction”, Jung, HS., Lee, YY. & Lee, S.U. EURASIP J.
Adv. Signal Process. (2004) 2004: 358092. doi:10.1155/S1110865704405046
• [4] “A Robust Video Watermarking Algorithm”,Tahani Al-Khatib, Ali Al-Haj, Lama Rajab and Hiba Mohammed, Journal of
Computer Science 4 (11): 910-915, 2008 ISSN 1549-3636,© 2008 Science Publications
• [5] “A New DCT based Color Video Watermarking using Luminance Component”,Jaya Jeswani, Dr. Tanuja Sarode, IOSR
Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 2, Ver. XII (Mar-Apr.
2014), PP 83-90 www.iosrjournals.org
• Digital Watermarking (The Morgan Kaufmann Series in Multimedia Information and Systems) by Ingemar Cox , 
Matthew Miller , Jeffrey Bloom, Mathew Miller
• https://www.intechopen.com/books/watermarking-volume-2/using-digital-watermarking-for-copyright-protection
• Digital Watermarking:Techniques and Trends;Authors: Nematollahi, Mohammad Ali, Vorakulpipat, Chalee, Rosales, Hamurabi
Gamboa
• http://www.alpvision.com/watermarking.html
THANK YOU!