ADAPTABLE FINGERPRINT MINUTIAE EXTRACTION ALGORITHM BASED-ON CROSSING NUMBER METHOD FOR HARDWARE IMPLEMENTATION USING FPGA DEVICE

In this article. a main perspective of developing and implementing fingerprint extraction and matching algorithms as a pari of fingerprint recognition system is focused. First, developing a simple algorithm to extract fingerprint features and test this algorithm on Pc. The second thing is implementing this algorithm into FPGA devices. The major research topics on which the proposed approach is developing and modifying fingerprint extraction feature algorithm. This development and modification are using crossing number method on pixel representation value '0'. In this new proposed algorithm, it is no need a process concerning ROI segmentation and no trigonometry calculation. And specially in obtaining their parameters using Angle Calculation Block avoiding floating points calculation. As this method is local feature that usually involve with 60-100 minutiae points, makes the template is small in size. Providing FAR. FRR and EER, performs the performance evaluation of proposed algorithm. The result is an adaptable fingerprint minutiae extraction algorithm into hardware implementation with 14.05 % of EEl?, better than reference algorithm, which is 20.39 % . The computational time is 18 seconds less than a similar method, which takes 60-90 seconds just for pre-processing step. The first step of algorithm implementation in hardware environment (embedded) using FPGA Device by developing IP Core without using any soft processor is presented

A DoG based Approach for Fingerprint Image Enhancement

Fingerprints have been the most accepted tool for personal identification since many decades. It is also an invaluable tool for law enforcement and forensics for over a century, motivating the research in Automated fingerprint-based identification, an application of biometric system. The matching or identification accuracy using fingerprints has been shown to be very high. The theory on the uniqueness of fingerprint minutiae leads to the steps in studying the statistics of extracting the minutiae features reliably. Fingerprint images obtained through various sources are rarely of perfect quality. They may be degraded or noisy due to variations in skin or poor scanning technique or due to poor impression condition. Hence enhancement techniques are applied on fingerprint images prior to the minutiae point extraction to get sure of less spurious and more accurate minutiae points from the reliable minutiae location. This thesis focuses on fingerprint image enhancement techniques through histogram equalization applied locally on the degraded image. The proposed work is based on the Laplacian pyramid framework that decomposes the input image into a number of band-pass images to improve the local contrast, as well as the local edge information. The resultant image is passed through the regular methodologies of fingerprint, like ridge orientation, ridge frequency calculation, filtering, binarization and finally the morphological operation thinning. Experiments using different texture of images are conducted to enhance the images and to show a comparative result in terms of number of minutiae extracted from them along with the spurious and actual number existing in each enhanced image. Experimental results out performs well to overcome the counterpart of enhancement technique

A new algorithm for minutiae extraction and matching in fingerprint

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.A novel algorithm for fingerprint template formation and matching in automatic fingerprint recognition has been developed. At present, fingerprint is being considered as the dominant biometric trait among all other biometrics due to its wide range of applications in security and access control. Most of the commercially established systems use singularity point (SP) or ‘core’ point for fingerprint indexing and template formation. The efficiency of these systems heavily relies on the detection of the core and the quality of the image itself. The number of multiple SPs or absence of ‘core’ on the image can cause some anomalies in the formation of the template and may result in high False Acceptance Rate (FAR) or False Rejection Rate (FRR). Also the loss of actual minutiae or appearance of new or spurious minutiae in the scanned image can contribute to the error in the matching process. A more sophisticated algorithm is therefore necessary in the formation and matching of templates in order to achieve low FAR and FRR and to make the identification more accurate. The novel algorithm presented here does not rely on any ‘core’ or SP thus makes the structure invariant with respect to global rotation and translation. Moreover, it does not need orientation of the minutiae points on which most of the established algorithm are based. The matching methodology is based on the local features of each minutiae point such as distances to its nearest neighbours and their internal angle. Using a publicly available fingerprint database, the algorithm has been evaluated and compared with other benchmark algorithms. It has been found that the algorithm has performed better compared to others and has been able to achieve an error equal rate of 3.5%

Minutiae filtering using ridge-valley method

In order to identify subjects in a convenient and efficient way one must use some special feature that makes it possible to discriminate between persons. Some of the features are biometric in nature, such as iris texture, hand shape, the human face, and of course finger prints. These play an important role in many automatic identification systems, since every person is believed to have a unique set of fingerprints. Before a fingerprint image can be looked up in a database, it has to be classified into one of 5 types in order to reduce processing times

3D minutiae extraction in 3D fingerprint scans.

Traditionally, fingerprint image acquisition was based on contact. However the conventional touch-based fingerprint acquisition introduces some problems such as distortions and deformations to the fingerprint image. The most recent technology for fingerprint acquisition is touchless or 3D live scans introducing higher quality fingerprint scans. However, there is a need to develop new algorithms to match 3D fingerprints. In this dissertation, a novel methodology is proposed to extract minutiae in the 3D fingerprint scans. The output can be used for 3D fingerprint matching. The proposed method is based on curvature analysis of the surface. The method used to extract minutiae includes the following steps: smoothing; computing the principal curvature; ridges and ravines detection and tracing; cleaning and connecting ridges and ravines; and minutiae detection. First, the ridges and ravines are detected using curvature tensors. Then, ridges and ravines are traced. Post-processing is performed to obtain clean and connected ridges and ravines based on fingerprint pattern. Finally, minutiae are detected using a graph theory concept. A quality map is also introduced for 3D fingerprint scans. Since a degraded area may occur during the scanning process, especially at the edge of the fingerprint, it is critical to be able to determine these areas. Spurious minutiae can be filtered out after applying the quality map. The algorithm is applied to the 3D fingerprint database and the result is very encouraging. To the best of our knowledge, this is the first minutiae extraction methodology proposed for 3D fingerprint scans

Novel Feature Extraction Methodology with Evaluation in Artificial Neural Networks Based Fingerprint Recognition System

Fingerprint recognition is one of the most common biometric recognition systems that includes feature extraction and decision modules. In this work, these modules are achieved via artificial neural networks and image processing operations. The aim of the work is to define a new method that requires less computational load and storage capacity, can be an alternative to existing methods, has high fault tolerance, convenient for fraud measures, and is suitable for development. In order to extract the feature points called minutia points of each fingerprint sample, Multilayer Perceptron algorithm is used. Furthermore, the center of the fingerprint is also determined using an improved orientation map. The proposed method gives approximate position information of minutiae points with respect to the core point using a fairly simple, orientation map-based method that provides ease of operation, but with the use of artificial neurons with high fault tolerance, this method has been turned to an advantage. After feature extraction, General Regression Neural Network is used for identification. The system algorithm is evaluated in UPEK and FVC2000 database. The accuracies without rejection of bad images for the database are 95.57% and 91.38% for UPEK and FVC2000 respectively

Skeleton-based fingerprint minutiae extraction.

by Zhao Feng.Thesis (M.Phil.)--Chinese University of Hong Kong, 2002.Includes bibliographical references (leaves 64-68).Abstracts in English and Chinese.Abstract --- p.iAcknowledgments --- p.viTable of Contents --- p.viiList of Figures --- p.ixList of Tables --- p.xChapter Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Automatic Personal Identification --- p.1Chapter 1.2 --- Biometrics --- p.2Chapter 1.2.1 --- Objectives --- p.2Chapter 1.2.2 --- Operational Mode --- p.3Chapter 1.2.3 --- Requirements --- p.3Chapter 1.2.4 --- Performance Evaluation --- p.4Chapter 1.2.5 --- Biometric Technologies --- p.4Chapter 1.3 --- Fingerprint --- p.6Chapter 1.3.1 --- Applications --- p.6Chapter 1.3.2 --- Advantages of Fingerprint Identification --- p.7Chapter 1.3.3 --- Permanence and Uniqueness --- p.8Chapter 1.4 --- Thesis Overview --- p.8Chapter 1.5 --- Summary --- p.9Chapter Chapter 2 --- Fingerprint Identification --- p.10Chapter 2.1 --- History of Fingerprints --- p.10Chapter 2.2 --- AFIS Architecture --- p.12Chapter 2.3 --- Fingerprint Acquisition --- p.15Chapter 2.4 --- Fingerprint Representation --- p.16Chapter 2.5 --- Fingerprint Classification --- p.18Chapter 2.6 --- Fingerprint Matching --- p.20Chapter 2.7 --- Challenges --- p.21Chapter 2.8 --- Combination Schemes --- p.22Chapter 2.9 --- Summary --- p.23Chapter Chapter 3 --- Live-Scan Fingerprint Database --- p.24Chapter 3.1 --- Live-Scan Fingerprint Sensors --- p.24Chapter 3.2 --- Database Features --- p.24Chapter 3.3 --- Filename Description --- p.28Chapter Chapter 4 --- Preprocessing for Skeleton-Based Minutiae Extraction --- p.30Chapter 4.1 --- Review of Minutiae-based Methods --- p.31Chapter 4.2 --- Skeleton-based Minutiae Extraction --- p.32Chapter 4.2.1 --- Preprocessing --- p.33Chapter 4.2.2 --- Validation of Bug Pixels and Minutiae Extraction --- p.40Chapter 4.3 --- Experimental Results --- p.42Chapter 4.4 --- Summary --- p.44Chapter Chapter 5 --- Post-Processing --- p.46Chapter 5.1 --- Review of Post-Processing Methods --- p.46Chapter 5.2 --- Post-Processing Algorithms --- p.47Chapter 5.2.1 --- H-Point --- p.47Chapter 5.2.2 --- Termination/Bifurcation Duality --- p.48Chapter 5.2.3 --- Post-Processing Procedure --- p.49Chapter 5.3 --- Experimental Results --- p.52Chapter 5.4 --- Summary --- p.54Chapter Chapter 6 --- Conclusions and Future Work --- p.58Chapter 6.1 --- Conclusions --- p.58Chapter 6.2 --- Problems and Future Works --- p.59Chapter 6.2.1 --- Problem 1 --- p.59Chapter 6.2.2 --- Problem 2 --- p.61Chapter 6.2.3 --- Problem 3 --- p.61Chapter 6.2.4 --- Future Works --- p.62Bibliography --- p.6