Improving Fingerprint Verification Using Minutiae Triplets
|
|
- Aubrie Fisher
- 5 years ago
- Views:
Transcription
1 Sensors 2012, 12, ; doi: /s OPEN ACCESS sensors ISSN Article Improving Fingerprint Verification Using Minutiae Triplets Miguel Angel Medina-Pérez 1,2,, Milton García-Borroto 1, Andres Eduardo Gutierrez-Rodríguez 1 and Leopoldo Altamirano-Robles 2 1 Centro de Bioplantas, Universidad de Ciego de Ávila, Carretera a Morón km 9, Ciego de Ávila, C.P , Cuba 2 Instituto Nacional de Astrofísica, Óptica y Electrónica. Luis Enrique Erro No. 1, Sta. María Tonanzintla, Puebla, C.P , México Author to whom correspondence should be addressed; migue@bioplantas.cu; Tel.: Received: 25 January 2012; in revised form: 28 February 2012 / Accepted: 28 February 2012 / Published: 8 March 2012 Abstract: Improving fingerprint matching algorithms is an active and important research area in fingerprint recognition. Algorithms based on minutia triplets, an important matcher family, present some drawbacks that impact their accuracy, such as dependency to the order of minutiae in the feature, insensitivity to the reflection of minutiae triplets, and insensitivity to the directions of the minutiae relative to the sides of the triangle. To alleviate these drawbacks, we introduce in this paper a novel fingerprint matching algorithm, named M3gl. This algorithm contains three components: a new feature representation containing clockwise-arranged minutiae without a central minutia, a new similarity measure that shifts the triplets to find the best minutiae correspondence, and a global matching procedure that selects the alignment by maximizing the amount of global matching minutiae. To make M3gl faster, it includes some optimizations to discard non-matching minutia triplets without comparing the whole representation. In comparison with six verification algorithms, M3gl achieves the highest accuracy in the lowest matching time, using FVC2002 and FVC2004 databases. Keywords: fingerprint verification; minutiae descriptor; minutiae triplet
2 Sensors 2012, Introduction Fingerprints are the marks made by ridges and furrows in the fingers. They are formed during the sixth month of intrauterine life of human beings and do not disappear until some time after death. Since there are not two persons with the same fingerprints and they do not change naturally, they are an important element to identify people. Due to the high complexity of fingerprint matching and the huge amount of existing fingerprints, it is necessary to build computer systems that automatically process fingerprints with high accuracy and low computational costs. Historically, fingerprint recognition systems were mostly used in forensic sciences, but the current popularity of these systems is mainly due to civilian applications such as the control of physical access to facilities, the control of logical access to software, and the control of voters during elections. A key component in fingerprint recognition systems is the fingerprint matching algorithm. To measure the quality of a fingerprint matching algorithm, the evaluator must consider the context in which it is applied. For example, the algorithms based on microscopic characteristics are suitable for applications where fingerprints are acquired with high resolution sensors (1,000 dpi or higher); the quality of these algorithms dramatically decreases when the resolution is low [1]. The following quality parameters are proved to be important for evaluating general matchers: Low computational cost: The algorithm satisfies memory and time restrictions for its application context [2]. Invariance to translation: The algorithm returns a high similarity value when comparing fingerprints from the same finger notwithstanding that fingerprints be translated horizontally and/or vertically [3]. Invariance to rotation: The algorithm returns a high similarity value when comparing fingerprints from the same finger in spite of fingerprints rotation [3]. Tolerance to non-linear distortion: The algorithm returns a high similarity value when comparing fingerprints from the same finger even when fingerprints are affected by non-linear distortion, as a result of fingerprint creation mechanisms [4]. Sensitivity to the individuality of fingerprints: The algorithm returns a high similarity value when comparing fingerprints from the same finger and returns a low similarity value when comparing fingerprints from different fingers [5]. Insensitivity to select a single alignment: The algorithm does not perform a single global alignment from the best local alignment. Maximizing the local similarity value does not guarantee to find a true matching local structure pair. Even if the selected local structure pair is a true matching pair, it is not necessarily the best pair to carry out fingerprint alignment [3]. Tolerance to partial fingerprints: The algorithm returns a high similarity value when comparing fingerprints from the same finger even when the fingerprints are not complete [5]. Partial fingerprints can be produced by the restrictions of the sensors, latent fingerprints in crime scenes, and different fingerprint creation mechanisms. Tolerance to the low quality of fingerprints: The results of the algorithm are not significantly affected by low fingerprint quality [6]. Due to different skin conditions and/or the different fingerprint creation mechanisms, sometimes many details of the fingerprints do not appear clearly.
3 Sensors 2012, Tolerance to errors of the feature extractor: The algorithm returns a high similarity value when comparing fingerprints from the same finger even when the feature extractor has missed some features and/or has extracted some non-existent features [3]. Determinism: Two executions of the algorithm with the same parameters return the same results. Modern technologies impose new challenges to fingerprint matching algorithms; new systems reside on light architectures, need standards for systems interoperability, and use small area sensors [3,4,7]. In these contexts, the algorithms with higher quality are those based on minutiae [2]. Minutiae are the points where the ridge continuity breaks and they are typically represented as (x, y, θ); where (x, y) represent the 2D point coordinates, and θ the ridge direction at that point. As a minutia-based matcher should be invariant to translation and rotation, the process of minutia pairing is ambiguous [8]. Thus, most matchers in this family use local minutia structures (minutiae descriptors) to quickly establish the minutiae correspondences [4]. A simple and accurate minutiae descriptor is based on minutiae triplets [3]. Minutiae triplets are local structures represented by three minutiae. Algorithms based on minutiae triplets have the following advantages, which make them of higher quality than algorithms based on other representations: They are tolerant to fingerprint deformations [9]. They are faster and more accurate, compared to algorithms based on other representations [10,11], especially in applications with partial fingerprints [12]. They are suitable for applications based on interoperability standards because the most popular standards are based only on minutiae [2]. They are appropriate for systems embedded on light architectures because the representation and comparison of minutiae triplets can be performed efficiently [13]. Minutiae triplets have higher discriminative power than minutiae pairs and single minutiae [10]. Some important quality parameters related to fingerprint matching algorithms based on minutiae triplets are: Invariance to the order of minutiae in the feature: No matter the minutiae order in the triplet, the algorithm finds the correct correspondences of minutiae when matching similar triplets (Figure 1). Sensitivity to the reflection of minutiae triplets: The algorithm does not match a triplet with its reflected version (Figure 2). Sensitivity to the directions of the minutiae relative to the sides of the triangle: In order to find similar triplets, the algorithm takes into account the directions of the minutiae relative to the sides of the triangles formed by the triplets (Figure 3).
4 Sensors 2012, Figure 1. Similar minutiae triplets that were not classified as true matching by some algorithms because in image (a) the features are arranged according to the length of the sides, in image (b) the algorithms try to match the main minutia q 1 (left triplet) with the main minutia p 1 (right triplet). (a) (b) Figure 2. Minutiae triplets that do not match because (p 1, p 2, p 3 ) is a reflected version of (q 1, q 2, q 3 ). Figure 3. Minutiae triplets that do not match because minutiae pairs (q 1, p 1 ), (q 2, p 2 ) and (q 3, p 3 ) highly differ in the directions of the minutiae relative to the sides of the triangles. State-of-the-art algorithms based on minutiae triplets do not fulfil all the quality parameters, which has a negative impact on their accuracy. Table 1 shows the lacking quality parameter of all the reviewed matchers, according to the following parameters: I Invariance to the order of minutiae in the feature.
5 Sensors 2012, II Sensitivity to the reflection of minutiae triplets. III Sensitivity to the directions of the minutiae relative to the sides of the triangle. IV Insensitivity to select a single alignment. V Tolerance to errors of the feature extractor. VI Determinism. Table 1. Summary of the lacking quality parameter on fingerprint matching algorithms based on minutiae triplets. Algorithms Lacking quality parameter I II III IV V VI JY [9] X X X KV [14] X X X PN [11] X X JG1 [12] X X X X JG2 [5] X X RUR [13] X X TB [15] X X FFCS [16] X X CTYZ [17] X X XCF [18] X X X X ZGZ [19] X X HK [20] X X GSM [21] X X In this research, we introduce M3gl, a new fingerprint matcher that fulfils most quality parameters. M3gl is based on a new representation and a new comparison function for minutia triplets. An experimental comparison with algorithms based on different types of minutiae descriptors shows that M3gl is highly accurate and it has acceptable computational costs. 2. Definitions This section defines some basic functions that we use throughout the paper. Given two minutiae p i = (x i, y i, θ i ) and p j = (x j, y j, θ j ), ed(p i, p j ) represents the Euclidean distance between the coordinates of p i and p j Equation (1). ed(p i, p j ) = (x i x j ) 2 + (y i y j ) 2 (1) For two given angles α and β, ad π (α, β) computes the minimum angle required to superpose two vectors with the same origin and angles α and β respectively using Equation (2), while ad 2π (α, β)
6 Sensors 2012, computes the angle required to rotate a vector with angle β in clockwise sense to superpose it to another vector with the same origin and angle α using Equation (3). ad π (α, β) = min ( α β, 2π α β ) (2) { β α if β > α ad 2π (α, β) = (3) β α + 2π otherwise Finally, for a given pair of minutiae p i and p j, ang(p i, p j ) computes the angle of the vector with initial point at p i and terminal point at p j using Equation (4). ang(p i, p j ) = where y = y i y j and x = x i x j. 3. Feature Representation arctan( y/ x) if x > 0 y 0 arctan( y/ x) + 2π if x > 0 y < 0 arctan( y/ x) + π if x < 0 π/2 if x = 0 y > 0 3π/2 if x = 0 y < 0 In this section, we introduce m-triplets, a robust feature representation based on minutiae triplets. Provided that a fingerprint is described by the minutia set P, our representation is a tuple with the following components (see Figure 4): minutiae p i P are clockwise arranged starting on p 1. d i 1...3, where d i is the Euclidean distance between the minutiae different than p i. d max, d mid and d min are the maximum, middle and minimum distances in the triplet, respectively. Although these components can be calculated based on distance values, we store them because they are a key point for the algorithm optimizations. ( ) α i are the angles ad 2π ang(p, q), θ required to rotate the direction θ of a minutia to superpose it to the vectors associated with the other two minutiae in the triplet. ( ) β i = ad 2π θj, θ k is the angle required to rotate the direction of the minutia pk in order to superpose it to the direction of the minutia p j. The m-triplets are sensitive to the directions of the minutiae relative to the sides of the triangle (angles α). The minutiae in this representation are arranged in clockwise direction without a central minutia. Therefore, in order to compare m-triplets, the similarity function considers the three minutiae rotations in clockwise sense (next section contains a formal definition of this procedure). This representation and the comparison function guarantee the invariance to the order of minutiae in the feature, and the sensitivity to the reflection of minutiae triplets. (4)
7 Sensors 2012, Figure 4. The components of the new feature representation proposed in this paper. 4. M-Triplets Similarity In this section, we introduce a new m-triplets similarity. It is designed to accurately distinguish between similar and non-similar m-triplets. Given two m-triplets t and r, we propose s inv (t, r) in Equation (5) to compare m-triplets. { ( ) ( s inv (t, r) = max s part (t, r), s part t, shift(r), spart t, shift ( shift(r) ))} (5) where: shift(r) is the clockwise-shifted m-triplet r and s part (t, r) is the base similarity function in Equation (6). { 0 if s θ (t, r)=0 s d (t, r)=0 s α (t, r) = 0 s β (t, r)=0 s part (t, r) = 1- ( 1- s d (t, r) )( 1 s α (t, r) )( 1- s β (t, r) ) (6), otherwise The base similarity function s part is defined using functions s θ, s d, s α, and s β, which consider different components of the m-triplets. According to Equation (6), two m-triplets are totally dissimilar if they have at least one component totally dissimilar. If all component similarities are above zero, the product rule makes the similarity hight if at least one component is close to 1. The invariance to rotation is an important quality parameter for fingerprint recognition, especially for fingerprint identification. Nevertheless, for fingerprint verification, the rotation is usually restricted by sensors. The function s θ Equation (7) incorporates this information into the m-triplets similarity to increase minutia discrimination for such problems. Consequently, two m-triplets are dissimilar if their minutiae directions differ more than π/4. 0 if i ( ad π (θi t, θi r ) > π/4 ) s θ (t, r) = (7) 1 otherwise
8 Sensors 2012, The function s d Equation (8) compares m-triplets in terms of the side lengths of the triangle formed by the triplet minutiae. s d returns values in the interval [0, 1], returning 0 if at least one length difference is greater than threshold t l. s d returns 1 if all length differences are 0; that is, the triangles formed by both m-triplets are identical. 0 if i ( d t i d r i > t l ) s d (t, r) = (8) 1 max i=1...3 { d t i d r i }/t l otherwise The function s α Equation (9) compares m-triplets based on the angles formed by minutiae directions and the sides of the triangles (angles α on Figure 4). 0 if i ( ad π (αi, t αi r ) > t a ) s α (t, r) = (9) 1 max i=1...6 {ad π (αi, t αi r )}/t a otherwise The function s β Equation (10) compares m-triplets based on relative minutiae directions (angles β on Figure 4 0 if i ( ad π (βi t, βi r ) > t a ) s β (t, r) = (10) 1 max i=1...3 {ad π (βi t, βi r )}/t a otherwise Equations (9) and (10) return values in the interval [0, 1]. They return 0 if at least two compared angles differ more than threshold t a. The less the angles differ, the higher is the value returned by the equations; therefore, they return 1 if the compared angles are identical. In order to detect dissimilar m-triplets in advance, avoiding all costly shifts, we use Theorems 1, 2, and 3. Proofs for Theorems 1 and 2 appear in the appendixes. Proof of Theorem 3 is similar to the proof of Theorem 1 and is not stated. Theorem 1. Given two m-triplets t and r, if d t max d r max > t l then s inv (t, r) = 0. Theorem 2. Given two m-triplets t and r, if d t mid dr mid > t l then s inv (t, r) = 0. Theorem 3. Given two m-triplets t and r, if d t min d r min > t l then s inv (t, r) = 0. Based on these theorems, we can modify s inv Equation (5). This way, our m-triplets similarity can be re-written as Equation (11). { 0 if ( d t max d r s inv (t, r) = max > t l ) ( d t mid dr mid > t l) ( d t min d r min > t l ) (11) max{s part (t, r), s part (t, shift(r)), s part (t, shift(shift(r)))}, otherwise Local distance threshold t l and angle threshold t a are parameters of the algorithm and must be tuned according to the image characteristics. The function s inv, by means of s part, achieves the invariance to translation and the invariance to restricted rotation, the tolerance to non-linear distortion and the sensitivity to the directions of the minutiae relative to the sides of the triangle. The clockwise shifting makes function s inv invariant to the order of minutiae in the feature and sensitive to the reflection of minutiae triplets.
9 Sensors 2012, M3GL Algorithm In this section, we introduce M3gl, a new fingerprint verification algorithm based on the proposed minutiae triplet representation and similarity measure. Given a fingerprint described by the minutia set P we compute the m-triplets as follows. For each p P, find its c nearest minutiae in P and build all m-triplets that include p and two of its nearest minutiae, discarding duplicates. This way of computing m-triplets makes M3gl tolerant to the low quality of fingerprints and tolerant to errors of the feature extractor. Additionally, m-triplets in the fingerprint are sorted according to the length of the largest side to perform a binary search when looking for similar m-triplets; Theorem 1 guarantees the safety of this procedure. M3gl consists of the following major steps: local minutiae matching, global minutiae matching, and similarity score computation Local Minutiae Matching This step finds the similar m-triplets in the template fingerprint using binary search. Then, it sorts all matching pairs according to the similarity value and finds the local matching minutiae. Formally, the algorithm is the following: 1. Let Q and P be the query and template fingerprint minutiae sets respectively. Let R and T be the query and template fingerprint m-triplets sets respectively. Let A {} be the set that will contain local matching m-triplets pairs. 2. For each query m-triplet r i R perform binary search looking for the template m-triplets {t 1, t 2,..., t u } T with similarity value higher than 0 and add the pairs (r i, t 1 ), (r i, t 2 ),..., (r i, t u ) to A. 3. Sort in descendant order all matching pairs (r, t) in A according to the similarity value. 4. Let M {} be the set containing local matching minutiae pairs. 5. For each (r, t) A do (a) Let B { (q 1, p 1 ), (q 2, p 2 ), (q 3, p 3 ) } be the matching minutiae that maximizes s inv (r, t) where q 1, q 2, q 3 Q and p 1, p 2, p 3 P. (b) For each (q i, p i ) B do: i. If there is not any pair (q j, p j ) M that q j = q i or p j = p i then M M {(q i, p i )} Global Minutiae Matching This step uses every minutiae pair as a reference pair for fingerprint rotation and performs a query minutiae transformation for each reference pair. Later, it selects the transformation that maximizes the amount of matching minutiae. This strategy overcomes the limitations of the single alignment based matching. M3gl uses three criteria to determine if two minutiae match at global level and to achieve the tolerance to non-linear distortion. First, the Euclidean distance must not exceed threshold t g. Second, minutia directions must not exceed threshold t a. Third, the directions differences relative to reference minutiae pair must not exceed threshold t a. The formal algorithm is the following:
10 Sensors 2012, Let n 0 be the maximum number of matching minutiae computed after performing all fingerprint rotations. 2. For each (q i, p i ) M do: (a) Let E {} be the set containing global matching minutiae pairs for the current iteration. (b) For each (q j, p j ) M, if (q k, p k ) E [ (q j q k ) (p j p k ) ] x cos( θ) sin( θ) 0 x 3 x 1 x 2 i. Compute q = (x, y, θ ) as y = sin( θ) cos( θ) 0 y 3 y 1 + y 2 θ θ 3 θ 1 θ 2 where q i = (x 1, y 1, θ 1 ), p i = (x 2, y 2, θ 2 ), θ = θ 2 θ 1, q j = (x 3, y 3, θ 3 ). ii. Let p j = (x 4, y 4, θ 4 ); if ed(q, p j ) t g ad π ( ad2π (θ 2, θ 1 ), ad 2π (θ 4, θ 3 ) ) t a ad π (θ, θ 4 ) t a, then E E {(q j, p j )}. (c) if n < E then n E Similarity Score Computation n The similarity value is computed using the formula 2 ; where P and Q are the template and query P Q fingerprint minutiae sets respectively, and n is the amount of matching minutiae pairs. Global distance threshold t g and angle threshold t a are parameters of the algorithm, and must be tuned based on the image characteristics. 6. Experimental Results In order to evaluate the new fingerprint matching algorithm, we use databases DB1 A, DB2 A, DB3 A and DB4 A of FVC2002 and FVC2004 competitions. These databases are commonly used as benchmarks for evaluating fingerprint matchers in the context of fingerprint verification. We also use the FVC evaluation protocol [22]. Performance is measured by indicators EER, FMR100, FMR1000 and ZeroFMR. The indicator Time refers to the average matching time in milliseconds. We carry out all the experiments on a laptop with an Intel Core i7 740QM processor (1.73 GHz) and 4 GB of RAM. We use the same parameters values for M3gl in all databases (t l = 12, t g = 12, t a = π/6, c = 4). We estimate these parameters through a few experiments using fingerprint databases DB1 B, DB2 B, DB3 B and DB4 B of FVC2004 competition. In the experimental comparisons, we include the algorithm proposed by Jiang and Yau [9] (JY) because it is the most popular algorithm based on minutiae triplets in the literature. We implement the algorithm proposed by Parziale and Niel [11] (PN) because it is the algorithm based on minutiae triplets more similar to our proposal and we are interested in showing the difference in accuracy and speed. We also compare our proposal with algorithms based on other types of minutiae descriptors, that is why we implement the algorithms proposed by Wang et al. [23] (WLC), Qi et al. [24] (QYW), Tico and Kuosmanen [25] (TK), and Udupa et al. [26] (UGS). Figures 5 and 6 show that M3gl achieves lower FNMR for most of the FMR values. Tables 2 and 3 show that our algorithm achieves the best results for most of the performance indicators. Figure 7 shows examples where our algorithm is able to find true matching minutiae in difficult cases (partial
11 Sensors 2012, fingerprints with low overlapping, non-linear distortion and low quality) where the other algorithms fail. M3gl is also the fastest algorithm due to the following reasons: The m-triplets similarity function includes the properties demonstrated in Theorems 1, 2 and 3 to discard comparisons without performing all its operations. The algorithm performs binary search when looking for similar m-triplets in the local minutiae matching step. Figure 5. ROC curves with the performance of the compared algorithms in FVC2002.
12 Sensors 2012, Figure 6. ROC curves with the performance of the compared algorithms in FVC2004. The similarity score computation of M3gl is simple but robust. In order to test this robustness we substitute the similarity score computation of M3gl for the strategies proposed by Wang et al. [23], Qi et al. [24], Jiang and Yau [9], and Tico and Kuosmanen [25]; we name the new algorithms M3gl1, M3gl2, M3gl3 and M3gl4 respectively. We test M3gl and its variations in the testing databases DB1 B, DB2 B, DB3 B and DB4 B of FVC2002 and FVC2004. The experimental results (Tables 4 and 5) do not show a clear superiority of any algorithm; nevertheless, when comparing M3gl with the other algorithms by pairs, we find that M3gl wins in most of the accuracy indicators.
13 Sensors 2012, Table 2. FVC2002. Experimental results on databases DB1 A, DB2 A, DB3 A and DB4 A of Database Algorithm EER FMR100 FMR1000 ZeroFMR Time(ms) WLC D QYW B JY TK PN A UGS ,239.4 M3gl WLC D QYW B JY TK PN A UGS ,846.1 M3gl WLC D QYW B JY TK PN A UGS M3gl WLC D QYW B JY TK PN A UGS M3gl
14 Sensors 2012, Figure 7. Two examples where all matching algorithms fail but our algorithm finds true matching minutiae. The first row contains fingerprints db and db of database DB1 A (FVC2002); the second row contains fingerprints 85 6 and 85 8 of database DB1 A (FVC2004). Table 3. FVC2004. Experimental results on databases DB1 A, DB2 A, DB3 A and DB4 A of Database Algorithm EER FMR100 FMR1000 ZeroFMR Time(ms) WLC D QYW B JY TK PN A UGS ,649.4 M3gl WLC D QYW B JY
15 Sensors 2012, Table 3. Cont. Database Algorithm EER FMR100 FMR1000 ZeroFMR Time(ms) 2 TK PN A UGS ,210.8 M3gl WLC D QYW B JY TK PN A UGS ,510.9 M3gl WLC D QYW B JY TK PN A UGS ,687.1 M3gl Table 4. FVC2002. Experimental results on databases DB1 B, DB2 B, DB3 B and DB4 B of Database Algorithm EER FMR100 FMR1000 ZeroFMR Time(ms) D M3gl B M3gl M3gl M3gl B M3gl D M3gl B M3gl M3gl M3gl B M3gl D M3gl
16 Sensors 2012, Table 4. Cont. Database Algorithm EER FMR100 FMR1000 ZeroFMR Time(ms) B M3gl M3gl M3gl B M3gl D M3gl B M3gl M3gl M3gl B M3gl Table 5. FVC2004. Experimental results on databases DB1 B, DB2 B, DB3 B and DB4 B of Database Algorithm EER FMR100 FMR1000 ZeroFMR Time(ms) D M3gl B M3gl M3gl M3gl B M3gl D M3gl B M3gl M3gl M3gl B M3gl D M3gl B M3gl M3gl M3gl B M3gl D M3gl B M3gl M3gl M3gl B M3gl
17 Sensors 2012, Experimental results confirm that fulfilling the quality parameters discussed in Section 1 has a direct impact in the matcher accuracy. 7. Conclusions Fingerprint matching algorithms based on minutiae triplets have proved to be fast and accurate. They are commonly used on light architectures and in systems based on interoperability standards for fingerprints represented by minutiae. However, existing algorithms have several limitations that affect their accuracy. In this paper, we identify the quality parameters that have a more significant impact on fingerprint matching accuracy in order to create M3gl, a more accurate matcher. M3gl uses a new representation based on minutiae triplets and a new comparison function that achieves the invariance to the translation and rotation of fingerprints, and achieves the sensitivity to the directions of the minutiae relative to the sides of the triangle. The new representation arranges the minutiae in clockwise sense and the comparison function performs the three possible rotations of the triplets achieving the invariance to the order of minutiae in the feature and the sensitivity to the reflection of minutiae triplets. The components of the proposed representation are compared using thresholds that allow the tolerance to the non-linear distortion of fingerprints. Besides, the new comparison function includes optimizations that avoid comparing all the components of the triplets, increasing the matching speed in many cases. M3gl is deterministic, insensitive to select a single alignment, and sensitive to the individuality of fingerprints. It uses a simple and effective procedure to compute minutiae triplets which makes the algorithm tolerant to the low quality of fingerprints and to errors of the feature extractor. Experimental results in databases of the FVC2002 and FVC2004 competitions show that M3gl has low computational costs and is more accurate than other algorithms based on minutiae triplets and other algorithms based on different representations. In the near future we plan to study the behaviour of the new algorithm for latent fingerprint identification. Acknowledgment The authors would like to thank Dania Yudith Suárez Abreu for her valuable contribution improving the grammar and style of this paper. References 1. Zhao, Q.; Zhang, D.; Zhanga, L.; Luoa, N. High resolution partial fingerprint alignment using pore-valley descriptors. Pattern Recogn. 2010, 43, Cappelli, R.; Ferrara, M.; Maltoni, D. Minutia cylinder-code: A new representation and matching technique for fingerprint recognition. IEEE Trans. Pattern. Anal. Mach. Intell. 2010, 32, Maltoni, D.; Maio, D.; Jain, A.K.; Prabhakar, S. Handbook of Fingerprint Recognition, 2nd ed.; Springer-Verlag: London, UK, Jain, A.K.; Feng, J.; Nandakumar, K. Fingerprint matching. Computer 2010, 43,
18 Sensors 2012, Jea, T.Y. Minutiae-Based Partial Fingerprint Recognition. PhD Thesis, State University of New York, NY, USA, Jain, A.K.; Feng, J. Latent fingerprint matching. IEEE Trans. Pattern. Anal. Mach. Intell. 2011, 33, Prabhakar, S.; Ivanisov, A.; Jain, A.K. Biometric recognition: Sensor characteristics and image quality. IEEE Instrum. Meas. Mag. 2011, 14, Feng, J. Combining minutiae descriptors for fingerprint matching. Pattern Recogn. 2008, 41, Jiang, X.; Yau, W.Y. Fingerprint Minutiae Matching Based on the Local and Global Structures. In Proceedings of the 15th International Conference on Pattern Recognition, Barcelona, Spain, 3 7 September 2000; Volume 2, pp Chen, X.; Tian, J.; Yang, X. A new algorithm for distorted fingerprints matching based on normalized fuzzy similarity measure. IEEE Trans. Image Process. 2006, 15, Parziale, G.; Niel, A. A Fingerprint Matching Using Minutiae Triangulation. In Proceedings of the 1st International Conference on Biometric Authentication, Hong Kong, China, July 2004; Volume LNCS 3072, pp Jea, T.Y.; Govindaraju, V. A minutia-based partial fingerprint recognition system. Pattern Recogn. 2005, 38, Reisman, J.; Uludag, U.; Ross, A. Secure Fingerprint Matching with External Registration. In Proceedings of the 5th International Conference on Audio- and Video-Based Biometric Person Authentication (AVBPA 05), Tarrytown, NY, USA, July 2005; Volume LNCS 3546, pp Kovcs-Vajna, Z.M. A fingerprint verification system based on triangular matching and dynamic time warping. IEEE Trans. Pattern. Anal. Mach. Intell. 2000, 22, Tan, X.; Bhanu, B. Fingerprint matching by genetic algorithms. Pattern Recogn. 2006, 39, Feng, Y.; Feng, J.; Chen, X.; Song, Z. A Novel Fingerprint Matching Scheme Based on Local Structure Compatibility. In Proceedings of the 18th International Conference on Pattern Recognition, Hong Kong, China, August 2006; Volume 4, pp Chen, X.; Tian, J.; Yang, X.; Zhang, Y. An algorithm for distorted fingerprint matching based on local triangle feature set. IEEE Trans. Inf. Forensics Secur. 2006, 1, Xu, W.; Chen, X.; Feng, J. A Robust Fingerprint Matching Approach: Growing and Fusing of Local Structures. In Proceedings of the 2nd International Conference on Biometrics, Seoul, Korea, August 2007; Volume LNCS 4642, pp Zheng, J.D.; Gao, Y.; Zhang, M.Z. Fingerprint Matching Algorithm Based on Similar Vector Triangle. In Proceedings of the 2nd International Congress on Image and Signal Processing (CISP 09), Tianjin, China, October 2009; pp Hoyle, K. Minutiae Triplet-Based Features with Extended Ridge Information for Determining Sufficiency in Fingerprints. Master Thesis, Virginia Polytechnic Institute and State University, Burruss Hall Blacksburg, VA, USA, 2011.
19 Sensors 2012, Ghazvini, M.; Sufikarimi, H.; Mohammadi, K. Fingerprint Matching Using Genetic Algorithm and Triangle Descriptors. In Proceedings of the 19th Iranian Conference on Electrical Engineering, Tehran, Iran, May 2011; pp Cappelli, R.; Maio, D.; Maltoni, D.; Wayman, J.L.; Jain, A.K. Performance evaluation of fingerprint verification systems. IEEE Trans. Pattern. Anal. Mach. Intell. 2006, 28, Wang, W.; Li, J.; Chen, W. Fingerprint Minutiae Matching Based on Coordinate System Bank and Global Optimum Alignment. In Proceedings of the 18th International Conference on Pattern Recognition, Hong Kong, China, August 2006; Volume 4, pp Qi, J.; Yang, S.; Wang, Y. Fingerprint matching combining the global orientation field with minutia. Pattern Recogn. Lett. 2005, 26, Tico, M.; Kuosmanen, P. Fingerprint matching using an orientation-based minutia descriptor. IEEE Trans. Pattern. Anal. Mach. Intell. 2003, 25, Udupa U, R.; Garg, G.; Sharma, P. Fast and Accurate Fingerprint Verification. In Proceedings of the 3rd International Conference on Audio- and Video-Based Biometric Person Authentication (AVBPA 01), Halmstad, Sweden, 6 8 June 2001; Volume LNCS 2091, pp Appendix Theorem Proofs Theorem A1. Given two m-triplets t and r, if d t max d r max > t l then s inv (t, r) = 0. Proof. From the definition of m-triplet we have: d r max d r mid d r max d r min d r mid d r min (A1) (A2) (A3) Assume, without loss of generality, that d t max > d r max; then, from the hypothesis of Theorem A1, we infer that: d t max d r max > t l (A4) which is equivalent to: d t max t l > d r max (A5) From Equations (A5) and (A1) we have d t max t l > d r mid ; which is equivalent to: d t max d r mid > t l (A6) Similarly, from Equations (A5) and (A2) we obtain: d t max d r min > t l (A7) From Equations (A4), (A6) and (A7) we conclude that d t max differs more than threshold t l with respect to d r max, d r mid and dr min respectively. Therefore, s d (t, r) returns 0 for every clockwise shifting of r and consequently s inv (t, r) = 0.
20 Sensors 2012, Theorem A2. Given two m-triplets t and r, if d t mid dr mid > t l then s inv (t, r) = 0. Proof. From the definition of m-triplet we have: d t max d t mid (A8) Assume, without loss of generality, that d t mid > dr mid ; then, from the hypothesis of Theorem A2, we infer that: d t mid d r mid > t l (A9) which is equivalent to: d t mid t l > d r mid (A10) From Equation (A10) and (A3) we have d t mid t l > d r min; which is equivalent to: d t mid d r min > t l (A11) Similarly, from Equations (A8) and (A9) we obtain: d t max d r mid > t l (A12) Additionally, from Equations (A8) and (A11) we obtain: d t max d r min > t l (A13) From Equations (A9), (A11), (A12) and (A13) we conclude that d t max and d t mid differ more than threshold t l with respect to both d r mid, dr min. Therefore, s d (t, r) returns 0 for every clockwise shifting of r and consequently s inv (t, r) = 0. c 2012 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (
FVC2004: Third Fingerprint Verification Competition
FVC2004: Third Fingerprint Verification Competition D. Maio 1, D. Maltoni 1, R. Cappelli 1, J.L. Wayman 2, A.K. Jain 3 1 Biometric System Lab - DEIS, University of Bologna, via Sacchi 3, 47023 Cesena -
More informationIndexing Fingerprints using Minutiae Quadruplets
Indexing Fingerprints using Minutiae Quadruplets Ogechukwu Iloanusi University of Nigeria, Nsukka oniloanusi@gmail.com Aglika Gyaourova and Arun Ross West Virginia University http://www.csee.wvu.edu/~ross
More informationFingerprint Identification Using SIFT-Based Minutia Descriptors and Improved All Descriptor-Pair Matching
Sensors 2013, 13, 3142-3156; doi:10.3390/s130303142 Article OPEN ACCESS sensors ISSN 1424-8220 www.mdpi.com/journal/sensors Fingerprint Identification Using SIFT-Based Minutia Descriptors and Improved
More informationOutline. Incorporating Biometric Quality In Multi-Biometrics FUSION. Results. Motivation. Image Quality: The FVC Experience
Incorporating Biometric Quality In Multi-Biometrics FUSION QUALITY Julian Fierrez-Aguilar, Javier Ortega-Garcia Biometrics Research Lab. - ATVS Universidad Autónoma de Madrid, SPAIN Loris Nanni, Raffaele
More informationFingerprint matching using ridges
Fingerprint matching using ridges Jianjiang Feng a, *, Zhengyu Ouyang a, and Anni Cai a a Beijing University of Posts and Telecommunications, Box 113, Beijing, 100876, P. R. China *Corresponding author.
More informationLocal Correlation-based Fingerprint Matching
Local Correlation-based Fingerprint Matching Karthik Nandakumar Department of Computer Science and Engineering Michigan State University, MI 48824, U.S.A. nandakum@cse.msu.edu Anil K. Jain Department of
More informationFingerprint Indexing using Minutiae and Pore Features
Fingerprint Indexing using Minutiae and Pore Features R. Singh 1, M. Vatsa 1, and A. Noore 2 1 IIIT Delhi, India, {rsingh, mayank}iiitd.ac.in 2 West Virginia University, Morgantown, USA, afzel.noore@mail.wvu.edu
More informationUsing Support Vector Machines to Eliminate False Minutiae Matches during Fingerprint Verification
Using Support Vector Machines to Eliminate False Minutiae Matches during Fingerprint Verification Abstract Praveer Mansukhani, Sergey Tulyakov, Venu Govindaraju Center for Unified Biometrics and Sensors
More informationCall for participation. FVC2004: Fingerprint Verification Competition 2004
Call for participation FVC2004: Fingerprint Verification Competition 2004 WEB SITE: http://bias.csr.unibo.it/fvc2004/ The Biometric System Lab (University of Bologna), the Pattern Recognition and Image
More informationPCA AND CENSUS TRANSFORM BASED FINGERPRINT RECOGNITION WITH HIGH ACCEPTANCE RATIO
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 6.017 IJCSMC,
More informationFinger Print Enhancement Using Minutiae Based Algorithm
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 8, August 2014,
More informationRemote authentication using Vaulted Fingerprint Verification
Remote authentication using Vaulted Fingerprint Verification Hamdan Alzahrani, a Terrance E. Boult University of Colorado, Colorado Springs, CO, USA ABSTRACT This paper presents a novel approach to remotely
More informationFingerprint Recognition Based on Combined Features
Fingerprint Recognition Based on Combined Features Yangyang Zhang, Xin Yang, Qi Su, and Jie Tian Center for Biometrics and Security Research, Key Laboratory of Complex Systems and Intelligence Science,
More informationMinutia Cylindrical Code Based Approach for Fingerprint Matching
Minutia Cylindrical Code Based Approach for Fingerprint Matching Dilip Tamboli 1, Mr.Sandeep B Patil 2, Dr.G.R.Sinha 3 1 P.G. Scholar, Department of Electronics & Telecommunication Engg. SSGI Bhilai, C.G.India
More informationIncorporating Image Quality in Multi-Algorithm Fingerprint Verification
Incorporating Image Quality in Multi-Algorithm Fingerprint Verification Julian Fierrez-Aguilar 1, Yi Chen 2, Javier Ortega-Garcia 1, and Anil K. Jain 2 1 ATVS, Escuela Politecnica Superior, Universidad
More informationROBUST LATENT FINGERPRINT MATCHING USING SUPPORT VECTOR MACHINE
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 ROBUST LATENT FINGERPRINT MATCHING USING SUPPORT VECTOR MACHINE S.Kathiravan 1, Ms.Abinaya K.samy 2 1 PG Scholar,
More informationVerifying Fingerprint Match by Local Correlation Methods
Verifying Fingerprint Match by Local Correlation Methods Jiang Li, Sergey Tulyakov and Venu Govindaraju Abstract Most fingerprint matching algorithms are based on finding correspondences between minutiae
More informationEfficient Rectification of Malformation Fingerprints
Efficient Rectification of Malformation Fingerprints Ms.Sarita Singh MCA 3 rd Year, II Sem, CMR College of Engineering & Technology, Hyderabad. ABSTRACT: Elastic distortion of fingerprints is one of the
More informationA Framework for Efficient Fingerprint Identification using a Minutiae Tree
A Framework for Efficient Fingerprint Identification using a Minutiae Tree Praveer Mansukhani February 22, 2008 Problem Statement Developing a real-time scalable minutiae-based indexing system using a
More informationFingerprint matching using ridges
Pattern Recognition 39 (2006) 2131 2140 www.elsevier.com/locate/patcog Fingerprint matching using ridges Jianjiang Feng, Zhengyu Ouyang, Anni Cai School of Telecommunication Engineering, Beijing University
More informationFingerprint Matching using Gabor Filters
Fingerprint Matching using Gabor Filters Muhammad Umer Munir and Dr. Muhammad Younas Javed College of Electrical and Mechanical Engineering, National University of Sciences and Technology Rawalpindi, Pakistan.
More informationReducing FMR of Fingerprint Verification by Using the Partial Band of Similarity
Reducing FMR of Fingerprint Verification by Using the Partial Band of Similarity Seung-Hoon Chae 1,Chang-Ho Seo 2, Yongwha Chung 3, and Sung Bum Pan 4,* 1 Dept. of Information and Communication Engineering,
More informationA New Pairing Method for Latent and Rolled Finger Prints Matching
International Journal of Emerging Engineering Research and Technology Volume 2, Issue 3, June 2014, PP 163-167 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) A New Pairing Method for Latent and Rolled
More informationA new approach to reference point location in fingerprint recognition
A new approach to reference point location in fingerprint recognition Piotr Porwik a) and Lukasz Wieclaw b) Institute of Informatics, Silesian University 41 200 Sosnowiec ul. Bedzinska 39, Poland a) porwik@us.edu.pl
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Fingerprint Recognition using Robust Local Features Madhuri and
More informationRotation Invariant Finger Vein Recognition *
Rotation Invariant Finger Vein Recognition * Shaohua Pang, Yilong Yin **, Gongping Yang, and Yanan Li School of Computer Science and Technology, Shandong University, Jinan, China pangshaohua11271987@126.com,
More informationMultimodal Biometric Authentication using Face and Fingerprint
IJIRST National Conference on Networks, Intelligence and Computing Systems March 2017 Multimodal Biometric Authentication using Face and Fingerprint Gayathri. R 1 Viji. A 2 1 M.E Student 2 Teaching Fellow
More informationMahmood Fathy Computer Engineering Department Iran University of science and technology Tehran, Iran
1 Alignment-Free Fingerprint Cryptosystem Based On Multiple Fuzzy Vault and Minutia Local Structures Ali Akbar Nasiri Computer Engineering Department Iran University of science and technology Tehran, Iran
More informationOnline and Offline Fingerprint Template Update Using Minutiae: An Experimental Comparison
Online and Offline Fingerprint Template Update Using Minutiae: An Experimental Comparison Biagio Freni, Gian Luca Marcialis, and Fabio Roli University of Cagliari Department of Electrical and Electronic
More informationFINGERPRINT RECOGNITION BASED ON SPECTRAL FEATURE EXTRACTION
FINGERPRINT RECOGNITION BASED ON SPECTRAL FEATURE EXTRACTION Nadder Hamdy, Magdy Saeb 2, Ramy Zewail, and Ahmed Seif Arab Academy for Science, Technology & Maritime Transport School of Engineering,. Electronics
More informationA New Point-set Registration Algorithm for Fingerprint Matching
1 A New Point-set Registration Algorithm for Fingerprint Matching A. Pasha Hosseinbor, Renat Zhdanov, and Alexander Ushveridze arxiv:1702.01870v1 [cs.cv] 7 Feb 2017 Abstract A novel minutia-based fingerprint
More informationDevelopment of an Automated Fingerprint Verification System
Development of an Automated Development of an Automated Fingerprint Verification System Fingerprint Verification System Martin Saveski 18 May 2010 Introduction Biometrics the use of distinctive anatomical
More informationReference Point Detection for Arch Type Fingerprints
Reference Point Detection for Arch Type Fingerprints H.K. Lam 1, Z. Hou 1, W.Y. Yau 1, T.P. Chen 1, J. Li 2, and K.Y. Sim 2 1 Computer Vision and Image Understanding Department Institute for Infocomm Research,
More informationMinutia Cylinder-Code:
BioLab - Biometric System Lab University of Bologna - ITALY http://biolab.csr.unibo.it Minutia Cylinder-Code: A new representation and matching technique for Dott. Matteo Ferrara Topics Overview of fingerprint
More informationFingerprint Ridge Orientation Estimation Using A Modified Canny Edge Detection Mask
Fingerprint Ridge Orientation Estimation Using A Modified Canny Edge Detection Mask Laurice Phillips PhD student laurice.phillips@utt.edu.tt Margaret Bernard Senior Lecturer and Head of Department Margaret.Bernard@sta.uwi.edu
More informationImplementation of Fingerprint Matching Algorithm
RESEARCH ARTICLE International Journal of Engineering and Techniques - Volume 2 Issue 2, Mar Apr 2016 Implementation of Fingerprint Matching Algorithm Atul Ganbawle 1, Prof J.A. Shaikh 2 Padmabhooshan
More informationFingerprint Classification Using Orientation Field Flow Curves
Fingerprint Classification Using Orientation Field Flow Curves Sarat C. Dass Michigan State University sdass@msu.edu Anil K. Jain Michigan State University ain@msu.edu Abstract Manual fingerprint classification
More informationFingerprint Deformation Models Using Minutiae Locations and Orientations
Fingerprint Deformation Models Using Minutiae Locations and Orientations Yi Chen, Sarat Dass, Arun Ross, and Anil Jain Department of Computer Science and Engineering Michigan State University East Lansing,
More informationUse of Mean Square Error Measure in Biometric Analysis of Fingerprint Tests
Journal of Information Hiding and Multimedia Signal Processing c 2015 ISSN 2073-4212 Ubiquitous International Volume 6, Number 5, September 2015 Use of Mean Square Error Measure in Biometric Analysis of
More informationA hierarchical Hough transform for fingerprint. matching. Liu Chaoqiang,
A hierarchical Hough transform for fingerprint 1 matching Liu Chaoqiang, Temasek Laboratories and Centre for Wavelets, Approximation and Information Processing, National University of Singapore, tslliucq@nus.edu.sg
More informationLocal Feature Extraction in Fingerprints by Complex Filtering
Local Feature Extraction in Fingerprints by Complex Filtering H. Fronthaler, K. Kollreider, and J. Bigun Halmstad University, SE-30118, Sweden {hartwig.fronthaler, klaus.kollreider, josef.bigun}@ide.hh.se
More informationFingerprint Ridge Distance Estimation: Algorithms and the Performance*
Fingerprint Ridge Distance Estimation: Algorithms and the Performance* Xiaosi Zhan, Zhaocai Sun, Yilong Yin, and Yayun Chu Computer Department, Fuyan Normal College, 3603, Fuyang, China xiaoszhan@63.net,
More informationA Full Analytical Review on Fingerprint Recognition using Neural Networks
e t International Journal on Emerging Technologies (Special Issue on RTIESTM-2016) 7(1): 45-49(2016) ISSN No. (Print) : 0975-8364 ISSN No. (Online) : 2249-3255 A Full Analytical Review on Fingerprint Recognition
More informationSIGNIFICANT improvements in fingerprint recognition
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 15, NO. 3, MARCH 2006 767 A New Algorithm for Distorted Fingerprints Matching Based on Normalized Fuzzy Similarity Measure Xinjian Chen, Jie Tian, Senior Member,
More informationwavelet packet transform
Research Journal of Engineering Sciences ISSN 2278 9472 Combining left and right palmprint for enhanced security using discrete wavelet packet transform Abstract Komal Kashyap * and Ekta Tamrakar Department
More informationFeature-level Fusion for Effective Palmprint Authentication
Feature-level Fusion for Effective Palmprint Authentication Adams Wai-Kin Kong 1, 2 and David Zhang 1 1 Biometric Research Center, Department of Computing The Hong Kong Polytechnic University, Kowloon,
More informationAN AVERGE BASED ORIENTATION FIELD ESTIMATION METHOD FOR LATENT FINGER PRINT MATCHING.
AN AVERGE BASED ORIENTATION FIELD ESTIMATION METHOD FOR LATENT FINGER PRINT MATCHING. B.RAJA RAO 1, Dr.E.V.KRISHNA RAO 2 1 Associate Professor in E.C.E Dept,KITS,DIVILI, Research Scholar in S.C.S.V.M.V
More informationAT PRESENT, fingerprint identification is much more reliable
1204 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 37, NO. 5, OCTOBER 2007 Modeling and Analysis of Local Comprehensive Minutia Relation for Fingerprint Matching Xiaoguang
More informationUjma A. Mulla 1 1 PG Student of Electronics Department of, B.I.G.C.E., Solapur, Maharashtra, India. IJRASET: All Rights are Reserved
Generate new identity from fingerprints for privacy protection Ujma A. Mulla 1 1 PG Student of Electronics Department of, B.I.G.C.E., Solapur, Maharashtra, India Abstract : We propose here a novel system
More informationThis is the published version:
This is the published version: Youssif, A.A.A., Chowdhury, Morshed, Ray, Sid and Nafaa, H.Y. 2007, Fingerprint recognition system using hybrid matching techniques, in 6th IEEE/ACIS International Conference
More informationComparison of fingerprint enhancement techniques through Mean Square Error and Peak-Signal to Noise Ratio
Comparison of fingerprint enhancement techniques through Mean Square Error and Peak-Signal to Noise Ratio M. M. Kazi A. V. Mane R. R. Manza, K. V. Kale, Professor and Head, Abstract In the fingerprint
More informationCombined Fingerprint Minutiae Template Generation
Combined Fingerprint Minutiae Template Generation Guruprakash.V 1, Arthur Vasanth.J 2 PG Scholar, Department of EEE, Kongu Engineering College, Perundurai-52 1 Assistant Professor (SRG), Department of
More informationDistorted Fingerprint Verification System
Informatica Economică vol. 15, no. 4/2011 13 Distorted Fingerprint Verification System Divya KARTHIKAESHWARAN 1, Jeyalatha SIVARAMAKRISHNAN 2 1 Department of Computer Science, Amrita University, Bangalore,
More informationFingerprint Image Enhancement Algorithm and Performance Evaluation
Fingerprint Image Enhancement Algorithm and Performance Evaluation Naja M I, Rajesh R M Tech Student, College of Engineering, Perumon, Perinad, Kerala, India Project Manager, NEST GROUP, Techno Park, TVM,
More informationA comparison of 2D and 3D Delaunay triangulations for fingerprint authentication
Edith Cowan University Research Online Australian Information Security Management Conference Conferences, Symposia and Campus Events 2017 A comparison of 2D and 3D Delaunay triangulations for fingerprint
More informationA New Approach To Fingerprint Recognition
A New Approach To Fingerprint Recognition Ipsha Panda IIIT Bhubaneswar, India ipsha23@gmail.com Saumya Ranjan Giri IL&FS Technologies Ltd. Bhubaneswar, India saumya.giri07@gmail.com Prakash Kumar IL&FS
More informationA New Enhancement Of Fingerprint Classification For The Damaged Fingerprint With Adaptive Features
A New Enhancement Of Fingerprint Classification For The Damaged Fingerprint With Adaptive Features R.Josphineleela a, M.Ramakrishnan b And Gunasekaran c a Department of information technology, Panimalar
More informationFingerprint Recognition System
Fingerprint Recognition System Praveen Shukla 1, Rahul Abhishek 2, Chankit jain 3 M.Tech (Control & Automation), School of Electrical Engineering, VIT University, Vellore Abstract - Fingerprints are one
More informationPerformance Analysis of Fingerprint Identification Using Different Levels of DTCWT
2012 International Conference on Information and Computer Applications (ICICA 2012) IPCSIT vol. 24 (2012) (2012) IACSIT Press, Singapore Performance Analysis of Fingerprint Identification Using Different
More informationPublished by: PIONEER RESEARCH & DEVELOPMENT GROUP (www.prdg.org) 1
Minutiae Points Extraction using Biometric Fingerprint- Enhancement Vishal Wagh 1, Shefali Sonavane 2 1 Computer Science and Engineering Department, Walchand College of Engineering, Sangli, Maharashtra-416415,
More informationGurmeet Kaur 1, Parikshit 2, Dr. Chander Kant 3 1 M.tech Scholar, Assistant Professor 2, 3
Volume 8 Issue 2 March 2017 - Sept 2017 pp. 72-80 available online at www.csjournals.com A Novel Approach to Improve the Biometric Security using Liveness Detection Gurmeet Kaur 1, Parikshit 2, Dr. Chander
More informationSecure Fingerprint Matching with External Registration
Secure Fingerprint Matching with External Registration James Reisman 1, Umut Uludag 2, and Arun Ross 3 1 Siemens Corporate Research, 755 College Road East, Princeton, NJ, 08540 james.reisman@siemens.com
More informationPalmprint Indexing Based on Ridge Features
Palmprint Indexing Based on Ridge Features Xiao Yang, Jianjiang Feng, Jie Zhou Department of Automation Tsinghua University, Beijing, China xiao-yang09@mails.tsinghua.edu.cn, jfeng@tsinghua.edu.cn, jzhou@tsinghua.edu.cn
More informationMining Rare Features in Fingerprints Using Core Points and Triplet-based Features
Mining Rare Features in Fingerprints Using Core Points and Triplet-based Features Indira Munagani Thesis submitted to the faculty of the Virginia Polytechnic Institute and State University in partial fulfillment
More informationAN EFFICIENT METHOD FOR FINGERPRINT RECOGNITION FOR NOISY IMAGES
International Journal of Computer Science and Communication Vol. 3, No. 1, January-June 2012, pp. 113-117 AN EFFICIENT METHOD FOR FINGERPRINT RECOGNITION FOR NOISY IMAGES Vijay V. Chaudhary 1 and S.R.
More informationImproving Latent Fingerprint Matching Performance by Orientation Field Estimation using Localized Dictionaries
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 11, November 2014,
More informationAvailable online at ScienceDirect. Procedia Computer Science 58 (2015 )
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 58 (2015 ) 552 557 Second International Symposium on Computer Vision and the Internet (VisionNet 15) Fingerprint Recognition
More informationPerformance Improvement in Binarization for Fingerprint Recognition
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 19, Issue 3, Ver. II (May.-June. 2017), PP 68-74 www.iosrjournals.org Performance Improvement in Binarization
More informationFINGERPRINT MATCHING BASED ON STATISTICAL TEXTURE FEATURES
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 9, September 2014,
More informationBIOMET: A Multimodal Biometric Authentication System for Person Identification and Verification using Fingerprint and Face Recognition
BIOMET: A Multimodal Biometric Authentication System for Person Identification and Verification using Fingerprint and Face Recognition Hiren D. Joshi Phd, Dept. of Computer Science Rollwala Computer Centre
More informationPublished by: PIONEER RESEARCH & DEVELOPMENT GROUP (www.prdg.org) 1
Enhancing Security in Identity Documents Using QR Code RevathiM K 1, Annapandi P 2 and Ramya K P 3 1 Information Technology, Dr.Sivanthi Aditanar College of Engineering, Tiruchendur, Tamilnadu628215, India
More informationFingerprint verification by decision-level fusion of optical and capacitive sensors
Fingerprint verification by decision-level fusion of optical and capacitive sensors Gian Luca Marcialis and Fabio Roli Department of Electrical and Electronic Engineering University of Cagliari Piazza
More informationBiometric Security Systems for Mobile Devices based on Fingerprint Recognition Algorithm
Biometric Security Systems for Mobile Devices based on Fingerprint Recognition Algorithm Michał Szczepanik, Ireneusz Jóźwiak Institute of Informatics, Wrocław University of Technologies Wybrzeże Wyspiańskiego
More informationFingerprint Mosaicking by Rolling with Sliding
Fingerprint Mosaicking by Rolling with Sliding Kyoungtaek Choi, Hunjae Park, Hee-seung Choi and Jaihie Kim Department of Electrical and Electronic Engineering,Yonsei University Biometrics Engineering Research
More informationPolar Harmonic Transform for Fingerprint Recognition
International Journal Of Engineering Research And Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 13, Issue 11 (November 2017), PP.50-55 Polar Harmonic Transform for Fingerprint
More informationKeywords Wavelet decomposition, SIFT, Unibiometrics, Multibiometrics, Histogram Equalization.
Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Secure and Reliable
More informationAbstract -Fingerprints are the most widely. Keywords:fingerprint; ridge pattern; biometric;
Analysis Of Finger Print Detection Techniques Prof. Trupti K. Wable *1(Assistant professor of Department of Electronics & Telecommunication, SVIT Nasik, India) trupti.wable@pravara.in*1 Abstract -Fingerprints
More informationFingerprint Minutiae Matching Using Adjacent Feature Vector
Fingerprint Minutiae Matching Using Adjacent Feature Vector X. Tong, J. Huang, X. Tang and D. Shi 2* School of Computer Science and Technology, Harbin Institute of Technology, Harbin, P. R. China 2 School
More informationDetecting Fingerprint Distortion from a Single Image
Detecting Fingerprint Distortion from a Single Image Xuanbin Si, Jianjiang Feng, Jie Zhou Department of Automation, Tsinghua University Beijing 100084, China sixb10@mails.tsinghua.edu.cn {jfeng, jzhou}@tsinghua.edu.cn
More informationKeywords:- Fingerprint Identification, Hong s Enhancement, Euclidian Distance, Artificial Neural Network, Segmentation, Enhancement.
Volume 5, Issue 8, August 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Embedded Algorithm
More informationFocal Point Detection Based on Half Concentric Lens Model for Singular Point Extraction in Fingerprint
Focal Point Detection Based on Half Concentric Lens Model for Singular Point Extraction in Fingerprint Natthawat Boonchaiseree and Vutipong Areekul Kasetsart Signal & Image Processing Laboratory (KSIP
More informationFast Match-on-Card technique using In-Matcher Clustering with ISO Minutia Template
Fast Match-on-Card technique using In-Matcher Clustering with ISO Minutia Template Tai-Pang Chen Institute for Infocomm Research, 1 Fusionopolis Way, #21-01 Connexis (South Tower), Singapore 138632 E-mail:
More informationBiometric Security System Using Palm print
ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Special Issue 3, March 2014 2014 International Conference
More informationA Novel Image Alignment and a Fast Efficient Localized Euclidean Distance Minutia Matching Algorithm for Fingerprint Recognition System
Ridge ings Ridge bifurcation The International Arab Journal of Information Technology Vol. 13, No. 6B, 2016 1061 A Novel Image Alignment and a Fast Efficient Localized Euclidean Distance Minutia Matching
More informationKeywords Fingerprint enhancement, Gabor filter, Minutia extraction, Minutia matching, Fingerprint recognition. Bifurcation. Independent Ridge Lake
Volume 4, Issue 8, August 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A novel approach
More informationSeparation of Overlapped Fingerprints for Forensic Applications
Separation of Overlapped Fingerprints for Forensic Applications J.Vanitha 1, S.Thilagavathi 2 Assistant Professor, Dept. Of ECE, VV College of Engineering, Tisaiyanvilai, Tamilnadu, India 1 Assistant Professor,
More informationA hierarchical classification method for finger knuckle print recognition
Kong et al. EURASIP Journal on Advances in Signal Processing 014, 014:44 RESEARCH A hierarchical classification method for finger knuckle print recognition Tao Kong, Gongping Yang * and Lu Yang Open Access
More informationImplementation of Minutiae Based Fingerprint Identification System using Crossing Number Concept
Implementation of Based Fingerprint Identification System using Crossing Number Concept Atul S. Chaudhari #1, Dr. Girish K. Patnaik* 2, Sandip S. Patil +3 #1 Research Scholar, * 2 Professor and Head, +3
More informationDIGITAL IMAGE PROCESSING APPROACH TO FINGERPRINT AUTHENTICATION
DAAAM INTERNATIONAL SCIENTIFIC BOOK 2012 pp. 517-526 CHAPTER 43 DIGITAL IMAGE PROCESSING APPROACH TO FINGERPRINT AUTHENTICATION RAKUN, J.; BERK, P.; STAJNKO, D.; OCEPEK, M. & LAKOTA, M. Abstract: In this
More informationEmbedded Palmprint Recognition System on Mobile Devices
Embedded Palmprint Recognition System on Mobile Devices Yufei Han, Tieniu Tan, Zhenan Sun, and Ying Hao Center for Biometrics and Security Research National Labrotory of Pattern Recognition,Institue of
More informationKeywords: Biometrics, Fingerprint, Minutia, Fractal Dimension, Box Counting.
Volume 4, Issue 1, January 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Fingerprint
More informationReconstructing Ridge Frequency Map from Minutiae Template of Fingerprints
Reconstructing Ridge Frequency Map from Minutiae Template of Fingerprints Wei Tang, Yukun Liu College of Measurement & Control Technology and Communication Engineering Harbin University of Science and
More informationComparison of ROC-based and likelihood methods for fingerprint verification
Comparison of ROC-based and likelihood methods for fingerprint verification Sargur Srihari, Harish Srinivasan, Matthew Beal, Prasad Phatak and Gang Fang Department of Computer Science and Engineering University
More informationImage Stitching Using Partial Latent Fingerprints
Image Stitching Using Partial Latent Fingerprints by Stuart Christopher Ellerbusch Bachelor of Science Business Administration, Accounting University of Central Florida, 1996 Master of Science Computer
More informationGraph Matching Iris Image Blocks with Local Binary Pattern
Graph Matching Iris Image Blocs with Local Binary Pattern Zhenan Sun, Tieniu Tan, and Xianchao Qiu Center for Biometrics and Security Research, National Laboratory of Pattern Recognition, Institute of
More informationImplementation of the USB Token System for Fingerprint Verification
Implementation of the USB Token System for Fingerprint Verification Daesung Moon, Youn Hee Gil, Sung Bum Pan, and Yongwha Chung Biometrics Technology Research Team, ETRI, Daejeon, Korea {daesung, yhgil,
More informationLearning Minutiae Neighborhoods : A New Binary Representation for Matching Fingerprints
Learning Minutiae Neighborhoods : A New Binary Representation for Matching Fingerprints Akhil Vij and Anoop Namboodiri International Institute of Information Technology Hyderabad, 500032, India akhil.vij@research.iiit.ac.in,
More informationLatent Fingerprint Indexing: Fusion of Level 1 and Level 2 Features
Latent Fingerprint Indexing: Fusion of Level 1 and Level 2 Features Alessandra A. Paulino, Eryun Liu, Kai Cao and Anil K. Jain Michigan State University East Lansing, MI, USA {paulinoa,liueryun,kaicao,jain}@cse.msu.edu
More informationA New Method for Skeleton Pruning
A New Method for Skeleton Pruning Laura Alejandra Pinilla-Buitrago, José Fco. Martínez-Trinidad, and J.A. Carrasco-Ochoa Instituto Nacional de Astrofísica, Óptica y Electrónica Departamento de Ciencias
More informationSingular Point Detection for Efficient Fingerprint Classification
Singular Point Detection for Efficient Fingerprint Classification Ali Ismail Awad and Kensuke Baba Graduate School of Information Science and Electrical Engineering Kyushu University Library 10-1, Hakozaki
More information