{'fraction_non_alphanumeric': 0.030985915492957747, 'fraction_numerical': 0.016901408450704224, 'mean_word_length': 4.642857142857143, '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}}
On the Chain Code of a Line

In 1970 Freeman suggested the following criteria which the chain code of a line must meet [1], [2]: 1) at most two basic directions are present and these can differ only by unity, modulo eight, 2) one of these values always occurs singly, 3) successive occurrences of the principal direction occurring singly are as uniformly spaced as possible. In this correspondence we give the following: 1) an algorithm presentation of Freeman's three properties about the chain code of a line and the proof that it is also the algorithm recognizing whether a chain code is the chain code of a line, 2) the proof of the equivalence of the above presentation and Rosenfeld's chord property [3].