{'fraction_non_alphanumeric': 0.014756944444444444, 'fraction_numerical': 0.0, 'mean_word_length': 5.441340782122905, '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}}
Vector Polygon Blind Watermarking Based on Canonical Correlation Analysis

A vector polygon blind watermarking algorithm based on canonical correlation analysis (CCA) is proposed for protecting the copyright of vector polygon. In embedding, vertices of a polygon are separated into two groups according to odd-even properties of their indexes. CCA is carried out on the two vertex groups to get canonical variables. The absolute value of canonical variables is proved to be affine invariant so that it is called affine invariant descriptor. The watermark is embedded into the magnitude of Fourier descriptors of affine invariant descriptors. In detection, affine invariant descriptors are obtained through a same process as embedding. The correlation between magnitude of the Fourier descriptors of affine invariant descriptors and the watermark is calculated. The watermark can be detected by comparing the correlation to a pre-selected threshold. The algorithm is blind as it doesn't need the original graphics during detection. Both theoretical analysis and simulation results have demonstrated feasibility and reliability of the proposed algorithm.