False Acceptance Error Research Articles

A Framework for Continuous Authentication Based on Touch Dynamics Biometrics for Mobile Banking Applications.

As smart devices have become commonly used to access internet banking applications, these devices constitute appealing targets for fraudsters. Impersonation attacks are an essential concern for internet banking providers. Therefore, user authentication countermeasures based on biometrics, whether physiological or behavioral, have been developed, including those based on touch dynamics biometrics. These measures take into account the unique behavior of a person when interacting with touchscreen devices, thus hindering identitification fraud because it is hard to impersonate natural user behaviors. Behavioral biometric measures also balance security and usability because they are important for human interfaces, thus requiring a measurement process that may be transparent to the user. This paper proposes an improvement to Biotouch, a supervised Machine Learning-based framework for continuous user authentication. The contributions of the proposal comprise the utilization of multiple scopes to create more resilient reasoning models and their respective datasets for the improved Biotouch framework. Another contribution highlighted is the testing of these models to evaluate the imposter False Acceptance Error (FAR). This proposal also improves the flow of data and computation within the improved framework. An evaluation of the multiple scope model proposed provides results between 90.68% and 97.05% for the harmonic mean between recall and precision (F1 Score). The percentages of unduly authenticated imposters and errors of legitimate user rejection (Equal Error Rate (EER)) are between 9.85% and 1.88% for static verification, login, user dynamics, and post-login. These results indicate the feasibility of the continuous multiple-scope authentication framework proposed as an effective layer of security for banking applications, eventually operating jointly with conventional measures such as password-based authentication.

False-Accept/False-Reject Trade-Offs for Ensembles of Biometric Authentication Systems

Biometric authentication systems, based on secret key generation, work as follows. In the enrollment stage, an individual provides a biometric signal that is mapped into a secret key and a helper message, the former being prepared to become available to the system at a later time (for authentication), and the latter is stored in a public database. When an authorized user requests authentication, claiming his/her identity to be one of those of the subscribers, he/she has to provide a biometric signal again, and then the system, which retrieves also the helper message of the claimed subscriber, produces an estimate of the secret key that is finally compared to the secret key of the claimed user. In the case of a match, the authentication request is approved; otherwise, it is rejected. Evidently, there is an inherent tension between two desired, but conflicting, properties of the helper message encoder; on the one hand, the encoding should be informative enough concerning the identity of the real subscriber, in order to approve him/her in the authentication stage, but on the other hand, it should not be too informative, as otherwise, unauthorized imposters could easily fool the system and gain access. A good encoder should then trade off the two kinds of errors: the false reject (FR) error and the false accept (FA) error. In this paper, we investigate trade-offs between the random coding FR error exponent and the best achievable FA error exponent. We compare two types of ensembles of codes: fixed-rate codes and variable-rate codes, and we show that the latter class of codes offers considerable improvement compared to the former. In doing this, we characterize ensemble-optimal rate functions for both types of codes. We also examine the effect of privacy leakage constraints for both fixed-rate codes and variable-rate codes

Palm Vein Recognition System Based on Derived Pattern and Feature Vectors

Biometrics is a technology for recognition under which Palm vein recognition stems. They are of crucial importance in various applications of high sensitivity. This article develops a palm vein recognition model, based on derived pattern and feature vectors. All the palm print images used in this work were obtained from CASIA Multi-Spectral Palmprint Image Database V1.0 (CASIA database). First, a Region of Interest (ROI) was identified and extracted from the palm print images. Next, Histogram Equalization was used to enhance the area of the palm print image in the Region of Interest. The enhanced image obtained was subjected to the Zhang Suen's Thinning Algorithm to extract appropriate features in the palm print images needed for authentication. The features derived based on this vascular pattern thinning algorithm which are then compared and evaluated to carry out ‘matching'. The Pattern Matching itself was done using the Euclidean Distance for subsequent matching. The model was designed using UML, and implemented with C# and MS SQL on Microsoft Visual Studio platform. The developed system was evaluated based on False Acceptance, False Rejection and Equal Error Rate (EER) values obtained from the system. The results of testing and evaluation show that the developed system has achieved high recognition accuracy.

Detection of Fingerprints in Advanced Biometric System Design

The objective of this research is to incorporate fingerprint authentication to thwart the intruders attack in a network. A complete feature extraction process to propose an authentication scheme is presented in this paper. False Acceptance Error and False Rejection Error have been stressed to measure the performance of the proposed scheme. The main finding is to obtain an authentication system with a better strength. Majority of authentication techniques are unable to provide verification efficiency leads to competent negligence without being recognized. The primary goal of this document is to introduce and apply an innovative strategy that customs the finger print modus operandi to enhance a host based attack recognition program in to advance its level of verification.

Enhanced iris recognition method based on multi-unit iris images

For the purpose of biometric person identification, iris recognition uses the unique characteristics of the patterns of the iris; that is, the eye region between the pupil and the sclera. When obtaining an iris image, the iris’s image is frequently rotated because of the user’s head roll toward the left or right shoulder. As the rotation of the iris image leads to circular shifting of the iris features, the accuracy of iris recognition is degraded. To solve this problem, conventional iris recognition methods use shifting of the iris feature codes to perform the matching. However, this increases the computational complexity and level of false acceptance error. To solve these problems, we propose a novel iris recognition method based on multi-unit iris images. Our method is novel in the following five ways compared with previous methods. First, to detect both eyes, we use Adaboost and a rapid eye detector (RED) based on the iris shape feature and integral imaging. Both eyes are detected using RED in the approximate candidate region that consists of the binocular region, which is determined by the Adaboost detector. Second, we classify the detected eyes into the left and right eyes, because the iris patterns in the left and right eyes in the same person are different, and they are therefore considered as different classes. We can improve the accuracy of iris recognition using this pre-classification of the left and right eyes. Third, by measuring the angle of head roll using the two center positions of the left and right pupils, detected by two circular edge detectors, we obtain the information of the iris rotation angle. Fourth, in order to reduce the error and processing time of iris recognition, adaptive bit-shifting based on the measured iris rotation angle is used in feature matching. Fifth, the recognition accuracy is enhanced by the score fusion of the left and right irises. Experimental results on the iris open database of low-resolution images showed that the averaged equal error rate of iris recognition using the proposed method was 4.3006%, which is lower than that of other methods.

Age estimation using a hierarchical classifier based on global and local facial features

The research related to age estimation using face images has become increasingly important, due to the fact it has a variety of potentially useful applications. An age estimation system is generally composed of aging feature extraction and feature classification; both of which are important in order to improve the performance. For the aging feature extraction, the hybrid features, which are a combination of global and local features, have received a great deal of attention, because this method can compensate for defects found in individual global and local features. As for feature classification, the hierarchical classifier, which is composed of an age group classification (e.g. the class of less than 20 years old, the class of 20-39 years old, etc.) and a detailed age estimation (e.g. 17, 23 years old, etc.), provide a much better performance than other methods. However, both the hybrid features and hierarchical classifier methods have only been studied independently and no research combining them has yet been conducted in the previous works. Consequently, we propose a new age estimation method using a hierarchical classifier method based on both global and local facial features. Our research is novel in the following three ways, compared to the previous works. Firstly, age estimation accuracy is greatly improved through a combination of the proposed hybrid features and the hierarchical classifier. Secondly, new local feature extraction methods are proposed in order to improve the performance of the hybrid features. The wrinkle feature is extracted using a set of region specific Gabor filters, each of which is designed based on the regional direction of the wrinkles, and the skin feature is extracted using a local binary pattern (LBP), capable of extracting the detailed textures of skin. Thirdly, the improved hierarchical classifier is based on a support vector machine (SVM) and a support vector regression (SVR). To reduce the error propagation of the hierarchical classifier, each age group classifier is designed so that the age range to be estimated is overlapped by consideration of false acceptance error (FAE) and false rejection error (FRE) of each classifier. The experimental results showed that the performance of the proposed method was superior to that of the previous methods when using the BERC, PAL and FG-Net aging databases.

TWO-STAGE BIOMETRIC AUTHENTICATION METHOD USING THOUGHT ACTIVITY BRAIN WAVES

Brain waves are proposed as a biometric for verification of the identities of individuals in a small group. The approach is based on a novel two-stage biometric authentication method that minimizes both false accept error (FAE) and false reject error (FRE). These brain waves (or electroencephalogram (EEG) signals) are recorded while the user performs either one or several thought activities. As different individuals have different thought processes, this idea would be appropriate for individual authentication. In this study, autoregressive coefficients, channel spectral powers, inter-hemispheric channel spectral power differences, inter-hemispheric channel linear complexity and non-linear complexity (approximate entropy) values were used as EEG features by the two-stage authentication method with a modified four fold cross validation procedure. The results indicated that perfect accuracy was obtained, i.e. the FRE and FAE were both zero when the proposed method was tested on five subjects using certain thought activities. This initial study has shown that the combination of the two-stage authentication method with EEG features from thought activities has good potential as a biometric as it is highly resistant to fraud. However, this is only a pilot type of study and further extensive research with more subjects would be necessary to establish the suitability of the proposed method for biometric applications.

A false acceptance error controlling method for hyperspherical classifiers

Controlling false acceptance errors is of critical importance in many pattern recognition applications, including signature and speaker verification problems. Toward this goal, this paper presents two post-processing methods to improve the performance of hyperspherical classifiers in rejecting patterns from unknown classes. The first method uses a self-organizational approach to design minimum radius hyperspheres, reducing the redundancy of the class region defined by the hyperspherical classifiers. The second method removes additional redundant class regions from the hyperspheres by using a clustering technique to generate a number of smaller hyperspheres. Simulation and experimental results demonstrate that by removing redundant regions these two post-processing methods can reduce the false acceptance error without significantly increasing the false rejection error.

On Performance Improvement of a Speaker Verification System Using Vector Quantization, Cohorts and Hybrid Cohort-World Models

This paper presents the use of distance normalization techniques in order to improve speaker verification system performance. These techniques provide a dynamic threshold that compensates for the trial-to-trial variations and replaces the fixed threshold used in the classical speaker verification approach. Two methods are described: the cohort model normalization and a new and original hybrid cohort-world model normalization. These methods are compared from the point of view of storage space requirements and computational effort. Two algorithms are proposed: one uses existing user models, and the other creates new models. The algorithms were evaluated using the YOHO database and a proprietary database. The results showed that using these methods, the errors of false rejection are significantly reduced for a constant false acceptance error, when the cohort size is increasing. The algorithms also involve fewer computational resources than other algorithms, making them more suitable for commercial application.

ON-LINE SIGNATURE VERIFICATION BASED ON LOGARITHMIC SPECTRUM

In this paper, an on-line signature verification scheme based on similarity measurement of logarithmic spectrum is proposed. The principal components of the logarithmic spectrum of each signature are extracted. We then compute the similarity of logarithmic spectrum between input signature and the reference template. By comparing the similarity of logarithmic spectrum with the verification threshold, we can determine the authenticity of the input signature. Based on the experimentation, the rates of false rejection errors and false acceptance errors are as low as 1.4 and 2.8%, respectively. This demonstrates the effectiveness of the proposed scheme.

High confidence visual recognition of persons by a test of statistical independence

A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person's face is the detailed texture of each eye's iris. The visible texture of a person's in a real-time video image is encoded into a compact sequence of multi-scale quadrature 2-D Gabor wavelet coefficients, whose most-significant bits comprise a 256-byte iris code. Statistical decision theory generates identification decisions from Exclusive-OR comparisons of complete codes at the rate of 4000 per second, including calculation of decision confidence levels. The distributions observed empirically in such comparisons imply a theoretical cross-over error rate of one in 131000 when a decision criterion is adopted that would equalize the false accept and false reject error rates. In the typical recognition case, given the mean observed degree of code agreement, the decision confidence levels correspond formally to a conditional false accept probability of one in about 10/sup 31/. >