Applications Classification Common watermarking methods Types of verification/detection Implementing watermarking using wavelets
Copyright Protection
Invisibly mark products
Embed all necessary data in a single image Naturally expands to video watermarking
Simple
Transformed Domain
DCT DWT SVD
Product of 3 matrices A = UVT U ,V are orthogonal matrices: UTU= I, VTV = I = diag (1, 2, ...). The diagonals of are called the singular values of A The columns of U are called the left singular vectors of A and The columns of V are called the right singular vectors of A.
Fragile
Detection fails with even minor modification Useful in tampering detection Common in simple additive watermarking
Robust
Detection is accurate even under modification Need for robustness dependent on use of data
Non-blind
The watermarking scheme requires the use of the original image
Semi-Blind
The watermarking scheme requires the watermark data and/or the parameters used to embed the data
Blind
If the watermarking scheme does not require the original image or any other data
Most DWT watermarking algorithms embed only in the HL, LH and HH sub-bands
LL LH HL HH
Perform 2D-DWT to divide image into LL, HL, LH and HH sub-bands. Select coefficients from the LL, HL, LH and HH subbands that surpass a particular threshold T1 Embed watermarking data via additive modification ti = ti + |ti|xi Perform 2D-IDWT to create watermarked image
xi = watermark = weighting constant
Difference
Modifications to edge data create the least visually perceptible changes If using a hard threshold to select coefficients, the number of affected coefficients can vary greatly Images with a greater number of edges will hold more watermarking data
Difference
Original
Watermarked
Original
Watermarked
Method
Perform 2D-DWT to divide image into LL, HL, LH and HH sub-bands. Select coefficients from each sub-band that surpass a threshold T2>T1. Compute the correlation z, between the coefficients of the received image (ti*) > T2 and a particular watermark (yi ).
Compute the threshold Tz. Detection Occurs when z>Tz. Comparison versus other incorrect watermarks show that the correct watermark is the only one that surpasses the threshold
20 15
Threshold
10 5 0 -5
50
100
150
200
250
Watermarks
DWT Watermarking schemes work well against most forms of image modification
Jpeg Compression Downsampling -> Upsampling Gaussian Noise Median Filtering
Technique does not work well in cases of image rotation Dependent on pixel location
Watermarked
Watermarked
60
40
20
0 -2 0
-20
50
100
150
200
250
50
100
150
200
250
50
100
150
200
250
DWT-Based watermarking methods are fast /robust and protect against most forms of manipulation Schemes based on pixel dependency are robust in most forms of image manipulation, but fail when significant pixels are moved from their original location