{'fraction_non_alphanumeric': 0.01615798922800718, 'fraction_numerical': 0.0, 'mean_word_length': 5.2, '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}}
Parallel implementation of fractal image compression

Fractal image encoding is based on the self-similarity search between range and domain blocks. It can be parallelized in three different ways. In this paper, we first formulate the encoding process and then present one of the parallel implementations on KSRI (Kendall Square Research parallel computer). Experimental results include the encoding time as a function of the number of processors and the speedup curve. The speedup of the encoding process is significant when compared to serial computation.