{'fraction_non_alphanumeric': 0.019693654266958426, 'fraction_numerical': 0.0, 'mean_word_length': 4.725, '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 New Connected Component Analysis Algorithm Based on Max-Tree

In the field of image segmentation, because of the exist of the noise dot and misjudgment, hollows and the unexpected image are unavoidable. In order to get a high quality segmented image the process of connected component analysis is necessary. This paper proposed a new algorithm that used a kind of tree-structure named Max-Tree, the experiment shows this method has a high practical value.