{'fraction_non_alphanumeric': 0.012612612612612612, 'fraction_numerical': 0.0, 'mean_word_length': 4.673469387755102, '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}}
Optimal layer ordering in the compression of map images

The compression of color map images by context tree modeling and arithmetic coding was studied. The main aim of this approach is to utilize the correlations between the color layers of the image and to solve the optimal order of the layers as an optimum branching problem. The acquiring of the inter-layer dependencies is done by optimization of the context tree for every pair image layer. The cost matrix of the inter-layer dependencies is then solved by Edmond's algorithm for optimum branching.