{'fraction_non_alphanumeric': 0.012558869701726845, 'fraction_numerical': 0.0, 'mean_word_length': 5.577319587628866, '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}}
Constrained and unconstrained simplification of image partitions encoded with the method of transition points

The encoding of image partitions plays a key role in the overall efficiency of the so-called region-based image coding techniques. A method based on the novel concept of "transition point" was previously proposed for the lossless encoding of arbitrary contour maps. This paper addresses the problem of partition simplification in the context of this new encoding method. A new simplification approach is introduced and results concerning its compression efficiency under constrained and unconstrained conditions are presented.