Video Watermarking

(1)

Presented by:-

MANJESH KUMAR

(12100027)

Guided by:- Guided by:-

Dr. David Peter S.

(2)

INTRODUCTION

Definition:

Definition: A digital watermark is a digital signal orA digital watermark is a digital signal or pattern inserted into a digital document such as pattern inserted into a digital document such as text, graphics or multimedia, and carries text, graphics or multimedia, and carries information unique to the copyright owner.

information unique to the copyright owner.



 Video watermarking is an extension of thisVideo watermarking is an extension of this

concept

(4)

Need for video watermarking



 Protect copyright of a data.Protect copyright of a data.



 Video Watermarking can helpVideo Watermarking can help

◦

◦ Prove ownershipProve ownership

◦

◦ Identify a misappropriating personIdentify a misappropriating person

◦

◦ Trace the video disseminationTrace the video dissemination



 BroadcasBroadcast t MonitoringMonitoring



 Video watermarking introduces some issues notVideo watermarking introduces some issues not

present in image

present in image watermarkinwatermarkingg



 Frame averaging, frame dropping, frameFrame averaging, frame dropping, frame

swapping

(5)

Video watermarking terminologies

•

• Digital VideoDigital Video

• • PayloadPayload • • PerceptibilityPerceptibility • • RobustnessRobustness • • SecuritySecurity

(6)

TYPES

TYPES of of Video Video WatermarkingWatermarking



 Two types :-Two types

:-1. Visible 1. Visible 2. Invisible 2. Invisible



 Visible watermarksVisible watermarks

it’s

it’s use : -use : -1.

1. TTo o discourage discourage unauthorized unauthorized usage.usage. 2.

2. As As an an advertisementadvertisement



 Visible watermarking algorithmVisible watermarking algorithm

Least Significant Beat (LSB) Least Significant Beat (LSB)

(7)

EXAMPLE OF VISIBLE VIDEO

WATERMARKING

(8)

Invisible watermarks Invisible watermarks

Three types of Invisible watermark : Three types of Invisible watermark :

1.

1. Robust WatermarksRobust Watermarks

2.

2. Fragile WatermarksFragile Watermarks

3.

3. Public and Private WatermarkPublic and Private Watermark



 No degradation in the aesthetic quality of No degradation in the aesthetic quality of thethe

data. data.



 Invisible Robust Video Watermarking TechniquesInvisible Robust Video Watermarking Techniques



 Spatial Domain MethodSpatial Domain Method



(9)

DESIRED PROPERTIES



 RobustRobust

Video watermarking ( frame averaging, frame Video watermarking ( frame averaging, frame dropping, frame swapping... )

dropping, frame swapping... )



 Recoverable from a documentRecoverable from a document



 Removable by authorized usersRemovable by authorized users



 Low error probabilityLow error probability



 Provide the original information embeddedProvide the original information embedded

reliably reliably   CapacityCapacity   InvisibleInvisible

(10)

APPLICATION OF WATERMARKING APPLICATION OF WATERMARKING

•

• Owner Owner IdentificatioIdentificationn

•

• Proof of OwnershipProof of Ownership

•

• TTransacransaction tion TTrackirackingng

•

• Content AuthenticationContent Authentication

•

• Broadcast MonitoringBroadcast Monitoring

•

• Device ControlDevice Control

•

• Automatic monitoring of copyrighted material onAutomatic monitoring of copyrighted material on

the Web the Web

(11)

A Generic approach to watermarking digital A Generic approach to watermarking digital

data data



There are 3 main processes involved in

watermarking

watermarking —

—

1. 1. Insertion

Insertion of

of a

a watermark

watermark

2. 2. Detection

Detection of

of a

a watermark

watermark

3.

(12)

Inserting a watermark Inserting a watermark



 It consists of :-It consists of

:-A watermark insertion unit

A watermark insertion unit that uses:-that

uses:-a. Original video a. Original video b. Watermark b. Watermark c. A user key c. A user key

to obtain the watermarked video. to obtain the watermarked video.

(13)

watermark insertion unit watermark insertion unit



 The user key , input video The user key , input video and the watermarkand the watermark

are passed through a watermark insertion unit. are passed through a watermark insertion unit.



(14)

Watermark Extraction Unit Watermark Extraction Unit



 Two phases:-Two

phases:-1. Locating the watermark 1. Locating the watermark

2. Recovering the watermark information. 2. Recovering the watermark information.

(15)

Watermark Detection Unit Watermark Detection Unit



Consists of :-

Consists of

:-a. An extraction unit to first extract the

a. An extraction unit to first extract the

watermark.

b. Compare it with the

b. Compare it with the original watermark

original watermark

inserted.

c. The output is Yes or No depending on

whether the watermark is present.

(16)

(17)

A watermarking algorithm

A watermarking algorithm —— The LSBThe LSB

technique technique



 Let’s consider still images.Let’s consider still images.



 Each pixel of the color image has threeEach pixel of the color image has three

components

components —— red, green and blue.red, green and blue.



 3 bytes for each pixel.3 bytes for each pixel.



 Each color has 1 byte, or 8 biEach color has 1 byte, or 8 bits.ts.



(18)

(19)

The LSB technique……. The LSB technique…….



A

A pixel

pixel that

that is

is bright purple

bright purple in

in color

color can

can

be shown as



X0 = {R=255, G=0, B=255}



Another pixel:



(20)

The Algorithm

1.A raw bitmap image

1.A raw bitmap image „„AA’’ _{will be selected from the set of standard test images. Let}_{will be selected from the set of standard test images. Let}

this be the

this be the base image on which the watermark will be addedbase image on which the watermark will be added.. 2. A raw bitmap image

2. A raw bitmap image „„BB‟‟ will be selected from the set of standard test images. Thiswill be selected from the set of standard test images. This will be the

will be the watermark image which will be added to the base imagewatermark image which will be added to the base image.. 3. The most

3. The most significant bit henceforth will be mentioned as MSB, of watermark imagesignificant bit henceforth will be mentioned as MSB, of watermark image „B‟

„B‟ will be read and these will be written on the least significant bit, henceforth willwill be read and these will be written on the least significant bit, henceforth will be mentioned as LSB, of base

be mentioned as LSB, of base imageimage „A„A‟‟.. 4. Thus,

4. Thus, „„AA’’_{will be watermarked with}_{will be watermarked with} ‘B’‘B’_{resulting in a combined image}_{resulting in a combined image} ‘C‘C_‟‟..

5.

5. ‘C’‘C’ _{therefore will now contain an image}_{therefore will now contain an image} ‘A‘A’’ _{which has its LSBs replaced with}_{which has its LSBs replaced with}

the MSBs of the MSBs of ‘B‘B_‟‟..

6. This technique is used to add an invisible and visible watermark. 6. This technique is used to add an invisible and visible watermark.

(21)

Distortions and attacks Distortions and attacks



Additive Noise.



Cropping.



Compression.



Statistical Averaging.



Multiple Watermarking.



(22)

(23)

An Algorithm of Invisible Video Watermarking An Algorithm of Invisible Video Watermarking



Raw video watermarking

◦

◦ DWT (Discrete wavelet transform)DWT (Discrete wavelet transform)

◦

◦ DCT DCT ( ( Discrete Discrete cosine cosine transform)transform)

◦

(24)

Discrete Wavelet Transform



Normalized to 256 X 256 pixel size



(25)

Advantage of DWT



 Prevent from frame droppingPrevent from frame dropping



 Prevent from adding noise / another videoPrevent from adding noise / another video

Mark with m

Mark with m11 Mark with mMark with m33 Mark with mMark with m00 Mark with mMark with m66

Scene change occur Scene change occur

(26)

Watermark Preprocess



 Safe from frame averagingSafe from frame averaging



 Hard to reconstruct the watermarkHard to reconstruct the watermark

85 85 64 64 ₀₀ 1 1 2 2 4 4 5 5 6 6 7 7 3 3 Crop Crop Bit Bit Decomposition Decomposition 8 8 bit-planes planes 17 17 0 0 25 25 6 6 0 0 1 1 2 2 4 4 5 5 6 6 7 7 3 3 8 8 bit-planes planes 17 17 0 0 25 25 6 6 0 0 1 1 2 2 4 4 5 5 6 6 7 7 3 3 Total 8 images Total 8 images is obtained is obtained m m₀₀ m m₇₇

Place the Place the bit-planes side by planes side by

side side

(27)

Watermark Embedding



C[i]

C[i] =

= C[i]

C[i] +

+ 1

1 ,

, if

if W[j]

W[j] =

= 1

1



C[i]

C[i] =

= C[i]

C[i]

,

, otherwise

otherwise



LL, HH is not

LL, HH is not watermark

watermark

HL HL11 LH LH11 HHHH11 HL HL22 HH HH₂₂ LH LH₂₂ LL LL LH LH LH LH₃₃ HHHH₃₃ HL HL33 HL HL HH HH 170 170 256 256 0 0 1 1 2 2 4 4 5 5 6 6 7 7 3 3 Watermark m Watermark mii

(28)

Watermark Detection Watermark Detection 1. Video Frame 1. Video Frame 256 X 256 256 X 256 3. DWT3. DWT DWT result frames DWT result frames

Original video frames Original video frames 4. Compare

4. Compare

2. Detect the scene change 2. Detect the scene change

5. Averaging the watermark 5. Averaging the watermark

get from different frames get from different frames

Watermark Watermark mm_ii 170 170 256 256 mm_m_m00 1 1 m m₂₂ m m44 m m55 m m₆₆ m m₇₇ m m₃₃

7. Get different part of W 7. Get different part of W from different scene and from different scene and reconstruct the large image reconstruct the large image

170 170 256 256 0 0 1 1 2 2 4 4 5 5 6 6 7 7 3 3 6. Combine 8 bit-planes 6. Combine 8 bit-planes 85 85 64 64

8. Correlate and verify 8. Correlate and verify

Extracted Original Extracted Original

E

E OO

Mark with

Mark with mm11 Mark with mMark withm33 Mark withMark with mm00 Mark withMark with mm66

Scene change occur Scene change occur

(29)

Future Direction Future Direction



 Implement and use do experiment on theImplement and use do experiment on the

scheme scheme



 Identifiable from very short segment of videoIdentifiable from very short segment of video



(30)

ATTACK ON WATERMARK ATTACK ON WATERMARK  

Compression

 

Rescaling

 

Cropping



Multiple watermarks

•

Frame averaging

•

Frame dropping

•

Frame swapping

•

(31)

CONCLUSION



Need due to Copyright protection



Differe

Different from

nt from image watermarking

image watermarking



Brief

Brief review

review of

of current

current technologies

technologies



DWT-based Video Watermarking Scheme with

Scramble

Scramble W

Watermark

atermark



Future Direction



Inadequate for general use



Different tools offering this watermarking



(32)

REFERENCES REFERENCES



 F. Hartung and M. Kutter,F. Hartung and M. Kutter, “Multimedia“Multimedia watermarkingwatermarking techniques”,Proceedingstechniques”,Proceedings of theof the

IEEE, vol. 87, no. 7 ,

IEEE, vol. 87, no. 7 , July1999.July1999.



 I. Cox, J. Kilian, T. Leighton, and T. Shamoon,I. Cox, J. Kilian, T. Leighton, and T. Shamoon, “Secure“Secure spread spectrum watermarkingspread spectrum watermarking

for images, audio and

for images, audio and video,”video,” in Proc. IEEE Int. Conf. Image Processing (ICIP 96),in Proc. IEEE Int. Conf. Image Processing (ICIP 96), Lausanne, Switzerland, Sept. 1996.

Lausanne, Switzerland, Sept. 1996.



 Yeo and M.M. Yeung,Yeo and M.M. Yeung, “Analysis“Analysis and synthesis for new digital videoand synthesis for new digital video applications,” icip,applications,” icip,

International Conference on Image

International Conference on Image Processing (ICIP'97),vol. 1, pp.1,1997.Processing (ICIP'97),vol. 1, pp.1,1997.



 Ingemar J. Cox, Matthew L. Miller, Jeffrey A. BloomIngemar J. Cox, Matthew L. Miller, Jeffrey A. Bloom “Digital“Digital Watermarking”Watermarking” MorganMorgan

Kaufmann Publishers ISBN:

Kaufmann Publishers ISBN: 1-55860-1-55860-714-5714-5



 http://www-ee.uta.edu/http://www-ee.uta.edu/dip/Courses/dip/Courses/EE5355/jpeg.htEE5355/jpeg.htmlml



 “Privacy“Privacy principles for digitalprinciples for digital watermarking”,watermarking”, Ver. 1.0, May 2008. Website:Ver. 1.0, May 2008. Website:

https://www.cdt.org/ https://www.cdt.org/

(33)

(34)

Video Watermarking

Presented by:-

Presented by:-

MANJESH KUMAR

MANJESH KUMAR

(12100027)

(12100027)

Dr. David Peter S.

Dr. David Peter S.

CONTENTS

CONTENTS

INTRODUCTION

INTRODUCTION

Need for video watermarking

Need for video watermarking

Video watermarking terminologies

Video watermarking terminologies

EXAMPLE OF VISIBLE VIDEO

EXAMPLE OF VISIBLE VIDEO

WATERMARKING

DESIRED PROPERTIES

DESIRED PROPERTIES

There are 3 main processes involved in

There are 3 main processes involved in

watermarking

watermarking —

—

1.

1. Insertion

Insertion of

of a

a watermark

watermark

2.

2. Detection

Detection of

of a

a watermark

watermark

3.

Consists of :-

Consists of

:-a. An extraction unit to first extract the

a. An extraction unit to first extract the

watermark.

watermark.

b. Compare it with the

b. Compare it with the original watermark

original watermark

inserted.

inserted.

c. The output is Yes or No depending on

c. The output is Yes or No depending on

whether the watermark is present.

A

A pixel

pixel that

that is

is bright purple

bright purple in

in color

color can

can

be shown as

be shown as

X0 = {R=255, G=0, B=255}

X0 = {R=255, G=0, B=255}

Another pixel:

Another pixel:

The Algorithm

The Algorithm

Additive Noise.

Additive Noise.

Cropping.

Cropping.

Compression.

Compression.

Statistical Averaging.

Statistical Averaging.

Multiple Watermarking.