{'fraction_non_alphanumeric': 0.013429752066115703, 'fraction_numerical': 0.0, 'mean_word_length': 5.211538461538462, '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}}
Wolf Pack algorithm for a fractal image compression

The fractal image compression is a recent tool for encoding natural images. It builds on the local self-similarities and the generation of copies of blocks based on mathematical transformations. The technique seems interesting in both theory and application but have a drawback renders in real time usage due to the high resource requirement when encoding wide data. By another way, heuristics algorithms represent a set of approaches used to solve hard optimization tasks with rational resources consumption. They are characterized with their fast convergence and reducing of research complexity. The purpose of this paper is to provide, and for a first time, more detailed study about the Wolf Pack Algorithm for the fractal image compression. The performed experiments showed its effectiveness in the resolution of such problem. Moreover, a brief comparison with the exhaustive search establishes this advantage.