A new spatial decomposition scheme for image content-based watermarking

Image watermarking has today a growing success in the community of image processing. Many methods were already proposed making it possible to obtain increasingly more powerful algorithms. So, most of insertion schemes in the spatial domain are based on the decomposition of the image to blocs, with similar sizes, in order to insert a sequence of information bits. To reach good performances, content-based watermarking schemes aim to use feature points detectors to link the mark with the content of the image. Feature points are after used to perform a decomposition based on a Delaunay triangulation, using triangular tessellation. These methods use classical geometrical transforms that generally induce a loss of synchronization that prevents the detection of the mark, and the image may lose some of its properties. In the proposed scheme, feature points detection are used to decompose the image using a rectangular tessellation and the mark is embedded in each rectangle of the decomposition. The proposed watermarking method, performed in spatial domain, is based on the image content, aims to be simple and to improves mark detection in comparison with methods based on triangular decomposition.