{'fraction_non_alphanumeric': 0.009735744089012517, 'fraction_numerical': 0.0, 'mean_word_length': 4.950413223140496, '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}}
Realization of Fast Median Filter Algorithm Based on the Relevance between Windows

Through thinking deeply on the algorithm of standard median filter, the algorithm is improved in order to make it faster. A fast filtering algorithm is proposed with the help of the relevance between filtering windows. The improved algorithm takes the indexes of the array storing the data of an image as media cleverly and takes the method combining the one-time total ordering with insertion sorting to reduce the time of comparison and movement greatly. The result of actual test indicates that using the improved median filter algorithm, the processing speed is promoted much on the premise of holding the effect of removing noise.