{'fraction_non_alphanumeric': 0.010178117048346057, 'fraction_numerical': 0.0, 'mean_word_length': 5.5041322314049586, '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}}
ACCELERATION OF FRACTAL IMAGE COMPRESSION BY CORRELATION TREES

Methods of fractal image compression commonly suffer from a principal drawback dealing with rather intensive computations required. The reasons are briefly discussed and a novel method of lossy acceleration of a fractal image compression is proposed. This method is based on forecasting the correlation factors between range blocks and domain blocks. A variant of practical realization of the proposed method providing construction of domain blocks correlation tree is considered. The efficiency analysis of the proposed method is carried out for test images. The advantages of the proposed method in comparison to other acceleration methods are demonstrated. Finally, the directions of the further research are discussed.