{'fraction_non_alphanumeric': 0.015734265734265736, 'fraction_numerical': 0.0, 'mean_word_length': 4.673267326732673, '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}}
Mean-matching halftoning on a rotated quad-tree structure

We describe a new halftoning algorithm that uses a multiscale dot distribution procedure over a rotated quad-tree structure. The algorithm ensures that the average graylevel of the grayscale image over any node of the rotated quad-tree is equal to that of the halftone at the same node. This is achieved by first deciding the total number of black and white dots to be placed over the entire halftone, and then distributing the dots recursively to the subregions represented by the nodes of the rotated quad-tree.