{'fraction_non_alphanumeric': 0.024509803921568627, 'fraction_numerical': 0.008169934640522876, 'mean_word_length': 5.13, '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}}
Fast Graph Segmentation Based on Statistical Aggregation Phenomena

In this paper, we first generalize a recent statistical color image segmentation algorithm [5] to arbitrary graphs, and report its performance for 2D images, 3D meshes and volume data. We then describe a fast pre-segmentation to the main graph procedure that allows us to further speed-up the segmentation by a factor of ×2 to ×4, without decreasing significantly the quality of segmentations. As an application, we built a realtime video segmentation that is robust enough to be used in camera-driven user interfaces and robotics applications.