This document discusses video watermarking for a group project. It introduces video watermarking as a way to embed copyright information imperceptibly in video content in order to prove ownership and identify thieves. It lists important terminology, requirements for a robust video watermarking system, and applications, such as owner identification, proof of ownership, and broadcast monitoring. The document also mentions steps for insertion, detection, and extraction of watermarks but does not provide details.

1. VIDEO
WATERMARKING
GROUP MEMBERS
HAMZA NAVEED
(FA16-BCS-014)

2. INTRODUCTION
• Definition: A watermark is information about origin, ownership, copy control etc.
• This information is embedded in multimedia content with taking care of
imperceptibly and robustness
• Video watermarking is basically an extension of our project on Watermarking

3. NEED FOR VIDEO WATERMARKING
• Protect copyright of a data.
• Video Watermarking can be used to
◦ Prove possession (ownership)
◦ Identify the culprit who is behind this intellectual property theft
◦ Trace the source from where it has been spreading

4. IMPORTANT TERMINOLOGIES
• Digital Video
• Payload
• Perceptibility
• Robustness
• Security

5. WHAT DO WE WANT ?
• Robust Video watermarking
• Recoverable from a document
• Removable by authorized users
• Low error probability
• Provide the original information embedded reliably
• Invisible

6. WHERE IT CAN BE USED
• Owner Identification
• Proof of Ownership
• Transaction Tracking
• Content Authentication
• Broadcast Monitoring
• Automatic monitoring of copyrighted material on the Web

7. INSERTION

8. DETECTION

9. EXTRACTION

10. MAIN IDEA • Let’s consider still images.
• Each pixel of the color image has three
components — red, green and blue.
• 3 bytes for each pixel.
• Each color has 1 byte, or 8 bits.
• Each bits has it’s own value 2pow(n)

11. METHODOLOGY • A pixel that is bright purple in color can be
shown as
• X0 = {R=255, G=0, B=255}
• Another pixel:
• X1 = {R=255, G=0, B=254}

12. TECHCNIQUE • A raw bitmap image „A’ will be selected from the set of
standard test images. Let this be the base image on which the
watermark will be added.
• A raw bitmap image „B‟ will be selected from the set of
standard test images. This will be the watermark image which
will be added to the base image.
• The most significant bit henceforth will be mentioned as MSB,
of watermark image „B‟ will be read and these will be written
on the least significant bit, henceforth will be mentioned as
LSB, of base image „A‟.
• Thus, „A’ will be watermarked with ‘B’ resulting in a combined
image ‘C‟.
• ‘C’ therefore will now contain an image ‘A’ which has its LSBs
replaced with the MSBs of ‘B‟.
• This technique is used to add an invisible and visible
watermark.