{'fraction_non_alphanumeric': 0.021454112038140644, 'fraction_numerical': 0.0, 'mean_word_length': 5.5625, '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}}
Uncommitted Morphological Merging of Watershed Segments

Over the past decades, watershed segmentation has gained much popularity due to its attractive properties: closer to what a human observer would decide, efficient implementation and elegant combination of edge- and region-based segmentation. Nevertheless, it is often associated with the problem of over-segmentation owing to its high sensitivity to variation in intensity. Various merging algorithms have been proposed to tackle this problem, but most of them are either user-dependent, knowledge-based, or computationally expensive. This paper presents a novel merging algorithm, which is automatic, uncommitted and yet computationally cheap. The algorithm is proposed based on a careful analysis of the roots of the spurious segments and on a morphological processing of the root