Gabor filters (GFs) play an important role in many application areas for the enhancement of various types of images and the extraction of Gabor features. For the purpose of enhancing curved structures in noisy images, we introduce curved GFs that locally adapt their shape to the direction of flow. These curved GFs enable the choice of filter parameters that increase the smoothing power without creating artifacts in the enhanced image. In this paper, curved GFs are applied to the curved ridge and valley structures of low-quality fingerprint images. First, we combine two orientation-field estimation methods in order to obtain a more robust estimation for very noisy images. Next, curved regions are constructed by following the respective local orientation. Subsequently, these curved regions are used for estimating the local ridge frequency. Finally, curved GFs are defined based on curved regions, and they apply the previously estimated orientations and ridge frequencies for the enhancement of low-quality fingerprint images. Experimental results on the FVC2004 databases show improvements of this approach in comparison with state-of-the-art enhancement methods.
Image quality @cite_15 has a big impact on the performance of a fingerprint recognition system (see e.g. @cite_38 and @cite_57 ). The goal of image enhancement is to improve the overall performance by optimally preparing input images for later processing stages. Most systems extract minutiae from fingerprints @cite_29 , and the presence of noise can interfere with the extraction. As a result, true minutiae may be missed and false minutiae may be detected, both having a negative effect on the recognition rate. In order to avoid these two types of errors, image enhancement aims at improving the clarity of the ridge and valley structure. With special consideration to the typical types of noise occurring in fingerprints, an image enhancement method should have three important properties:
@cite_57 @cite_38 @cite_15 @cite_29
1483712199 1565631400 2129631732 1639795441
In order to ensure that the performance of an automatic fingerprint identification verification system will be robust with respect to the quality of input fingerprint images, it is essential to incorporate a fingerprint enhancement algorithm in the minutiae extraction module. We present a fast fingerprint enhancement algorithm, which can adaptively improve the clarity of ridge and valley structures of input fingerprint images based on the estimated local ridge orientation and frequency. We have evaluated the performance of the image enhancement algorithm using the goodness index of the extracted minutiae and the accuracy of an online fingerprint verification system. Experimental results show that incorporating the enhancement algorithm improves both the goodness index and the verification accuracy. Fingerprint recognition plays an important role in many commercial applications and is used by millions of people every day, e.g. for unlocking mobile phones. Fingerprint image segmentation is typically the first processing step of most fingerprint algorithms and it divides an image into foreground, the region of interest, and background. Two types of error can occur during this step which both have a negative impact on the recognition performance: ‘true’ foreground can be labeled as background and features like minutiae can be lost, or conversely ‘true’ background can be misclassified as foreground and spurious features can be introduced. The contribution of this paper is threefold: firstly, we propose a novel factorized directional bandpass (FDB) segmentation method for texture extraction based on the directional Hilbert transform of a Butterworth bandpass (DHBB) filter interwoven with soft-thresholding. Secondly, we provide a manually marked ground truth segmentation for 10560 images as an evaluation benchmark. Thirdly, we conduct a systematic performance comparison between the FDB method and four of the most often cited fingerprint segmentation algorithms showing that the FDB segmentation method clearly outperforms these four widely used methods. The benchmark and the implementation of the FDB method are made publicly available. Accurate fingerprint recognition presupposes robust feature extraction which is often hampered by noisy input data. We suggest common techniques for both enhancement and minutiae extraction, employing symmetry features. For enhancement, a Laplacian-like image pyramid is used to decompose the original fingerprint into sub-bands corresponding to different spatial scales. In a further step, contextual smoothing is performed on these pyramid levels, where the corresponding filtering directions stem from the frequency-adapted structure tensor (linear symmetry features). For minutiae extraction, parabolic symmetry is added to the local fingerprint model which allows to accurately detect the position and direction of a minutia simultaneously. Our experiments support the view that using the suggested parabolic symmetry features, the extraction of which does not require explicit thinning or other morphological operations, constitute a robust alternative to conventional minutiae extraction. All necessary image processing is done in the spatial domain using 1-D filters only, avoiding block artifacts that reduce the biometric information. We present comparisons to other studies on enhancement in matching tasks employing the open source matcher from NIST, FIS2. Furthermore, we compare the proposed minutiae extraction method with the corresponding method from the NIST package, mindtct. A top five commercial matcher from FVC2006 is used in enhancement quantification as well. The matching error is lowered significantly when plugging in the suggested methods. The FVC2004 fingerprint database, notable for its exceptionally low-quality fingerprints, is used for all experiments. Biometrics-based verification, especially fingerprint-based identification, is receiving a lot of attention. There are two major shortcomings of the traditional approaches to fingerprint representation. For a considerable fraction of population, the representations based on explicit detection of complete ridge structures in the fingerprint are difficult to extract automatically. The widely used minutiae-based representation does not utilize a significant component of the rich discriminatory information available in the fingerprints. Local ridge structures cannot be completely characterized by minutiae. Further, minutiae-based matching has difficulty in quickly matching two fingerprint images containing a different number of unregistered minutiae points. The proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean distance between the two corresponding FingerCodes and hence is extremely fast. We are able to achieve a verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms published in the open literature. Our system performs better than a state-of-the-art minutiae-based system when the performance requirement of the application system does not demand a very low false acceptance rate. Finally, we show that the matching performance can be improved by combining the decisions of the matchers based on complementary (minutiae-based and filter-based) fingerprint information. Abstract Most fingerprint recognition systems use Level 1 characteristics (ridge flow, orientation, and frequency) and Level 2 features (minutiae points) to recognize individuals. Level 3 features (sweat pores, incipient ridges and ultra-thin characteristics of the ridges) are less frequently adopted because they can be extracted only from high resolution images, but they have the potential of improving all the steps of the biometric recognition process. In particular, sweat pores can be used for quality assessment, liveness detection, biometric matching in live applications, and matching of partial latent fingerprints in forensic applications. Currently, each type of fingerprint acquisition technique (touch-based, touchless, or latent) requires a different algorithm for pore extraction. In this paper, we propose the first method in the literature able to extract the coordinates of the pores from touch-based, touchless, and latent fingerprint images. Our method uses specifically designed and trained Convolutional Neural Networks (CNN) to estimate and refine the centroid of each pore. Results show that our method is feasible and achieved satisfactory accuracy for all the types of evaluated images, with a better performance with respect to the compared state-of-the-art methods. Fingerprint image enhancement is a crucial step in automatic fingerprint recognition. A large number of approaches for filtering the fingerprint image have been suggested. Most of them perform oriented band pass filtering. However, such filters, for example, Gabor filters, may create spurious ridge structure information. This is harmful for the feature extraction and therefore is harmful for the automatic fingerprint recognition. This paper examines the properties of applying the Gabor filter in the fingerprint image enhancement. It shows that the nonsinusoidal-shaped ridge structure, the ridge frequency estimation error, and the small filter size are the causes of creating spurious ridge structures. As a solution, we suggest an adaptive oriented low pass filter instead of the Gabor filter to avoid producing undesired harmful side effects for the automatic fingerprint recognition. One of the open issues in fingerprint verification is the lack of robustness against image-quality degradation. Poor-quality images result in spurious and missing features, thus degrading the performance of the overall system. Therefore, it is important for a fingerprint recognition system to estimate the quality and validity of the captured fingerprint images. In this work, we review existing approaches for fingerprint image-quality estimation, including the rationale behind the published measures and visual examples showing their behavior under different quality conditions. We have also tested a selection of fingerprint image-quality estimation algorithms. For the experiments, we employ the BioSec multimodal baseline corpus, which includes 19 200 fingerprint images from 200 individuals acquired in two sessions with three different sensors. The behavior of the selected quality measures is compared, showing high correlation between them in most cases. The effect of low-quality samples in the verification performance is also studied for a widely available minutiae-based fingerprint matching system. The performance of a fingerprint matching system is affected by the nonlinear deformation introduced in the fingerprint impression during image acquisition. This nonlinear deformation causes fingerprint features such as minutiae points and ridge curves to be distorted in a complex manner. A technique is presented to estimate the nonlinear distortion in fingerprint pairs based on ridge curve correspondences. The nonlinear distortion, represented using the thin-plate spline (TPS) function, aids in the estimation of an "average" deformation model for a specific finger when several impressions of that finger are available. The estimated average deformation is then utilized to distort the template fingerprint prior to matching it with an input fingerprint. The proposed deformation model based on ridge curves leads to a better alignment of two fingerprint images compared to a deformation model based on minutiae patterns. An index of deformation is proposed for selecting the "optimal" deformation model arising from multiple impressions associated with a finger. Results based on experimental data consisting of 1,600 fingerprints corresponding to 50 different fingers collected over a period of two weeks show that incorporating the proposed deformation model results in an improvement in the matching performance. Traditionally, fingerprint matching is minutia-based, which establishes the minutiae correspondences between two fingerprints. In this paper, a novel fingerprint matching algorithm is presented, which establishes both the ridge correspondences and the minutia correspondences between two fingerprints. First N initial substructure (including a minutia and adjacent ridges) pairs are found by a novel alignment method. Based on each of these substructure pairs, ridge matching is performed by incrementally matching ridges and minutiae, and then a matching score is computed. The maximum one of the N scores is used as the final matching score of two fingerprints. Preliminary results on FVC2002 databases show that ridge matching approach performs comparably with the minutia-based one. The National Institute of Standards and Technology in conjunction with the Federal Bureau of Investigation has developed a new database of grayscale fingerprint images and corresponding minutiae data. The database contains latent fingerprints from crime scenes and their matching rolled fingerprint mates. In all there are 258 latent cases. Each case includes the latent image, the matching tenprint image, and four sets of minutiae that have been validated by a professional team of latent examiners. One set of minutiae contains all minutiae points on the latent fingerprint; the second set contains all minutiae points on the tenprint mate; the other two sets contain the minutiae points in common between the latent fingerprint and tenprint mate. In all there are 27,426 minutiae recorded across the set of tenprints with 5460 minutiae in common with their matching latent fingerprint. All data files are formatted according to the ANSI NISTITL 1-2000 standard using Type-1, 9, 13, & 14 records. Software utilities are provided to read, write, and manipulate these files. The database can be used to develop and test new fingerprint algorithms, test commercial and research AFIS systems, train latent examiners, and promote the ANSI NIST file format standard. We propose a Gabor-filter-based method for fingerprint recognition in this paper. The method makes use of Gabor filtering technologies and need only to do the core point detection before the feature extraction process without any other pre-processing steps such as smoothing, binarization, thinning, and minutiae detection. The proposed Gabor-filter-based features play a central role in the processes of fingerprint recognition, including local ridge orientation, core point detection, and feature extraction. Experimental results show that the recognition rate of the k-nearest neighbor classifier using the proposed features is 97.2 for a small-scale fingerprint database, and thus that the proposed method is an efficient and reliable approach. Sweat pores on fingerprints have proven to be useful features for personal identification. Several methods have been proposed for pore matching. The state-of-the-art method first matches minutiae on the fingerprints and then matches the pores based on the minutia matching results. A problem of such minutia-based pore matching method is that the pore matching is dependent on the minutia matching. Such dependency limits the pore matching performance and impairs the effectiveness of the fusion of minutia and pore match scores. In this paper, we propose a novel direct approach for matching fingerprint pores. It first determines the correspondences between pores based on their local features. It then uses the RANSAC (RANdom SAmple Consensus) algorithm to refine the pore correspondences obtained in the first step. A similarity score is finally calculated based on the pore matching results. The proposed pore matching method successfully avoids the dependency of pore matching on minutia matching results. Experiments have shown that the fingerprint recognition accuracy can be greatly improved by using the method proposed in this paper. Fingerprint friction ridge details are generally described in a hierarchical order at three different levels, namely, level 1 (pattern), level 2 (minutia points), and level 3 (pores and ridge contours). Although latent print examiners frequently take advantage of level 3 features to assist in identification, automated fingerprint identification systems (AFIS) currently rely only on level 1 and level 2 features. In fact, the Federal Bureau of Investigation's (FBI) standard of fingerprint resolution for AFIS is 500 pixels per inch (ppi), which is inadequate for capturing level 3 features, such as pores. With the advances in fingerprint sensing technology, many sensors are now equipped with dual resolution (500 ppi 1,000 ppi) scanning capability. However, increasing the scan resolution alone does not necessarily provide any performance improvement in fingerprint matching, unless an extended feature set is utilized. As a result, a systematic study to determine how much performance gain one can achieve by introducing level 3 features in AFIS is highly desired. We propose a hierarchical matching system that utilizes features at all the three levels extracted from 1,000 ppi fingerprint scans. Level 3 features, including pores and ridge contours, are automatically extracted using Gabor filters and wavelet transform and are locally matched using the iterative closest point (ICP) algorithm. Our experiments show that level 3 features carry significant discriminatory information. There is a relative reduction of 20 percent in the equal error rate (EER) of the matching system when level 3 features are employed in combination with level 1 and 2 features. This significant performance gain is consistently observed across various quality fingerprint images The performance of an automatic fingerprint authentication system relies heavily on the quality of the captured fingerprint images. In this paper, two new quality indices for fingerprint images are developed. The first index measures the energy concentration in the frequency domain as a global feature. The second index measures the spatial coherence in local regions. We present a novel framework for evaluating and comparing quality indices in terms of their capability of predicting the system performance at three different stages, namely, image enhancement, feature extraction and matching. Experimental results on the IBM-HURSLEY and FVC2002 DB3 databases demonstrate that the global index is better than the local index in the enhancement stage (correlation of 0.70 vs. 0.50) and comparative in the feature extraction stage (correlation of 0.70 vs. 0.71). Both quality indices are effective in predicting the matching performance, and by applying a quality-based weighting scheme in the matching algorithm, the overall matching performance can be improved; a decrease of 1.94 in EER is observed on the FVC2002 DB3 database. There are fundamental differences in the way fingerprints are compared by forensic examiners and current automatic systems. For example, while automatic systems focus mainly on the quantitative measures of fingerprint minutiae (ridge ending and bifurcation points), forensic examiners often analyze details of intrinsic ridge characteristics and relational information. This process, known as qualitative friction ridge analysis [1], includes examination of ridge shape, pores, dots, incipient ridges, etc. This explains the challenges that current automatic systems face in processing partial fingerprints, mostly seen in latents. The forensics and automatic fingerprint identification systems (AFIS) communities have been active in standardizing the definition of extended feature set, as well as quantifying the relevance and reliability of these features for automatic matching systems. CDEFFS (committee to define an extended feature set) has proposed a working draft on possible definitions and representations of extended features [2]. However, benefits of utilizing these extended features in automatic systems are not yet known. While fingerprint matching technology is quite mature for matching tenprints [3], matching partial fingerprints, especially latents, still needs a lot of improvement. We propose an algorithm to extract two major level 3 feature types, dots and incipients, based on local phase symmetry and demonstrate their effectiveness in partial print matching. Since dots and incipients can be easily encoded by forensic examiners, we believe the results of this research will have benefits to next generation identification (NGI) systems. Most of current fingerprint indexing schemes utilize features based on global textures and minutiae structures. To extend the existing technology of feature extraction, this paper proposes a new fingerprint indexing and retrieval scheme using scale invariant feature transformation (SIFT), which has been widely used in generic image retrieval. With slight loss in effectiveness, we reduce the number of features generated from one fingerprint for efficiency. To cope with the uncertainty of acquisition (e.g. partialness, distortion), we use a composite set of features to form multiple impressions for the fingerprint representation. In the index construction phase, the use of locality-sensitive hashing (LSH) allows us to perform similarity queries by only examining a small fraction of the database. Experiments on database FVC2000 and FVC2002 show the effectiveness of our proposed scheme. As technological developments have enabled high-quality fingerprint scanning, sweat pores, one of the Level 3 features of fingerprints, have been successfully used in automatic fingerprint recognition systems (AFRS). Since the pore extraction process is a critical step for AFRS, high accuracy is required. However, it is difficult to extract the pore correctly because the pore shape depends on the person, region, and pore type. To solve the problem, we have presented a pore extraction method using deep convolutional neural networks and pore intensity refinement. The deep networks are used to detect pores in detail using a large area of a fingerprint image. We then refine the pore information by finding local maxima to identify pores with different intensities in the fingerprint image. The experimental results show that our pore extraction method performs better than the state-of-the-art methods. Sweat pores on fingerprints have proven to be discriminative features and have recently been successfully employed in automatic fingerprint recognition systems (AFRS), where the extraction of fingerprint pores is a critical step. Most of the existing pore extraction methods detect pores by using a static isotropic pore model; however, their detection accuracy is not satisfactory due to the limited approximation capability of static isotropic models to various types of pores. This paper presents a dynamic anisotropic pore model to describe pores more accurately by using orientation and scale parameters. An adaptive pore extraction method is then developed based on the proposed dynamic anisotropic pore model. The fingerprint image is first partitioned into well-defined, ill-posed, and background blocks. According to the dominant ridge orientation and frequency on each foreground block, a local instantiation of appropriate pore model is obtained. Finally, the pores are extracted by filtering the block with the adaptively generated pore model. Extensive experiments are performed on the high resolution fingerprint databases we established. The results demonstrate that the proposed method can detect pores more accurately and robustly, and consequently improve the fingerprint recognition accuracy of pore-based AFRS. This paper proposes a new hash-based indexing method to speed up fingerprint identification in large databases. A Locality-Sensitive Hashing (LSH) scheme has been designed relying on Minutiae Cylinder-Code (MCC), which proved to be very effective in mapping a minutiae-based representation (position angle only) into a set of fixed-length transformation-invariant binary vectors. A novel search algorithm has been designed thanks to the derivation of a numerical approximation for the similarity between MCC vectors. Extensive experimentations have been carried out to compare the proposed approach against 15 existing methods over all the benchmarks typically used for fingerprint indexing. In spite of the smaller set of features used (top performing methods usually combine more features), the new approach outperforms existing ones in almost all of the cases. In this paper we propose a semi-automatic approach for the enhancement of very low quality fingerprints such as latent fingerprints. A specific markup tool is designed to allow fingerprint examiners to simply and quickly provide sparse estimates of local orientations and frequencies. These estimates are then interpolated though Delaunay triangulation and fed to a contextual Gabor-based enhancement algorithm that significantly improves the image quality, thus making the successive automatic feature extraction much more reliable. Experimental results (both qualitative and quantitative) confirm the effectiveness of this method over a fully-automatic state-of-the-art approach.