{'fraction_non_alphanumeric': 0.015780730897009966, 'fraction_numerical': 0.0, 'mean_word_length': 5.17948717948718, '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}}
CONTENT-BASED WATERMARKING ROBUST TO BOTH AFFINE AND JPEG DISTORTIONS

The problem of reliably detecting watermarks in digital images has been given much examination and experimentation. Many approaches to date have been focused on repelling attacks along one of two main branches: either JPEG compression or affine distortions. This paper presents a blind dualapproach to combat both types of attacks. In order to maintain and determine watermark presence against JPEG compression, a binary watermark string is interleaved and embedded in the discrete wavelet domain. A second watermark is used to ally the effects of geometric (i.e., rotation, scale) attacks. Significant feature points are extracted from the image using a controlled Harris corner detector and subsequently used to compute the Delaunay tessellation. The watermark is then embedded separately into each of the triangles produced by this tessellation. The success of the extraction process is based on correlation values calculated from each of the triangles. If the image is distorted via JPEG compression to the extent that detection in the triangles is not possible, we then attempt to retrieve the watermark from the wavelet domain.