Quality Studies of an Invisible Chaos-Based Watermarking Scheme with Message Extraction

This paper takes place in the field of invisible chaos-based watermarking schemes. It addresses the quality study of an already pyblished algorithm by focusing on three class of properties. Its robustness is experimentally shown against classical attacks on a large set of image instances and image transformations. It correctness and completness are formally proven. Due to this main advantages, this process is fitted for practical use.

[1]  Li Wenbo,et al.  A chaos-based robust wavelet-domain watermarking algorithm , 2004 .

[2]  Tomás Pevný,et al.  "Break Our Steganographic System": The Ins and Outs of Organizing BOSS , 2011, Information Hiding.

[3]  Bernadette Bouchon-Meunier,et al.  Discrimination power of measures of resemblance , 2003 .

[4]  Jacques M. Bahi,et al.  Chaotic iterations for steganography - Stego-security and chaos-security , 2011, Proceedings of the International Conference on Security and Cryptography.

[5]  Li Zhiquan,et al.  A Robust Chaos-Based DCT-Domain Watermarking Algorithm , 2008, 2008 International Conference on Computer Science and Software Engineering.