Presentation is loading. Please wait.

Presentation is loading. Please wait.

On SVD-based watermarking algorithm

Similar presentations


Presentation on theme: "On SVD-based watermarking algorithm"— Presentation transcript:

1 On SVD-based watermarking algorithm
Source: Applied Mathematics and Computation, In Press, Corrected Proof, Available online 30 October 2006,  Author:Kuo-Liang Chung, Wei-Ning Yang, Yong-Huai Huang, Shih-Tung Wu and Yu-Chiao Hsu

2 Outline Related work Propose 2 notes Experiments Conclusions
“SVD-based digital image watermarking scheme” propose by Chin-ChenChang ,PiyuTsai ,Chia-ChenLin at Pattern Recognition Letters 26 (2005) Propose 2 notes Experiments Conclusions

3 Related work Motivation 123 U D V

4 Related work Motivation 158 156 159 157 153 155 154 155 154
Original block JPEG compressed block 158 156 159 157 153 155 154 155 154 U component of original block U component of JPEG compressed block 0.6127 0.3466 0.0840 0.0122 0.2101 0.0792 0.8102 0.3061 0.6532 0.2678 0.6545 0.4980 0.2699 0.5028

5 Related work Motivation |-0.5008|-|-0.5000| =0.008>0
0.6532 0.2678 0.6545 0.4980 0.2699 0.5028 0.6127 0.3466 0.0840 0.0122 0.2101 0.0792 0.8102 0.3061 | |-| | =0.008>0 Positive relationship | |-| | =0.008>0 Positive relationship

6 Related work Embedding 0.002 < 0.0008 < 0.002 < Match case
0.6127 0.3466 0.0840 0.0122 0.2101 0.0792 0.8102 0.3061 0.6127 0.3466 0.0840 0.0122 0.2101 0.0792 0.8102 0.3061 < < Unmatch case T=0.002 = -|| |+( )/2| = -|| |-( )/2| 0.6127 0.3466 0.0840 0.0122 0.2101 0.0792 0.8102 0.3061 <

7 Is not positive relation
Related work Embedding Differ > T Algorithm to increase the differ Embed 1 Is positive relation Is not positive relation Swap two values Swap two values No change value No change value

8 Related work Extraction -0.5056 0.6127 -0.4989 0.3466 -0.5014 0.0840
0.0122 0.2101 0.0792 0.8102 0.3061 | |-| |>T Extraction 1 | |-| |<-T Extraction 0 0.6127 0.3466 0.0840 0.0122 0.2101 0.0792 0.8102 0.3061

9 Related work 1 1 Water mark
1 PRNG or algorithm to detect the complex blocks Water mark

10 Propose 2 notes Note 1: For the U component of the SVD, modifying the coefficients in column vector will cause less visible distortion than modifying the coefficients in row vector. Note 2: For the VT component of the SVD, modifying the coefficients in the row vector will cause less visible distortion than modifying the coefficients in column vector.

11 Experiment result

12 Experiment result Table 1 PSNR performance under different thresholds
Images T = 0.002 T = 0.012 T = 0.02 T = 0.04 LenaU LenaUV PeppersU PeppersUV Table Error rate under three attacks with T = 0.012 JPEG QF = 70 Noise 5% Cropping 25% LenaU LenaV PeppersU peppersV

13 Conclusions Propose 2 notes to increase the invisibility and capacity of the SVD-based watermarking scheme. Embedding the watermarking in U and V components.


Download ppt "On SVD-based watermarking algorithm"

Similar presentations


Ads by Google