10.07.2015 Views

Fingerprint Deformation Models Using Minutiae Locations and ...

Fingerprint Deformation Models Using Minutiae Locations and ...

Fingerprint Deformation Models Using Minutiae Locations and ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Appeared in Proc. of IEEE Workshop on Applications of Computer Vision (WACV), (Breckenridge, Colorado), pp. 150-155, January 2005(a)(b)(c)(d)Figure 2: Improvement in correspondences (indicated by arrows) between two sets of minutiae point patterns. (a) <strong>and</strong> (b) are correspondencesobtained by the EPPM algorithm while (c) <strong>and</strong> (d) are correspondences obtained by the new algorithm for the same pairs offingerprint images.1. Given a pair of images, I 0 (called template) <strong>and</strong>I 1 (called query), we extract minutiae points usingthe method proposed in [9]. Assume M 0 =(u 1 , u 2 , ..., u m0 ) is the set of minutiae points extractedfrom I 0 <strong>and</strong> M 1 = (v 1 , v 2 , ..., v m1 ) from I 1 . Wealso trace the ridge associated with each minutiae point<strong>and</strong> extract sample points on that ridge (sampled every5-th point), with R ui = (u ∗ i,1 , u∗ i,2 , ..., u∗ i,a ) <strong>and</strong>R vj = (vj,1 ∗ , v∗ j,2 , ..., v∗ j,b ) denoting the ridge pointscorresponding to the minutiae u i <strong>and</strong> v j , respectively.2. For a total of m 0 · m 1 possible pairings of minutiaepoints, we select one (u i , v j ), (i = 1, 2, ..., m 0 ,j = 1, 2, ..., m 1 ) as the reference pair <strong>and</strong> transformremaining minutiae points in M 0 <strong>and</strong> M 1 ,respectively,to polar coordinates with centers at u i <strong>and</strong> v j .3. The query minutiae set M 1 is rotated about its referenceminutiae v j in order to find c<strong>and</strong>idate pairingswith M 0 . Each c<strong>and</strong>idate pair is verified using abounding box. Let MP ij be the total number of matchingpairs for (u i , v j ).4. Compute (∆x ij , ∆y ij , ∆θ ij ) as the translational (in x<strong>and</strong> y directions) <strong>and</strong> rotational offsets associated with(u i , v j ). Then add votes to V ote(∆x ij , ∆y ij , ∆θ ij )with the number of votes equal to MP ij .5. Perform steps 2-4 until all possible reference pairs areconsidered <strong>and</strong> votes for the corresponding transformationparameters are obtained.6. Establish bins with size of (20, 20, 15) <strong>and</strong> collectvotes for each bin. The top 5 bins with themaximum number of votes are selected <strong>and</strong> each(∆x ij , ∆y ij , ∆θ ij ) that contribute to one of the top 5bins are sent to a 2-D dynamic matching algorithm toget the matching score [13].7. The one that results in the highest matching score is finallychosen as the optimal global transformation <strong>and</strong>is used to establish the individual minutiae correspondenceswithin a bounding box.Fig. 2 shows examples of correspondences generated byusing the original EPPM algorithm [9] <strong>and</strong> the modified algorithm.Let (T/C) denote the ratio of the detected correspondencesto the number of correct correspondences thatare manually verified. Figs. 2(c) <strong>and</strong> 2(d) give higher ratiosof (7/7) <strong>and</strong> (10/10) compared to Figs. 2(a) <strong>and</strong> 2(b) thatgive low values of (0/4) <strong>and</strong> (1/3).4 Incorporating <strong>Minutiae</strong> OrientationOne difficulty in incorporating minutiae orientation informationis that transformation in the orientation space isnot equivalent to transformation in the the spatial domain;for example, rotation in the spatial domain corresponds totranslation in the orientation space. Thus, in order to use theTPS to model deformations using minutiae locations <strong>and</strong>orientations, we convert the orientation information into thespatial domain using the following method.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!