Scribd
Upload
19 views9 pages

Compresion

The document discusses different types of image compression and digital image watermarking. It describes how image compression reduces the amount of data needed to represent an image by removing redundant and irrelevant information. It then explains visible and invisible watermarking, where visible watermarks are noticeable overlays and invisible watermarks embed hidden identification information in image bits. The document concludes by outlining a robust, invisible watermarking technique that embeds a pseudo-random watermark in the largest DCT image coefficients to withstand attacks like compression.

Uploaded by

Durgarao Nagayalanka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views9 pages

Compresion

The document discusses different types of image compression and digital image watermarking. It describes how image compression reduces the amount of data needed to represent an image by removing redundant and irrelevant information. It then explains visible and invisible watermarking, where visible watermarks are noticeable overlays and invisible watermarks embed hidden identification information in image bits. The document concludes by outlining a robust, invisible watermarking technique that embeds a pseudo-random watermark in the largest DCT image coefficients to withstand attacks like compression.

Uploaded by

Durgarao Nagayalanka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Image compression

• Image compression is the art & science of reducing the amount


of data required to represent an image.
• Fundamentals:
• The term data compression refers to process of reducing the
amount of data required to represent a given quantity of
information.
• Data & information are not same here, data are used as how
the information is conveyed.(various amounts of data are used
to represent the same amount of information).
• Irrelavant & repeated information is called redundant data.
• If b and b’ is no of bits in two representations then relative
redundancy R of the representation with b bits is
R=1-(1/c) compression ratio c=b/b’
• C=10 (also written 10:1 ) that is larger representation has 10
bits of data for every 1 bit of data in smaller representation.
•
Digital image watermarking
• Distribution of images on digital media & over internet
practically. These images are copied repeatedly without any
error.
• One way to duplication is to insert one or more items of
information collectively called watermarking.
• By watermarking,protects copy rights of owners as
• 1. copy right identification: watermaking can provide
information that serves as proof of ownership.
• 2.user identification & fingerprinting
• 3.authenticity determination
• 4.automated monitering
• 5.copy protection
• Visible watermarking is opaque or semi transparent sub
image,therefore it is obvious to image. Ex: television networks
place visible watermarking in the upper or lower part of
television screen.
• Let fw represent the watermarked image. It can be expressed
as the linear combination of unmarked image f & watermark
w using
fw=(1-α) f+ αw 0< α<1
Here watermarked image is clearly visible.
Invisible watermarking
• Invisible watermarking cannot be seen by naked eye. But can
be reconvered by appropiate decoding algorithm.
• LSB of an 8bit image have virtually no effect on human
perception,hence watermark was inserted or inserted in its two
least significant bits,using the notation
• fw=4(f/4)+ W/64
• Dividing & multiplying by sets the two LSB of f to zero.
• Dividing w by 64 shifts its two MSB’s into two LSB’s & adding
the two results generates LSB matermakered image.
• By zeroing the MSB 6 bits watermarked image can be
extracted.
• If the image is compressed & decompressed then watermaked
is destroyed.
Robust invisible watermarking
• Robust invisble watermarking system has to be developed to
overcome the inadvertent attacks include lossy compression,
linear & nonlinear filtering, croping, rotation ,resampling
,adding noise.
• Typical watermarking system:
• If wi is visible the decoder is not needed.
• If wi is invisible the decoder is needed.
• If fi & wi is used for decoding then system is private or
restricted –key system otherwise public or unrestricted –key
system.
DCT based invisible robust watermark
• Mark insertion & extraction inthe spatial domain is as follows
• Step1. compute the 2-D DCT of the image to be
watermarked.
• step2. locate its K largest coeficients c1,c2,...ck
• Step3. create a watermark by generating a K- element Pseudo
random sequence of numbers w1,w2, .......wk from guassiam
distribution.
• Step4. embed the watermark from step 3 into K largest DCT
coeficients from step2 as Ci’ = Ci(1+αwi ) 1<i<k
• Step5: compute the inverse of DCT of the result from step4.
• Step1. compute the 2-D DCT of the image .
• step2. Extract its K largest coeficients c’1,c’2,...c’k
• Step 3. compute watermark w1,w2,...wk wi= c’i-ci
• Step4. measure the similarity of wi by

• Step5.compare the measured similarity with the predefined


threshold T to get a binary detection

You might also like