2000 character limit reached
A new chaos-based watermarking algorithm
Published 31 Oct 2015 in cs.MM | (1511.00118v1)
Abstract: This paper introduces a new watermarking algorithm based on discrete chaotic iterations. After defining some coefficients deduced from the description of the carrier medium, chaotic discrete iterations are used to mix the watermark and to embed it in the carrier medium. It can be proved that this procedure generates topological chaos, which ensures that desired properties of a watermarking algorithm are satisfied.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.