0% found this document useful (0 votes)
34 views5 pages

Fingerprint Matching Innovations

IPASJ International Journal of Computer Science (IIJCS) Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm A Publisher for Research Motivation ........ Email: [email protected] Volume 2, Issue 3, March 2014 ISSN 2321-5992
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views5 pages

Fingerprint Matching Innovations

IPASJ International Journal of Computer Science (IIJCS) Web Site: http://www.ipasj.org/IIJCS/IIJCS.htm A Publisher for Research Motivation ........ Email: [email protected] Volume 2, Issue 3, March 2014 ISSN 2321-5992
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

IPASJ International Journal of Computer Science (IIJCS)

A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014

Web Site: [Link] Email: editoriijcs@[Link] ISSN 2321-5992

Fingerprint Authentication with Minutiae using Ridge Feature Extraction


1

Archana C. Lomte

1 Research Scholar, J.J.T. University, JSPMs Bhivarabai Sawant Institute of Tech & Research(W), Pune, India.

Abstract:
Fingerprint matching is done using many ways, for example considering ridge features. As an extension we propose to use bifurcations along with ridge patterns. The ridges along with bifurcations are considered as minutiae. These minutiae along with their position( i.e. x and y co-ordinates) and orientations are saved as features. we propose a novel matching scheme to detect the matched minutiae pairs incrementally. Following that, the maximum score is computed and used as the final matching score of two fingerprints.

Keywords: Breadth first search, minutia, ridge count, ridge features, ridge-based coordinate system.

1. INTRODUCTION
Introduced a novel fingerprint matching algorithm using both ridge features and the conventional minutiae features to increase the recognition performance against nonlinear deformation in fingerprints. The proposed ridge features are composed of four elements: ridge count, ridge length, ridge curvature direction, and ridge type. These ridge features have some advantages in that they can represent the topology information in entire ridge patterns that exist between two minutiae and are not changed by non-linear deformation of the finger. For extracting ridge features, they have also defined the ridge-based coordinate system in a skeletonized image. With the proposed ridge features and conventional minutiae features (minutiae type, orientation, and position), they have proposed a novel matching scheme using a breadth first search to detect the matched minutiae pairs incrementally. Recognition of fingerprint has been widely accepted for user identification due to its reliable performance, usability, and low cost compared with other biometrics such as signature, iris, face, and gait recognition. It is used in a wide range of forensic and commercial applications, e.g., criminal investigation, e-commerce, and electronic personal ID cards. Nonlinear distortions, presented in touchbased fingerprint sensing, make fingerprint matching more difficult. This is one of the biggest challenging tasks. As shown in Fig. 1, even though these two fingerprint images are from the same individual, the relative positions of the minutiae are very different due to skin distortions.

Fig.1 Example Of Skin Distortion

2. EXISTING SYSTEM
The existing approaches are modeling the distortion of fingerprints. Detecting the distortions using special hardware or video sequences. Some amount of distortion in the minutiae matching stages. Using local similarity measures. Cappelli et al. proposed a plastic distortion model of a fingerprint to calculate the nonlinear deformation of fingerprints [1]. Here, the maximum score is computed and used as the final matching score of two fingerprints. The proposed method achieved higher matching scores. Thus, we conclude that the proposed ridge feature gives additional information for fingerprint matching with little increment in template size and can be used in conjunction with existing minutiae features to increase the accuracy and robustness of fingerprint recognition systems. In existing system there are some disadvantages some are as follows. However, it is hard to estimate the parameters accurately due to insufficient [Link] thin plate spline (TPS) model to compensate for deformations, but this sort of alignment process typically requires too much computational power to be used in practical fingerprint recognition systems[2].Ratha et al. proposed a method to directly measure the

Volume 2 Issue 3 March 2014

Page 55

IPASJ International Journal of Computer Science (IIJCS)


A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014

Web Site: [Link] Email: editoriijcs@[Link] ISSN 2321-5992

forces and torques on the scanner using special hardware and Dorai et al. Estimated the distortions by observing fingerprint video sequences[3].These two methods prevent the capture of severely distorted images, but they cannot detect the distortion in data sets that were collected in the past and the need of additional hardware restricts their use in practical situations.

3. PROPOSED SYSTEM:
As in the proposed system to overcome all these disadvantages we propose to do fingerprint matching based on ridges (terminations), furrows (bifurcations) as minutiae extraction. Our proposal also finds either of these three points even in distorted and noisy fingerprints. We use crossing number algorithm to detect minutiae points. To reduce false minutiae we propose fuzzy as algorithm .This type of feature extraction allows a best fingerprint matching. Before extracting the proposed ridge features, we need to perform some preprocessing steps. These steps include typical feature extraction procedures as well as additional procedures for quality estimation and circular variance estimation. We first divide the image into 8x8 pixel blocks. Then, the mean and variance values of each block are calculated to segment the fingerprint regions in the image. We then apply the method to estimate the ridge orientation and the ridge frequency is calculated. The Gabor filter is applied to enhance the image and obtain a skeletonized ridge image. Then, the minutiae (end points and bifurcations) are detected in the skeletonized image. We then apply the method to estimate the ridge orientation and the ridge frequency is calculated. The Gabor filter is applied to enhance the image and obtain a skeletonized ridge image. Then, the minutiae (end points and bifurcations) are detected in the skeletonized image. The quality estimation procedure is performed in order to avoid extracting false minutiae from poor quality regions and to enhance the confidence level of the extracted minutiae set. Furthermore, in regions where ridge flows change rapidly, such as the area around a singular point, it is hard to estimate the ridge orientations accurately or to extract the thinned ridge patterns consistently. Therefore, to detect regions which have large curvature, we apply circular variance estimation. The circular variance of the ridge flows in a given block is calculated. Here, we use eight neighboring blocks. Quality estimation and circular variance values are used to avoid generating feature vectors in poor quality regions or in regions around singular points. Moreover, we adopt some post processing steps to remove falsely extracted ridges, such as sources.

4. RIDGE FEATURE EXTRACTION:


4.1 Ridge Coordinate System In this process we proposed one coordinate system which is a Ridge Based[11]. After all the preprocessed steps are performed we will get skeletonized ridges and minutiae information from the fingerprint input image. Defined ridge coordinate system extract ridge feature between two minutiae. Each ridge-based coordinate system is defined by a minutia (called origin) and vertical and horizontal axes starting from the origin minutia. First, the vertical axis is defined by drawing a line passing through the origin and orthogonal to the orientation of the origin. The axis also traverses the ridge flows orthogonally. In addition, to define the sign of the vertical axis according to the origin, the cross product between the orientation of the origin and the vector pointing from the origin to the side of the vertical axis is calculated. We determine the positive and the negative side of the vertical axis by checking the sign value. To represent the relative position of the minutiae according to the origin, horizontal axes should be defined. The horizontal axes are defined as ridges intersecting the vertical axis. To define the sign of each horizontal axis, the cross product between the vectors pointing from the intersection to the vertical and horizontal axes is calculated. The vector pointing from the intersection to the horizontal and the vertical axis, respectively. It includes four components such as the ridge count, ridge length, ridge curvature direction, and ridge type, respectively. These four components form a ridge-based feature vector between two minutiae and this feature vector is used in the matching process. In the following sections, we will explain in detail these ridge features were selected and the methods for extracting these features.

Fig. 2 Ridge Based Coordinate System

Volume 2 Issue 3 March 2014

Page 56

IPASJ International Journal of Computer Science (IIJCS)


A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014

Web Site: [Link] Email: editoriijcs@[Link] ISSN 2321-5992

4.2 Ridge Feature Extraction In the general ridge count methods, the number of ridges that intersect the straight line between two minutiae in the spatial domain is counted. However, when the ridge-counting line is parallel to the ridge structures, the line may meet the same ridge at one point, at more than two points, or at no point, due to skin deformation. Therefore, unlike existing ridge counting methods, here, the ridge count (rc) is calculated by counting the number of ridges along the vertical axis until the axis meets the ridge attached to the neighboring minutia. The vertical axis is perpendicular to the ridge structures. Thus, the counted numbers are less affected by skin deformation than in the results of the general ridge counting methods. In order to prove the effectiveness of the proposed ridge counting method, we used 50 fingers and manually paired the corresponding minutiae among the five images from each [Link] pairing two corresponding minutiae, we estimated the probability distributions of the absolute difference of the ridge counting numbers in each method. It shows that the absolute difference of the ridge counting numbers using our method is smaller than that using the conventional ridge count method. Therefore, we can conclude that our ridge count feature is more robust to skin deformation. Furthermore, to increase the discriminating power of the ridge count (rc) feature, we also consider the direction of the ridge count line. The ridge count (rc) is not always a positive number and the sign of the ridge count follows the sign of the vertical axis. If two minutiae are directly connected by the same ridge, the ridge count would be zero. The ridge length (rl) is the distance on the horizontal axis from the intersection of the vertical and horizontal axis to a minutia. To prove the usefulness of the ridge length feature, we conducted an experiment similar to the analysis of the ridge count feature. It shows the probability distribution of the absolute difference of the ridge length feature. The absolute differences of ridge length elements are mostly less than 16 pixels. Therefore, we can set the threshold of the ridge length feature to determine the same fingerprint as 16 pixels. The ridge length value also has a sign and follows the sign of the related horizontal axis to improve the discriminating power. To use more topology information in ridge patterns for matching, the ridge curvature direction is also considered. Even though the ridge count and ridge length values are very similar, the shapes of the ridge patterns may be different. The ridge curvature direction is defined and it represents the vector between the sampling points along the horizontal axis from the intersection of the vertical and horizontal axes to the minutia and represents the number of sampling points. In our experiment, we set the sampling point every 8 pixels on the ridges. Then, by checking the sign of this value, we can determine the ridge curvature direction. The ridge curvature direction feature is robust to skin deformation but some errors may still occur. First, ridges may have more than two inflection points, which makes it hard to define this feature. Second, some ridges are too straight to define a curved direction. and vice versa. Therefore, considering these facts and to further improve the discriminating power of ridge features, the ridge type (rt) is used as one of the ridge features instead of a minutia type. To determine the ridge type (rt), each minutia is first classified as an end point or a bifurcation. If a minutia is an end point, there is only one ridge belonging to the minutia. If a minutia is a bifurcation, there are three ridges connected to the minutiae. Next, the type of ridge associated with the minutia is determined as one of four types according to the type of the minutia and the relative position of the ridges. If a minutia is an end point, the ridge type is defined as In a bifurcation case, the three ridges are labeled by checking the angle between each ridge and the minutia orientation.A triangle is created by three points on the ridges (equidistant from the bifurcation). If the vertex of the triangle is not on the shortest side of the triangle, then the ridge belongs to the vertex and is defined as type. The other two ridges are classified as type and, moving in a clockwise direction from. Generally speaking, ridge type can change only into ridge type. However, type cannot be converted into type. Therefore, we use this information in the fingerprint matching. The overall procedure for extracting ridge features is as follows: 1) Perform preprocessing steps and extract a ridge image from a fingerprint. 2) Traverse the ridge-valley structures along the vertical axis from each minutia origin. a) If the vertical axis intersects with the ridges attached to a minutia, extract ridge features (ridge count, ridge length, ridge curvature direction, and ridge type) from the origin to the minutia and form a ridge feature vector between the origin and the minutiae. b) Keep traversing all the ridges until one of three terminating conditions is satisfied (see below). 3) If all minutiae are used as the origin minutiae, terminate the procedure. Otherwise, return to step 2). The termination conditions include the following three cases: 1) The vertical axis reaches a background region in the fingerprint image. 2) The vertical axis reaches a poor quality region in the fingerprint image. 3) The vertical axis reaches a high circular variance region in the fingerprint image.

Volume 2 Issue 3 March 2014

Page 57

IPASJ International Journal of Computer Science (IIJCS)


A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014

Web Site: [Link] Email: editoriijcs@[Link] ISSN 2321-5992

Fig.3 overall preprocessing Steps

5. FINGERPRINT MATCHING:
The ridge feature vectors between the minutiae in the ridge coordinate system can be expressed as a directional graph whose nodes are minutiae and whose edges are ridge feature vectors. Thus, we can adopt graph matching methods to utilize the ridge feature vectors in fingerprint matching. Chikkerur et al. proposed a graph-based fingerprint minutiae matching method in a Euclidean space. They first defined the local neighborhood of each minutia, called plet, which consists of the nearest minutiae from a center minutia. The comparison of two plets is performed by computing the distance between the two strings obtained by concatenating the neighboring minutiae, sorted by their radial distance with respect to the center minutia. Neighborhoods are matched by dynamic programming and a match of local neighborhoods is propagated with a breadth-first fashion. Thus, we apply this matching scheme to our ridge-based coordinate system, since the ridge-based coordinate system can be represented as a graph and each coordinate system makes a local neighborhood. Moreover, the data structure of the ridge-based coordinate system is very similar to the plet structure. The overall flow of the proposed fingerprint matching algorithm is as follows: 1) Initially match any pair of ridge based coordinate systems extracted from the enrolled fingerprint image and the input fingerprint image using dynamic programming. 2) Select the top degree of matched ridge-based coordinate pairs. 3) For every initially matched pair, a breadth-first search (BFS) is performed to detect the matched ridge-based coordinate pairs incrementally. 4) Check the validity of the matched coordinate pairs using the relative position and orientation of the minutiae and count the number of matched minutiae. 5) Iterate steps 3 and 4 N times and then return the maximum number of matched minutiae. 6) Compute the matching score. Dynamic programming is applied to find the optimal solution in matching two string sequences in the enrolled and input ridge-based coordinates. The ridge feature vectors in a ridge-based coordinate system are arranged in the order of their ridge count feature component (rc), then the order is invariant intrinsically. Therefore, the feature vectors in a ridge-based coordinate system can be stored as the elements of an ordered sequence. Thus, all the enrolled and input ridge based coordinates are compared one by one and a similarity score is computed for the dynamic programming. The similarity score is based on the Bayesian decision rule and is calculated: otherwise the absolute difference between two feature vectors, is the correctly matched class, and is the incorrectly matched class. In order to calculate the posterior probability, we assumed that the prior probabilities of and are equal.

Fig 4. Examples of corresponding ridge feature vectors according to the number of connection steps (upper and lower row images are from the same finger).

Volume 2 Issue 3 March 2014

Page 58

IPASJ International Journal of Computer Science (IIJCS)


A Publisher for Research Motivation ........

Volume 2, Issue 3, March 2014 6. CONCLUSION:

Web Site: [Link] Email: editoriijcs@[Link] ISSN 2321-5992

Here, we proposed a fingerprint matching algorithm using both ridge features and the minutiae. we proposed a new ngerprint matching algorithm using both ridge features and the minutiae feature. Based on these features we convert the original raw image named as fingerprint image as input and convert to the skeleton image. Dened ridge coordinates and extract ridge features between two minutiae. The ridge features consist of four elements ridge count, ridge length, ridge curvature direction, and ridge type that describe the relationship between the minutiae. A new matching scheme using a certain search algorithm to detect the matched of minutiae pairs.

References
[1] R. Cappelli, A. Erol, D. Maio, and D. Maltoni, Synthetic fingerprint image generation, in Proc. 15th Int. Conf. Pattern Recognition, [2] A. M. Bazen, G. T. B. Verwaaijen, S. H. Gerez, L. P. J. Veelenturf, and B. J. v. d. Zwaag, A correlation-based ngerprint verication system,in ProRISC Workshop on Circuits, Systems and Signal Processing,Veldhoven, the Netherlands, 2000, pp. 205213. [3] A. Ross, S. C. Dass, and A. K. Jain, Fingerprint warping using ridge curve correspondences, Pattern Analysis and Machine Intelligence,IEEE Transactions on, vol. 28, no. 1, pp. 1930, 2006, 0162-8828 [4] D. Maltoni, D. Maio, A. K. Jain, and S. Prabhakar , Handbook of Fingerprint Recognition. New York Springer Verlag, 2003. [5] X. Jiang and W. Y. Yau, Fingerprint minutiae matching based on the local and global structures, in Proc. 15th Int. Conf. Pattern Recognition, Barcelona, Spain, Sep. 2000, vol. 2, pp. 10381041. [6] Z. M. Kovacs-Vajna, A fingerprint verification system based on triangular matching and dynamic time warping, IEEE Trans. Pattern Anal . Intell. , vol. 22, no. pp. 12661276, Nov. 2000. . Mach [7] D. Maio and D. Maltoni, Ridge-line density estimation in digital images, in Proc. 14th ICPR, 1998, vol. 1, pp. 534538. [8] S. Chikkerur, A. N. Cartwright, and V. Govindaraju, K-plet and coupled BFS: A graph based fingerprint representation and matching algorithm, Lecture Notes Comput. Sci., Adv. Biometrics, vol. 3832, pp. 309315, 2005. [9] Biometric Systems Technology, Design and Performance Evaluation by James Wayman, Anil Jain, Davide Maltoni and Dario Maio (Eds) Fingerprint Identification Technology pp.21-61. [10] Maltoni, D. Maio, A. K. Jain, and S. Prabhakar , Handbook of Fingerprint Recognition. New York: SpringerVerlag, 2003. [11] Heeseung Choi, Kyoungtaek Choi, and Jaihie Kim Fingerprint Matching Incorporating Ridge Features with Minutiae IEEE Tranc. On Information Forensics And Security, Vol. 6, No. 2, June- 2011.

AUTHOR
Prof. [Link] , Research Scholar of JJT University , Rajasthan , India completed her M.E. from University of Pune and having 6 yrs of teaching experience and also she has published more 20 papers in national/international conferences and Journals

Volume 2 Issue 3 March 2014

Page 59

You might also like