{'fraction_non_alphanumeric': 0.012396694214876033, 'fraction_numerical': 0.0, 'mean_word_length': 5.333333333333333, '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}}
A FEATURE DIFFERENCE ALGORITHM IN FRACTAL IMAGE CODING

Fractal image compression has received much attention for its desirable properties like resolution independence, fast decoding and high compression ratio. Despite the advances made, the long computing times in the encoding phase still remain the main drawback of this technique. So far, several methods have been proposed in order to speed up fractal image coding. In this paper, some commonly used speed up algorithms are introduced briefly, and a new algorithm is put forward, which uses notation of feature difference based on the contraction characteristics of transformations in fractal image coding. The algorithm can be simply realized in corporation with many other speedup methods and efficiently exclude pseudo matched blocks in D R matching and searching process. Experimental result shows that the algorithm not only speedups the coding process but also greatly improves the quality of decoded image.