Fingerprint Classification Algorithm Research Articles

A Scattering Wavelet Network-based Approach to Fingerprint Classification

In a large-scale automatic fingerprint identification system (AFIS), fingerprint classification is an essential indexing step to reduce the search time in a large database for accurate matching. Fingerprint classification is still a challenging machine learning problem due to large intra-class and small inter-class variability. Nonlinear elastic deformation is one of the main sources of intra-class variability, which occurs due to the non-uniform pressure applied during fingerprint acquisition and the elastic nature of the fingerprint itself. This paper proposes a novel approach to fingerprint classification based on a scattering wavelet network to extract translation and small deformation invariant local features. The resulting sparse invariant feature vectors are used as input to a simple generative PCA affine classifier for the classification. The experiments evaluated with two different protocols on a benchmark NIST SD-4 database show the effectiveness and robustness of the proposed fingerprint classification algorithm in terms of classification accuracy.

Finger Print Authentication on Web-Services One Step to Next Security

The system that automatically identifies the anthropometric fingerprint is one of the systems that interact directly with the user, which every day will be provided with a diverse database. This requires the system to be optimized to handle the process to meet the needs of users such as fast processing time, almost absolute accuracy, no errors in the real process. Therefore, in this paper, we propose the application of machine learning methods to develop fingerprint classification algorithms based on the singularity feature. The goal of the paper is to reduce the number of comparisons in automatic fingerprint recognition systems with large databases. The combination of using computer vision algorithms in the image pre-processing stage increases the calculation time, improves the quality of the input images, making the process of feature extraction highly effective and the classification process fast and accurate. The classification results on 3 datasets with the criteria for Precision, Recall, Accuracy evaluation and ROC analysis of algorithms show that the Random Forest (RF) algorithm has the best accuracy (≥96.75%) on all 3 databases, Support Vector Machine (SVM) has the best results (≥95.5%).

Lightweight Convolutional Neural Network Based on Singularity ROI for Fingerprint Classification

Fingerprint classification is a significant guarantee for efficient and accurate fingerprint recognition, especially when dealing with one-to-many fingerprint recognition. However, due to large intra-class variability, small inter-class variability, and noise, existing fingerprint classification algorithms still require further improvement in performance and efficiency. In this paper, a Lightweight CNN (Convolutional Neural Network) structure based on singularity ROI (region of interest) is proposed. The experimental results show that the accuracy on testing set of the proposed structure achieves 93%, which is far better than classic non-NN (neural network) classifiers, including RF(Random Forest), KNN (K- Nearest-Neighbor), LR (Logistic Regression), Linear SVM (Support Vector Machine), and RBF (Radial Basis Function) SVM. More momentously, compared with other three CNN structures published in recent years, the proposed structure achieves similar or even better performance with 1/12 to 1/38 parameter scale of other structures, which helps to proceed faster training and testing. Moreover, the proposed CNN model with fewer neurons can achieve better suppression of overfitting and robustness to noise.

Fingerprint classification and identification algorithms for criminal investigation: A survey

Fingerprint plays a fundamental role in community security and criminal investigation, such as forensic investigation, law enforcement, customs access and public security organs. This can also help to provide a more enjoyable and secure life to people. Various machine learning and neural network approaches have been proposed for fingerprint acquisition, detection, classification, and analysis. In this survey, we present an up-to-date literature evaluation of fingerprint classification algorithms and fingerprint application in the area of criminal investigation. Firstly, we discuss the characteristics of fingerprint and the application in criminal investigation. In addition, we analyze and compare machine learning algorithms of fingerprint in terms of classification, matching, feature extraction, fingerprint and finger-vein recognition, and spoof detection. Finally, we highlight the challenges in the fingerprint analysis and discuss the future directions.

Fingerprints Classification through Image Analysis and Machine Learning Method

The system that automatically identifies the anthropometric fingerprint is one of the systems that interact directly with the user, which every day will be provided with a diverse database. This requires the system to be optimized to handle the process to meet the needs of users such as fast processing time, almost absolute accuracy, no errors in the real process. Therefore, in this paper, we propose the application of machine learning methods to develop fingerprint classification algorithms based on the singularity feature. The goal of the paper is to reduce the number of comparisons in automatic fingerprint recognition systems with large databases. The combination of using computer vision algorithms in the image pre-processing stage increases the calculation time, improves the quality of the input images, making the process of feature extraction highly effective and the classification process fast and accurate. The classification results on 3 datasets with the criteria for Precision, Recall, Accuracy evaluation and ROC analysis of algorithms show that the Random Forest (RF) algorithm has the best accuracy (≥96.75%) on all 3 databases, Support Vector Machine (SVM) has the best results (≥95.5%) 2 / 3 databases.

Comparative Analysis of Fingerprint Classification Algorithms- A review

International Journal of Computer Sciences and Engineering (A UGC Approved and indexed with DOI, ICI and Approved, DPI Digital Library) is one of the leading and growing open access, peer-reviewed, monthly, and scientific research journal for scientists, engineers, research scholars, and academicians, which gains a foothold in Asia and opens to the world, aims to publish original, theoretical and practical advances in Computer Science,Information Technology, Engineering (Software, Mechanical, Civil, Electronics & Electrical), and all interdisciplinary streams of Computing Sciences. It intends to disseminate original, scientific, theoretical or applied research in the field of Computer Sciences and allied fields. It provides a platform for publishing results and research with a strong empirical component. It aims to bridge the significant gap between research and practice by promoting the publication of original, novel, industry-relevant research.

Face Recognition Using Sparse Fingerprint Classification Algorithm

Unconstrained face recognition is still an open problem as the state-of-the-art algorithms have not yet reached high recognition performance in real-world environments. This paper addresses this problem by proposing a new approach called sparse fingerprint classification algorithm (SFCA). In the training phase, for each enrolled subject, a grid of patches is extracted from each subject’s face images in order to construct representative dictionaries. In the testing phase, a grid is extracted from the query image and every patch is transformed into a binary sparse representation using the dictionary, creating a fingerprint of the face. The binary coefficients vote for their corresponding classes and the maximum-vote class decides the identity of the query image. Experiments were carried out on seven widely-used face databases. The results demonstrate that when the size of the data set is small or medium ( e.g. , the number of subjects is not greater than one hundred), SFCA is able to deal with a larger degree of variability in ambient lighting, pose, expression, occlusion, face size, and distance from the camera than other current state-of-the-art algorithms.

Graph-based fingerprint classification using orientation field in core area

In this paper, we present a graph-based fingerprint classification algorithm that deals with ones collected from touch scanners. A relational graph, which reflects distribution of ridge directions in an orientation field, is constructed with additional emphasis on the distribution of the ridges inside the core area that is defined to minimize external influences. For classification, a general edit distance scheme is employed to measure the similarity between the constructed graph and pre-trained graph models. Experimental results using a database in FVC2004 show that the proposed algorithm has higher classification accuracy than other structural approaches.

Fingerprint classification based on Adaboost learning from singularity features

Fingerprint classification is an important indexing scheme to narrow down the search of fingerprint database for efficient large-scale identification. It is still a challenging problem due to the intrinsic class ambiguity and the difficulty for poor quality fingerprints. In this paper, we presents a fingerprint classification algorithm that uses Adaboost learning method to model multiple types of singularity features. Firstly, complex filters are used to detect the singularities. For powerful representation, we compute the complex filter responses of the detected singularities at multiple scales and a feature vector is constructed for each scale that consists of the relative position and direction and the certainties of the singularities. Adaboost learning method is then applied on decision trees to design a classifier for fingerprint classification. Finally, fingerprint class is determined by the ensemble of the classification results at multiple scales. The experimental results and comparisons on NIST-4 database have shown the effectiveness and superiority of the fingerprint classification algorithm.

Efficient Fingercode Classification

In this paper, we present an efficient fingerprint classification algorithm which is an essential component in many critical security application systems e.g. systems in the e-government and e-finance domains. Fingerprint identification is one of the most important security requirements in homeland security systems such as personnel screening and anti-money laundering. The problem of fingerprint identification involves searching (matching) the fingerprint of a person against each of the fingerprints of all registered persons. To enhance performance and reliability, a common approach is to reduce the search space by firstly classifying the fingerprints and then performing the search in the respective class. Jain et al. proposed a fingerprint classification algorithm based on a two-stage classifier, which uses a K-nearest neighbor classifier in its first stage. The fingerprint classification algorithm is based on the fingercode representation which is an encoding of fingerprints that has been demonstrated to be an effective fingerprint biometric scheme because of its ability to capture both local and global details in a fingerprint image. We enhance this approach by improving the efficiency of the K-nearest neighbor classifier for fingercode-based fingerprint classification. Our research firstly investigates the various fast search algorithms in vector quantization (VQ) and the potential application in fingerprint classification, and then proposes two efficient algorithms based on the pyramid-based search algorithms in VQ. Experimental results on DB1 of FVC 2004 demonstrate that our algorithms can outperform the full search algorithm and the original pyramid-based search algorithms in terms of computational efficiency without sacrificing accuracy.

A DIRECTIONAL APPROACH TO FINGERPRINT CLASSIFICATION

In this article, we present a new fingerprint classification algorithm. Singular points are first extracted from enhanced fingerprint direction images with a resolution of 2 × 2 pixels by the modified SEA algorithm. Based on the number of singular points, fingerprints are categorized into types of "arch", "whorl", and "solitary". Solitary fingerprints are properly rotated and then further processed to generate direction patterns that lead to establishment of individual direction template. Direction constraints are formed and derived from pattern descriptors by their structural layout. Decision rules are then established and pattern templates are classified into three more types: "right loop", "left loop", and "tented arch". NIST-4 database was used for an experimental test, and our classification accuracy was 91.62% with 1.55% rejection on the five-class system (94.38% on the four-class system), which is the best result on the five-class system to-date. An additional experiment on NIST-14 database reports 89.15% accuracy with 3.07% rejection.

Localization of Singular Points in Fingerprint Images Based on the Gaussian-Hermite Moments

In most fingerprint classification and identification algorithms, extracting the number and precise location of singular points (core and delta) is of great importance. In this paper, an adaptive algorithm for singular points detection is proposed, which is based on the behavior of Gaussian-Hermite moments. In order to detect singular point accurately, the distribution of Gaussian-Hermite moments of different orders of the fingerprint image in multiple scales is used. A PCA-based (principal component analysis) method is used to analyze the distribution of Gaussian-Hermite of fingerprint image. Experimental results show that the proposed algorithm is able to locate singular points in fingerprint with high accuracy.

Fingerprint classification using a feedback-based line detector.

We present a fingerprint classification algorithm in this paper. This algorithm classifies a fingerprint image into one of the five classes: Arch, Left loop, Right loop, Whorl, and Tented arch. We use a new low-dimensional feature vector obtained from the output of a novel oriented line detector presented here. Our line detector is a co-operative dynamical system that gives oriented lines and preserves multiple orientations at points where differently oriented lines meet. Our feature extraction process is based on characterizing the distribution of orientations around the fingerprint. We discuss three different classifiers: support vector machines, nearest-neighbor classifier, and neural network classifier. We present results obtained on a National Institute of Standards and Technology (NIST) fingerprint database and compare with other published results on NIST databases. All our classifiers perform equally well, and this suggests that our novel line detection and feature extraction process indeed captures all the crucial information needed for classification in this problem.

Combining flat and structured representations for fingerprint classification with recursive neural networks and support vector machines

We present new fingerprint classification algorithms based on two machine learning approaches: support vector machines (SVMs) and recursive neural networks (RNNs). RNNs are trained on a structured representation of the fingerprint image. They are also used to extract a set of distributed features of the fingerprint which can be integrated in the SVM. SVMs are combined with a new error-correcting code scheme. This approach has two main advantages: (a) It can tolerate the presence of ambiguous fingerprint images in the training set and (b) it can effectively identify the most difficult fingerprint images in the test set. By rejecting these images the accuracy of the system improves significantly. We report experiments on the fingerprint database NIST-4. Our best classification accuracy is of 95.6 percent at 20 percent rejection rate and is obtained by training SVMs on both FingerCode and RNN-extracted features. This result indicates the benefit of integrating global and structured representations and suggests that SVMs are a promising approach for fingerprint classification.

Fingerprints classification using artificial neural networks: a combined structural and statistical approach

This paper describes a fingerprint classification algorithm using Artificial Neural Networks (ANN). Fingerprints are classified into six categories: arches, tented arches, left loops, right loops, whorls and twin loops. The algorithm extracts a string of symbols using the block directional image of a fingerprint, which represents the set of structural features for this image. The moment representing the statistical feature of the pattern is computed for this string and its Euclidean Distance Measures (EDM) are computed by using this moment. Our discrimination system uses a multilayer artificial neural network composed of six subnetworks one for each class. The classifier was tested on 1500 images of good quality in the Egyptian Fingerprints database; images with poor quality were rejected. In the six-class problem the network achieved 95% classification accuracy. In the five-class problem when we place whorls and twin loops together in the same category the classification accuracy was around 99%. In the four-class problem when we place arches and tented arches in the same class the classification accuracy was 99%.

A combination fingerprint classifier

Fingerprint classification is an important indexing method for any large scale fingerprint recognition system or database as a method for reducing the number of fingerprints that need to be searched when looking for a matching print. Fingerprints are generally classified into broad categories based on global characteristics. This paper describes novel methods of classification using hidden Markov models and decision trees to recognize the ridge structure of the print, without needing to detect singular points. The methods are compared and combined with a standard fingerprint classification algorithm and results for the combination are presented using a standard database of fingerprint images. The paper also describes a method for achieving any level of accuracy required of the system by sacrificing the efficiency of the classifier. The accuracy of the combination classifier is shown to be higher than that of the two state-of-the-art systems tested under the same conditions.

A multichannel approach to fingerprint classification

Fingerprint classification provides an important indexing mechanism in a fingerprint database. An accurate and consistent classification can greatly reduce fingerprint matching time for a large database. We present a fingerprint classification algorithm which is able to achieve an accuracy better than previously reported in the literature. We classify fingerprints into five categories: whorl, right loop, left loop, arch, and tented arch. The algorithm uses a novel representation (FingerCode) and is based on a two-stage classifier to make a classification. It has been tested on 4000 images in the NIST-4 database. For the five-class problem, a classification accuracy of 90 percent is achieved (with a 1.8 percent rejection during the feature extraction phase). For the four-class problem (arch and tented arch combined into one class), we are able to achieve a classification accuracy of 94.8 percent (with 1.8 percent rejection). By incorporating a reject option at the classifier, the classification accuracy can be increased to 96 percent for the five-class classification task, and to 97.8 percent for the four-class classification task after a total of 32.5 percent of the images are rejected.

Fingerprint classification

A fingerprint classification algorithm is presented in this paper. Fingerprints are classified into five categories: arch, tented arch, left loop, right loop and whorl. The algorithm extracts singular points (cores and deltas) in a fingerprint image and performs classification based on the number and locations of the detected singular points. The classifier is invariant to rotation, translation and small amounts of scale changes. The classifier is rule-based, where the rules are generated independent of a given data set. The classifier was tested on 4000 images in the NIST-4 database and on 5400 images in the NIST-9 database. For he NIST-4 database, classification accuracies of 85.4% for the five-class problem and 91.1% for the four-class problem (with arch and tented arch placed in the same category) were achieved. Using a reject option, the four-class classification error can be reduced to less than 6% with 10% fingerprint images rejected. Similar classification performance was obtained on the NIST-9 database.