DCT based Watermarking technique
Upcoming SlideShare
Loading in...5
×
 

DCT based Watermarking technique

on

  • 1,956 views

DCT-based Watermark Recovering

DCT-based Watermark Recovering
without Resorting to the Uncorrupted Original Image

Statistics

Views

Total Views
1,956
Views on SlideShare
1,938
Embed Views
18

Actions

Likes
1
Downloads
16
Comments
0

3 Embeds 18

http://thinkinglearningsharing.blogspot.com 16
http://thinkinglearningsharing.blogspot.com.au 1
http://thinkinglearningsharing.blogspot.de 1

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

DCT based Watermarking technique DCT based Watermarking technique Presentation Transcript

  • DCT Based watermarking recovering withoutrestoring to the uncorrupted Original ImageUmair Amjad umairamjadawan@gmail.com
  • AgendaWatermark embeddingWatermark detection DCT-basedWatermark Recovering without Resorting to the Uncorrupted Original Image A. Piva, M. Barni, F. Bartolini, V. Cappellini Dipartimento di Ingegneria Elettronica Universit`a di Firenze via S. Marta 3, 50139, Firenze, Italy e-mail piva@cosimo.die.unifi.it
  • Watermark EmbeddingRead image. Lets say, I.DCT transform is applied.DCT coefficients are reordered into a zigzag scan.It is now impossible for the decoder to determine the position of the coefficients with thelargest magnitude, since non-marked image is no longer available.T = {t1, t2, . . . . . . , tL, tL+1, . . . . . . , tL+M}To get perceptual invisibility we skipped first L coefficients.Now, watermark X = {x1, x2, . . . . . . , xM} (choose among pseudo-random sequences) isembedded in the last M numbers, to obtain a new vector.T’ = {t1, t2, . . . . . . , tL, t’L+1, . . . . . . , t’L+M}According to the rule:t’L+i = tL+i + α |tL+i| xiWhere i = 1, . . . . . , MNow the vector T’ is inserted in the inverse zigzag scan and the inverse DCT algorithm isperformed, obtaining the watermarked image I’.
  • Watermark DetectionRead watermarked image. Lets say I*.DCT transform is applied.Perform zigzag scan.Now coefficient (L+1)th to (L+M)th are selected to generate a vector.T* = {t*L+1, t*L+2,. . . . . . , t*L+M}The correlation between the corrupted coefficients T*, and the mark itself is taken as ameasure of the mark presence.For this we generate 1000 random fake watermarks.Correlation is computed for each of the marks and that with the largest correlation isassumed to be the one really present in the image.
  • Original Image Waterwark Image
  • Original Image Waterwark Image