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.