Roll of Fingerprint Identification/Recognition Techniques in Biometric Systems and its Applications

Fingerprint identification (FPR) is a standout amongst the most outstanding and advanced biometrics. On account of their uniqueness and consistency after some time, fingerprints have been utilized for recognizable proof for over a century, all the more as of late getting to be computerized because of progressions in figuring abilities. Fingerprint identification is mainstream due to the innate straightforwardness in securing, the various sources (10 fingers) accessible for accumulation, and their set up utilize and accumulations by law requirement and movement [1]. In this paper we studied about the importance and different areas of fingerprint identification. We also discuss about the applications of fingerprint identifications. This paper presents outline of a fundamental FPR framework, different FPR systems and difficulties

Hand Geometry Techniques: A Review

Volume 2 Issue 11 (November 2014

Invariant Object Recognition Using Radon-based Transform

The properties of the Radon transform are used to derive the transformation invariant to translation, rotation and scaling. The invariant transformation involves translation compensation, angle representation and 1-D Fourier transform. The new object recognition method is studied experimentally in two domains, mammogram labels recognition and face recognition. For mammogram labels, the recognition accuracy is 97 %, while in case of faces it reaches 96 %

Improvement of fingerprint retrieval by a statistical classifier

The topics of fingerprint classification, indexing, and retrieval have been studied extensively in the past decades. One problem faced by researchers is that in all publicly available fingerprint databases, only a few fingerprint samples from each individual are available for training and testing, making it inappropriate to use sophisticated statistical methods for recognition. Hence most of the previous works resorted to simple $k$-nearest neighbor ($k$-NN) classification. However, the $k$-NN classifier has the drawbacks of being comparatively slow and less accurate. In this paper, we tackle this problem by first artificially expanding the set of training samples using our previously proposed spatial modeling technique. With the expanded training set, we are then able to employ a more sophisticated classifier such as the Bayes classifier for recognition. We apply the proposed method to the problem of one-to-$N$ fingerprint identification and retrieval. The accuracy and speed are evaluated using the benchmarking FVC 2000, FVC 2002, and NIST-4 databases, and satisfactory retrieval performance is achieved. © 2010 IEEE.published_or_final_versio

Automatic fingerprint classification scheme using template matching with new set of singular point-based features

Fingerprint classification is a technique used to assign fingerprints into five established classes namely Whorl, Left loop, Right loop, Arch and Tented Arch based on their ridge structures and singular points’ trait. Although some progresses have been made thus far to improve accuracy rates, problem arises from ambiguous fingerprints is far from over, especially in large intra-class and small inter-class variations. Poor quality images including blur, dry, wet, low-contrast, cut, scarred and smudgy, are equally challenging. Thus, this thesis proposes a new classification technique based on template matching using fingerprint salient features as a matching tool. Basically, the methodology covers five main phases: enhancement, segmentation, orientation field estimation, singular point detection and classification. In the first phase, it begins with greyscale normalization, followed by histogram equalization, binarization, skeletonization and ends with image fusion, which eventually produces high quality images with clear ridge flows. Then, at the beginning of the second phase, the image is partitioned into 16x16 pixels blocks - for each block, local threshold is calculated using its mean, variance and coherence. This threshold is then used to extract a foreground. Later, the foreground is enhanced using a newly developed filling-in-the-gap process. As for the third phase, a new mask called Epicycloid filter is applied on the foreground to create true-angle orientation fields. They are then grouped together to form four distinct homogenous regions using a region growing technique. In the fourth phase, the homogenous areas are first converted into character-based regions. Next, a set of rules is applied on them to extract singular points. Lastly, at the classification phase, basing on singular points’ occurrence and location along to a symmetric axis, a new set of fingerprint features is created. Subsequently, a set of five templates in which each one of them represents a specific true class is generated. Finally, classification is performed by calculating a similarity between the query fingerprint image and the template images using x2 distance measure. The performance of the current method is evaluated in terms of accuracy using all 27,000 fingerprint images acquired from The National Institute of Standard and Technology (NIST) Special Database 14, which is de facto dataset for development and testing of fingerprint classification systems. The experimental results are very encouraging with accuracy rate of 93.05% that markedly outpaced the renowned researchers’ latest works