{'fraction_non_alphanumeric': 0.015064562410329985, 'fraction_numerical': 0.0014347202295552368, 'mean_word_length': 4.987124463519313, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Geometrical and frequential watermarking scheme using similarities

Watermarking schemes are more and more robust to classical degradations. The NEC system developed by Cox, using both original and marked images, can detect the mark with a JPEG compression ratio of 30. Nevertheless a very simple geometric attack done by the program Stirmark can remove the watermark. Most of the present watermarking schemes only map a mark on the image without geometric reference and therefore are not robust to geometric transformation. We present a scheme based on the modification of a collage map (issued from a fractal code used in fractal compression). We add a mark introducing similarities in the image. The embedding of the mark is done by selection of points of interest supporting blocks on which similarities are hided. This selection is done by the Stephens-Harris detector. The similarity is embedded locally to be robust to cropping. Contrary to many schemes, the reference mark used for the detection comes from the marked image and thus undergoes geometrical distortions. The detection of the mark is done by searching interest blocks and their similarities. It does not use the original image and the robustness is guaranteed by a key. Our first results show that the similarities-based watermarking is quite robust to geometric transformation such as translations, rotations and cropping.