Abstract
The majority of traditional research into automated fingerprint identification has focused on algorithms using minutiae-based features. However, shortcomings of this approach are becoming apparent due to the difficulty of extracting minutiae points from noisy or low-quality images. Therefore, there has been increasing interest in algorithms based on nonminutiae features in recent years. One vital stage in most fingerprint verification systems is registration, which involves recovering the transformation parameters that align features from each fingerprint. This paper investigates the use of orientation fields for registration; an approach that has the potential to perform robustly for poor-quality images. Three diverse algorithms have been implemented for the task. The first algorithm is based on the generalized Hough transform, and it works by accumulating evidence for transformations in a discretized parameter space. The second algorithm is based on identifying distinctive local orientations, and using these as landmarks for alignment. The final algorithm follows the path of steepest descent in the parameter space to quickly find solutions that are locally optimal. The performance of these three algorithms is evaluated using an FVC2002 dataset.
Highlights
Fingerprints have been used as a means of personal identification for over a century
The first algorithm is based on the generalized Hough transform, and it works by accumulating evidence for transformations in a discretized parameter space
Fingerprint matching algorithms are based on comparing features from one print against those from another fingerprint, and this process is usually composed of several stages
Summary
Fingerprints have been used as a means of personal identification for over a century. The administration and querying of such large databases relies heavily on automated systems, thereby motivating the early research efforts in the field. Another application of fingerprint-based identification that has emerged more recently is biometric systems. Due to the continuing needs of law enforcement and interest from the developers of biometric systems, efficient automated fingerprint identification systems (AFISs) are becoming increasingly widespread and are being extensively researched by the pattern recognition community. The second algorithm is based on identifying distinctive local orientations, and using these as landmarks for alignment. Registration using orientation fields is introduced, along with three algorithms implementing this concept.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
