{'fraction_non_alphanumeric': 0.014308426073131956, 'fraction_numerical': 0.0, 'mean_word_length': 5.631578947368421, '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}}
The Redundancy Pyramid and its Application to Image Segmentation

Irregular pyramids organise several topological partitions which can be deduced from a partition (called the base of the pyramid) by successive unions of regions. In this paper, we introduce the redundancy pyramid structure. This structure accounts for redundant topological structures present in several topological partitions. We apply it to the problem of segmentation fusion, where we show that using the redundancy of the boundaries of several partitions leads to useful segmentations. These are evaluated using a publically available segmentation benchmark.