{'fraction_non_alphanumeric': 0.016816143497757848, 'fraction_numerical': 0.0011210762331838565, 'mean_word_length': 4.953333333333333, '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 Study of Prediction Measures for Lossy Image Set Compression

The automatic compression strategy proposed by Gergel et al. is a near-optimal lossy compression scheme for a given collection of images whose interimage relationships are unknown. Their algorithm uses the root mean square error (RMSE) as a measure of the similarity between two images, in order to predict the compressibility of the difference image. Gergel et al. found that RMSE performed well at high compression ratios, but it did not perform as well at lower compression ratios. This paper explores the choice of prediction measure by analyzing the performance of a number of different measures. The experimental results show that entropy performs better than RMSE at lower compression ratios. Furthermore, an adjusted L1-norm offers nearly the same performance as RMSE at high compression ratios but is easier to compute.