{'fraction_non_alphanumeric': 0.014423076923076924, 'fraction_numerical': 0.0, 'mean_word_length': 5.848684210526316, '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}}
Fingerprint indexing based on minutiae-dependent statistical codes

Methods based on minutiae matching have been extensively used in fingerprint recognition because minutiae can be reliably extracted from poor quality and noisy fingerprints. However, structures have to be defined due to minutiae displacements and irreproducibility. Some of the structures, though very efficient, incur large computational complexities. In this article, a feature vector of statistically based values derived from the minutiae pattern in a fingerprint is proposed for indexing fingerprints using the incremental search retrieval method. The proposed indexing technique in combination with the incremental retrieval method proves to have an added advantage over certain minutiae-based structures, especially when the minutiae points are numerous in a fingerprint. The feature vector for a fingerprint requires negligible storage resources and, consequently, the computational time in the retrieval of a candidate list for a query fingerprint is very little.