Chapter 5
Fingerprint Biometric Data Indexing
In fingerprint identification system, when the size of database is very large, a one-to-one matching makes the system extremely slow. The objective of this work is to achieve a faster retrieval of fingerprint match by indexing the database. A fingerprint indexing technique is proposed based on multi-dimensional invariable set of feature vectors. A new scheme for generating index key from minutiae triplets is introduced and the local topology of minutiae using two nearest points triangle is considered in this approach. Three different indexing techniques (linear, clustered and clustered kd-tree) are investigated with invariable set of features for a fingerprint identification system. The major steps ...
Get Unimodal and Multimodal Biometric Data Indexing now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
