{'fraction_non_alphanumeric': 0.013293943870014771, 'fraction_numerical': 0.005908419497784343, 'mean_word_length': 4.947368421052632, '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}}
Fingerprints matching based on line similarity

A novel fingerprint matching algorithm based on the matching of lines is introduced in this paper. The algorithm were designed in three steps. In the first phase, an inaccurate set of matched line pairs were built by matching lines between two fingerprints. In the second phase, the spurious pairs were removed from the set by evaluating the similarity of triangles composed by line and central point. In the third phase, pairs of minutiae that composed the line pair were used to measure the comprehensive similarity of two fingerprints. Experiments show the proposed method works well over the fingerprint databases of FVC2002.