{'fraction_non_alphanumeric': 0.015182186234817813, 'fraction_numerical': 0.0, 'mean_word_length': 5.773972602739726, '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}}
Image compression based on the Karhunen-Loeve color transform with Inverse Pyramid decomposition

In this paper is presented one new approach for efficient still image compression based on the Karhunen-Loeve color transform and the Inverse Pyramid decomposition. In result of the strong decorrelation between the color components after the transform, the image is successfully restored with retained image quality despite the significant reduction of the coefficients, used to compose the pyramidal representation. The presented approach permits flexible selection of the transform coefficients, together with corresponding quantization of their values. In result, it offers the ability to select a sequence of sets of coefficients, which produce restored images of consecutive increasing quality. The software implementation of the method in C++ confirmed its efficiency. A generalized part of the experimental results are presented in this paper together with corresponding conclusions.