{'fraction_non_alphanumeric': 0.019230769230769232, 'fraction_numerical': 0.0, 'mean_word_length': 4.97972972972973, '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}}
Minimum-entropy clustering and its application to lossless image coding

The minimum-entropy clustering (MEC) algorithm proposed in this paper provides an optimal method for addressing the non-stationarity of a source with respect to entropy coding. This algorithm clusters a set of vectors (where each vector consists of a fixed number of contiguous samples from a discrete source) using a minimum entropy criterion. In a manner similar to classified vector quantization (CVQ), a given vector is first classified into the class which leads to the lowest entropy and then its samples are coded by the entropy coder designed for that particular class. The MEC algorithm is used in the design of a lossless, predictive image coder. The MEC-based coder is found to significantly outperform the single entropy coder as well as the other popular lossless coders reported in the literature.