Fast fragile watermark embedding and iterative mechanism with high self-restoration performance Source : Digital Signal Processing. Vol. 73, pp. 83-92, Feb. 2018. Authors : Sergio Bravo-Solorio, Felix Calderon, Chang-Tsun Li, Asoke K. Nandi. Speaker : Si-Liang He Date : 2019/4/25 山東大學
Outline Introduction Related work Proposed scheme Experimental results Conclusions
+ → → Introduction Authentication code Recovery information Detection & Recovery →
Related work - Tornado code 𝑐 1 , 𝑐 2 , 𝑐 3 , 𝑐 4 , 𝑐 5 = 10100 = 1 0 1 0 0 𝑐 1 + 𝑐 3 + 𝑐 5 𝑚𝑜𝑑 2=0 𝑀 1 × 1 0 1 0 0 = 0 0 1 𝑀 1 = 1 0 0 0 1 0 1 0 1 0 1 1 1 1 1 𝑀 2 × 1 0 1 0 0 = 1 1 1 𝑀 2 = 0 1 1 0 0 1 1 0 1 0 1 0 1 1 0 (Modulo-2)
Related work - Tornado code 𝑐 5 =0
Proposed scheme flowchart
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
Experimental results
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. 485-495, Feb. 2011.
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. 280-293, Sep. 2017. [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. 233-250, 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. 485-495, Feb. 2011.
Conclusions The image quality of the restored image can be completely restored to the watermarked image. Average execution time is faster than other schemes.