{'fraction_non_alphanumeric': 0.014804845222072678, 'fraction_numerical': 0.0026917900403768506, 'mean_word_length': 4.314285714285714, '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}}
An Efficient Quick Thinning Algorithm

A new thinning algorithm is addressed in this paper. The most important feature in this paper is that it thins symbols to their central lines with high speed. This means that the method is rotation invariant. Compared to the method of Ahmed and Ward, it can improve the speed and solve their falls on two-pixel wide lines. The method in this paper contains two steps. The first one uses the concept of weight-value to separate the rules into 6 groups in order to improve the speed of thinning; The second one uses 2 rules to make sure that the skeleton is single pixel and can preserve the connectivity. The results show that this method has good effect on preserving the topology of symbols and letters.