{'fraction_non_alphanumeric': 0.01585820895522388, 'fraction_numerical': 0.011194029850746268, 'mean_word_length': 5.5426829268292686, '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}}
Finger Code Matching Algorithm Using Circular Tessellation

Due to the rising concern of data security and privacy, fingerprint recognition has been used for identity verification. This paper presents a minutiae-based finger code matching algorithm for identity verification. It describes the effect of using different circular neighborhood minutiae tessellation sizes to generate a finger code for identity verification using a fingerprint. The analyses of how the matching accuracy is affected using different sizes of circular neighborhood minutiae tessellations are described. A minutiae-based matching algorithm using multiple reference minutiae to generate a finger code is presented. The proposed finger code matching algorithm offers the advantage of improved matching speed due to the usage of binary codes and it can also be implemented on embedded platforms such as smart cards. The finger code matching algorithm obtained the highest matching accuracy of 7.03% Equal Error Rate (EER) using database DB1-b of Fingerprint Verification Competition 2002 (FVC2002).