{'fraction_non_alphanumeric': 0.01728395061728395, 'fraction_numerical': 0.0, 'mean_word_length': 5.366492146596858, '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}}
Efficient compression of sequences of medical and multispectral images

The paper presents a new algorithm for efficient compression of sequences of medical images, based on the Inverse Pyramid Decomposition, called Group coding. The same approach is adapted for the efficient archiving of multispectral images as well. The algorithm is based on joint processing of all images in a group, representing the same object, and obtained using sensors of changing light length (multispectral images) or after time intervals. The background of the new approach is the use of the Inverse Pyramid Decomposition, which performs leveled image representation with increasing quality of the approximations obtained in the consecutive decomposition levels. The coarsest approximation of one of the images in the group, selected to be used as a reference one, is used to calculate the next (better) approximations of the remaining images in the group. As a result, is obtained efficient compression of the processed groups of images, which is of high importance for their efficient archiving and storage in image databases. Numerous experiences were performed with satellite and medical images, which proved the method efficiency.