1. Fast fragile watermark embedding and iterative mechanism with high self-restoration performance
Source : Digital Signal Processing. Vol. 73, pp , Feb
Authors : Sergio Bravo-Solorio, Felix Calderon, Chang-Tsun Li, Asoke K. Nandi.
Speaker : Si-Liang He
Date : 2019/4/25
山東大學

2. Outline
Introduction Related work Proposed scheme Experimental results Conclusions

3. + → → Introduction Authentication code Recovery information
Detection & Recovery →

4. Related work - Tornado code
𝑐 1 , 𝑐 2 , 𝑐 3 , 𝑐 4 , 𝑐 5 = =
𝑐 1 + 𝑐 3 + 𝑐 5 𝑚𝑜𝑑 2=0
𝑀 1 × =
𝑀 1 =
𝑀 2 × =
𝑀 2 =
(Modulo-2)

5. Related work - Tornado code
𝑐 5 =0

6. Proposed scheme flowchart

7. Proposed scheme – embedding
Authentication bits
32 bits = row num + column num + NumofBlock ⊕
32 bits = hash(reference bits)
L = 160 & block size = 8×8:
3 LSB = 8*8*3 = 192 bits
160 reference bits + 32 authentication bits

8. Experimental results

9. Experimental results
[24] X. Zhang, S. Wang, Z. Qian, G. Feng, “Reference sharing mechanism for watermark self-embedding,” IEEE Trans. Image Process, Vol. 20, Issue. 2, pp.  , Feb

10. Experimental results
[6] C. Qin, P. Ji, X. Zhang, J. Dong, J. Wang, “Fragile image watermarking with pixel-wise recovery based on overlapping embedding strategy,” Signal Process, Vol. 138, pp , Sep
[18] C. Qin, H. Wang, X. Zhang, X. Sun, “Self-embedding fragile watermarking based on reference-data interleaving and adaptive selection of embedding mode,” Information Sciences, Vol. 373, pp , Dec. 2016
[23] X. Zhang, S. Wang, Z. Qian, G. Feng, “Reference sharing mechanism for watermark self-embedding,” IEEE Trans. Image Process, Vol. 20, Issue. 2, pp.  , Feb

11. Conclusions
The image quality of the restored image can be completely restored to the watermarked image.
Average execution time is faster than other schemes.