{'fraction_non_alphanumeric': 0.019498607242339833, 'fraction_numerical': 0.0, 'mean_word_length': 4.9421487603305785, '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 robust simple linear iterative clustering algorithm

This paper presents a novel superpixel algorithm — a robust simple linear iterative clustering (R_SLIC) algorithm. The traditional SLIC algorithm is allergic to noise. In order to increase the robustness of the algorithm and make it noise-insensitive, we modify the framework of SLIC by supplementing a regularized term. The regularized term can balance the effect of various parts. What's more, the initial step of assigning seeds is also modified to avoid locating the center on an edge and reduce the opportunity of choosing a noisy pixel as the center. From the experimental results, it is demonstrated that the proposed algorithm is fast and robust to noise.