Reach Us
+44-1522-440391

Department of Computer and Electrics Science, Faculty of Computer Engineering, TMU University, India

- *Corresponding Author:
- Hamza ali mahfoodh

Department of Computer andElectrics Science

Faculty of Computer Engineering

TMU University, India

**E-mail:**[email protected]

**Received date:** May 02, 2012; **Accepted date:** May 24, 2012; **Published date:** May 25, 2012

**Citation:**Moghadam N, Abadi M, Mahfoodh HA (2012) A Robust Method for Fingerprint Recognition Using Biometric Fusion. J Biom Biostat 3:143. doi:10.4172/2155-6180.1000143

**Copyright:** © 2012 Moghadam N, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

**Visit for more related articles at** Journal of Biometrics & Biostatistics

In this paper we will introduce a combined approach that uses the local and global features on the fingerprint. Minutiae features are extracted then a mesh of minutiae points relations will created. Then among the outputs of first stage two points used in the other stage as reference point and rotation handle. Matching process will take place after each stage then results made in both stages will be used to get the final answer. In this approach we used 10 fingerprints of persons to maximize the precision. Also we will use powerful pre-process tools to ensure that the input image is in the best condition for matching.

Biometric systems operate on behavioral and physiological biometric data to identify a person. The behavioral biometric parameters are signature, gait, speech and keystroke, these parameters change with age and environment. However physiological characteristics such as face, fingerprint, palm print and iris remains unchanged throughout the life time of a person. The biometric system operates based on one of the verification or identification modes. In the verification mode the point is to match captured features of a person with one template to give one answer, yes or no. The identification mode recognizes the person by matching his biometric against every template in the database.

Because the simplicity and cost effectiveness of physiological biometrics they are first choice of any developer. in the other hand fingerprint between the physiological biometrics is the popular and most used one due its feasibility, distinctiveness, permanence, accuracy, reliability, and acceptability. Fingerprint matching systems can be categorized within two categories, Correlation based approaches and minutiae based approaches. In correlation based approaches the similarity of pixels is estimated. First step in this type is finding a singular point or two; by singular point we mean fingerprint core and delta. They use singular points as images reference point and rotation handle. If the fingerprint image contains only one singular point, it must be rotated in several angles to determine the best matching degree. Sir Henry in 1900 classified the fingerprints into five classes, Arch, tented arch, Whorl, Right loop and Left loop. In arch types there is no core point, this will be a problem when using correlation based approaches. In the other side Minutiae based approaches are more popular. This approaches use some local features on fingerprint ridges called minutiae points. Based on ridges shapes and their collisions the minutiae points called ridge endings, bifurcations, cross points and spurs and etc. the most common features used are endings and bifurcations. These features can be extracted from the thinned ridge image (**Figure 1**). Deciding what type is the feature, is based on nine neighbors of a point, so if there is any remains of noise in the image there will be a wrong feature.

It is difficult to extract reliably minutia from poor quality fingerprint impressions arising from very dry fingers and fingers mutilated by scars, scratches due to accidents, injuries.

Biometrics alone cannot provide sufficient accuracy to prevent fraud. Behavioral biometrics can be imitated and physiological biometrics can be fabricated. For example fingerprints are subject to forging using latex moulds or exemplary methods. Here comes biometric fusion as a solution. The biometric fusion term refers to engage more than one biometric in the process to enhance the accuracy. Generally biometric fusion can be performed in one of these forms: multiple sensors, algorithms, instances, samples, biometrics and hybrid. Note that the fusion can take place prior to match or after match (**Figure 2**).

The motivation behind this work is to introduce an approach which uses both correlation and minutiae based concepts for enhance both approaches and minimize their weaknesses.

This paper contains the following sections. Section II is an overview of the related work, in section III introducing our proposed method in detail. Section IV performance analysis and results are discussed, in section V gave the conclusions.

The need of more accurate security systems derives developers to spend more time on accuracy enhancement researches. Human biometric are sometimes easy to fabricate, but when we combine multiple samples of a biometric or multiple biometrics, it will be very hard or impossible to forge them. Recently many researchers have looked at this issue [1].

Marcialis and Roli [2] used multi sensor fingerprint image and extracted each image features alone then fused the results to a single result. They used optical and capacitive image, because of their low price and easy to find properties. Again Marcialis and Roli [3] proposed the use of a perceptron with a class-separation loss function for combining multiple fingerprint matchers. Jain et al. [4] present a scheme to integrate the output scores of three different fingerprint matchers to improve the performance of a fingerprint verification system. Jain et al. [5] presented a fingerprint matching scheme that utilizes both the minutiae and texture information available in the fingerprint. A bank of Gabor filters is used to extract features from the tessellated cells of the template and input images. Although non-linear deformations present in the fingerprint images have not been accounted for by their method. Marcialis and Roli [6] fused two fingerprints in three modes using multiple algorithm fusion. Prabhakar and Jain [7] represented a decision level fingerprint fusion. Their design emphasis is on classifier selection before arriving at the final combination. It was shown that one of the fingerprint matchers in the given pool of matchers is redundant and no performance improvement is achieved by utilizing this matcher. Sha et al. [8] proposed a fingerprint matching technique that combines minutiae information with the ridge flow information. Ross et al. [9] propose a two-stage fusion scheme that takes advantage of the information among multiple fingerprint impressions. While comparing the query fingerprint with a template impression, the other impressions are also transformed using the 2D warping model to register with the query fingerprint so that the additive matched minutiae pairs can be detected. Then a matching score level fusion or decision level fusion is performed to integrate the matching results corresponding to different impressions (**Table 1**).

Accuracy | Proc. time | Storage | |
---|---|---|---|

DB#1 | 99.3 | 1.327 | ~25kb |

DB#2 | 97.1 | 1.412 | ~25kb |

DB#3 | 93.0 | 1.602 | ~24kb |

DB#4 | 82.4 | 1.698 | ~24kb |

DB#5 | 63.9 | 1.751 | ~23kb |

Average | 87.14 | 1.558 | ~23kb |

**Table 1:** Below you can see minutiae matching results in mentioned db’s.

In this section we’ll introduce our proposed algorithm in detail. **Figure 3** gives the block diagram of our proposed algorithm.

It is a critical step to prepare the fingerprint image before processing step. The image that scanned and stored, may suffer from several problems. Noise on the fingerprint image usually makes fake features. Cut lines are another example of fingerprints faults that may produce wrong features among feature extraction. In the other hand many fingerprint images suffer from low quality because the user doesn’t push his finger enough on the sensor, or pushing too much. So plus to a strong pre-processing module we need several rules to prevent wrong features show up in the feature vector.

After image acquisition, the grey-scale fingerprint converted to black white image. Generally this step is performed by thresholding methods. But we did this step a little different. By averaging the minimum and maximum colors on image with 9 points on the image, we made our threshold and then every pixel below threshold value converted to black and every pixel above the threshold converted to white.

Second, the resulting image has to be segmented therefore the image must get normalized in other words fingerprint ridges intensity standard deviation on the image must be equal to zero. Then by subdividing the image into 16 fixed size blocks, the standard deviation calculated for each block. If the resulting number is above the defined threshold (0.1-0.2) then the area considered a part of the fingerprint. **Figure 4 **shows areas that are suspect to be ridges on a given fingerprint. Note that the before fingerprint has passed the previous steps (**Table 2**).

Core Detection (s) | Accepted CP (%) | |
---|---|---|

Proposed approach | --- | 95.1 |

tomohiko's [10] | 0.365 | 96.0 |

navrit Kaur 's [11] | 0.68 | 85.6 |

ohtsuka's [12] | 0.44 | 90.8 |

kazuhiko's [13] | 0.641 | 93.0 |

Takeshi's [14] | 0.45 | 94.4 |

Atipat’s [15] | 0.548 | 77.0 |

**Table 2:** The correlation step results, you can see proposed algorithm does not take any time to align query and template images, while other algorithms spend a short time to calculate the core and delta points on the fingerprints.

Then the segmented ridges orientation must be estimated and a weight must be attached to every ridge parts. This step helps by looking at every local area. Ridges with a very different orientation got very low weights. Another advantage of this step is to connect ridges that got disconnected in acquisition step.

Local ridge orientation at p[x,y] is the angle θ_{xy}, that the ridges, crossing through an arbitrary small neighborhood centered at [x,y], form with the horizontal axis. Instead of computing local ridge orientation at each pixel, like most methods we estimate the local ridge orientation at discrete positions (see **Figure 5**).

For estimating the ridges local orientations, we used gradient based approach [1], enhanced by kas and witkin. By doubling the angle they fixed the discontinuity and non-linearity around 90 degrees. So each orientation estimate is encoded by the vector:

The theta doubled to reduce of the circularity of angles and r is proportional to the orientation estimate strength. Averaging the angles in a local n*n window (w) to obtain more robust estimate , can be performed by averaging x and y separately.

Next the local ridge frequency must be calculated. A frequency image is analogues to orientation image. The goal of this stage is to calculate the number of the ridges in a defined area. This frequency varies between different fingerprints and differs between different areas of the same fingerprint.

To perform this step, an oriented m*n window centered on [x,y] (from the ridge orientation image), aligned within ridges orientation. The x-signature of the grey-level is obtained by accumulating. Distances between ridges that fell into the oriented window are averaged to obtain the ridge frequency. **Figure 6** shows that how the x-signature and ridge distances produce ridge frequency. **Figure 7** shows the frequency image made of grey-scale image.

After calculating the local ridge frequency, a polarization operation must be performed on the image in order to enhancement. Polarization was introduced by Louis malls in 1800. Electromagnetic waves like light beam are constrained to vibrate in a certain plane or planes. Electromagnetic waves consist of vibrating electric and magnetic fields, with the direction of vibration perpendicular to the direction of motion of the wave. If the direction of vibration remains steady with time, the wave is said to be 100% linearly polarized in that direction. If the direction of vibration rotates at the same frequency as the wave, the wave is said to be 100% circularly polarized. Most naturally occurring electromagnetic waves have a direction of vibration that jiggles around at random: these are said to be un-polarized. Polarized imaged can be achieved by using two operators. First operator determines filtering bandwidth by controlling the image width sigma, second operator defines the filter orientation by controlling image length sigma. **Figure 7** shows an image before and after applying polarization.

After preparing the grey-scale image, it is time to take the resulting image to feature extraction process, but before that, the approximate fingerprint rotation must be calculated, hence a filled fingerprint mask is used to specify the finger angle. As you know generally fingerprints surrounding shape is elliptical. An ellipse contains two diameters, transverse diameter and conjugate diameter, which are orthogonal to each other. Hence a fingerprint image rotation angle can be estimated by its transverse diameter, since it is like an ellipse. Note that this rotation estimation is elementary operation to help fingerprints get a semi-normal form before feature extraction. **Figure 8** shows this mask on a given fingerprint.

After aligning the fingerprint in respect to the mask ellipse diameters, it remains in the memory, because this mask will be Participate in feature selection step. Next the image goes to feature extraction module.

In this step two common types of minutiae are considered as features, ridge endings and bifurcations. Therefore the image converted to thinned image, then after obtain cleaning process across the image, a 3 × 3 window surf the image and based on every non zero pixel and it’s eight neighbors, the minutiae points extracted based on this rules.

1. Any pixel with only one neighbor is ridge ending (RE).

2. Any pixel with 2 neighbors is a ridge passing point, so leave it.

3. Any pixel with 3 neighbors is bifurcation (BP) only if the neighbors are not side by side neighbors to each other.

Using these conditions the feature selection process doesn’t involve bifurcation validation measurement. One of the feature selection terms is, if a ending point located on a short line (for example shorter than 10 pixels), then avoid it. Another important feature selection term is that remove any ridge ending located on fingerprint surrounding. Here comes the fingerprint shape mask as a helpful tool. Any ridge ending correspond to the mask surrounding have to be removed. Bifurcations in those areas remain without change, because it is very odd to have fake bifurcation there. Resulting minutiae points are the features extracted from the fingerprint image. Then three meshes are created, one for RE-RE relations, one for BP-BP relations and another for RE-BP relations. By relations we mean connecting links. So for every minutiae all it’s relations represented by a connecting link (see **Figure 9**).

The produced meshes can be described as nodes and weighted edges. By weight we mean distances between any vertexes to another. The distance between point’s p and q can be calculated using this equation:

So if we want to calculate this distance in polar coordinates we have:

Which and in polar coordinates.

Both distances can be used, but the polar coordinates are used in a “good fingerprint rotation aligned”. This distance is one of the features, another feature can be derived from mesh edges, the angle between connecting links of one vertex. A Euclidean angle is completely determined by the corresponding right triangle. In particular, if * θ* is a Euclidean angle, then using trigonometric functions we find:

for two numbers x and y.

So an angle in the Euclidean plane can be legitimately given by two numbers x and y. To the ratio y/x there correspond two angles in the geometric range 0 < θ < 2π, since:

If infinities are permitted for the quotient y/x one can define the angle θ as a function of x and y using the inverse tangent function for all points except the origin, assuming the inverse tangent varies from -π/2 to π/2

Note that having the vertices all this relations can be retrieved, so there is no need to entering these relations within the feature vector. This will increase the processing time while matching two fingerprints, so if the storage capacity is enough, saving these features in the feature vector seems to be a better choice. So for any feature f, the feature vector is (type, relations to others, edges angle). But this process will take so long since any minutiae has n-1 connections to other minutiae points. Then we will have n×(n-1) weights and n×(n-1) angles. So we need a region of interest (ROI) to reduce these relations. The ROI area defined as a circular region around every minutiae point, with specific diameter, so that the minutiae is in relationship with another one if that point fell within the ROI, else the relation set to be infinity length. The diameter cannot be very short, because all the connections between one minutiae to other minutiae will be considered as infinity distances.

The matching process involves the features we discussed about. A threshold (t) is used to limit the fault tolerance. A distance measure (d) is used to determine the un-similarity between each pair fingerprints and pair of most similar minutiae points in corresponding fingerprints is selected for input image alignment purpose.

Next the query image is matched to the template image by correlation methods. This stage works as follows:

The query image placed on the template image using the most similar pair of minutiae points, resulted from minutiae matching stage. One of the minutiae points used to center both images on a single point. Second minutiae used to handle the query image rotation angle (**Figure 10**).

Having the connection between two most similar minutia points, we can calculate the final image rotation angle. The similarity then must be calculated by subtracting template image from query image. Remaining pixels considered as non-similarity ratio.

An iterative approach is used to minimize the 2D correlation coefficient by using nonlinear optimization techniques. The cross correlation coefficient defined as:

Here is the pixel intensity or the gray scale value at a point (xi, yj) in the undeformed image. is the gray scale value at a point in the deformed image. and Gare mean values of the intensity matrices F and G, respectively. The coordinates or grid points (xi, yj) and are related by the deformation that occurs between the two images. If the motion is perpendicular to the optical axis of the camera, then the relation between (xi, yj) and can be approximated by a 2D affine transformation such as:

Here u and v are translations of the center of the sub-image in the X and Y directions, respectively. The distances from the center of the sub-image to the point (x,y) are denoted by Δx and Δy. Thus, the correlation coefficient *r _{ij}* is a function of displacement components (u,v) and displacement gradients

Now the query image and the template image are placed on each other with minimum correlation coefficient (see **Figure 11**). Next the matching scores resulted from first stage and second stage must be combined to achieve final answer.

For query image *I _{q}* and template image

So for n fingerprints we have:

Sometimes scores outputs by different matchers are homogenous, for example if two fingers of a person are being combined, it’s very likely that the scores do not need to be normalized. In case different fingers of a person are not equally distinctive, it may be desirable to normalize the scores, but generally these scores do not need normalization. But when different matching algorithms are used, even on the same finger, the scores are not homogenous. So these scores need to be normalized. Given a set of scores {sk}, k=1,2,...,n the normalized scores are given by:

where the minimum and maximum values are estimated from training data.

Suppose that we normalized the scores such that they *S _{j}* ∈[0,100], the combined score can be calculated by several methods, sum, product, maximum are examples of a fusion rule. But according to Maltoni et al. [1] showed that all these rules are special cases of a unified framework based on Bayesian decision theory. So for example if the scores are normalized such that

We used the sum rule because product rule is very sensitive to errors. The sum rule can be used when the match scores tend to be noisy. We can assume that the posteriori probabilities are noisy. In such a case we can assume that the posteriori probabilities do not deviates significantly from the prior probabilities.

where , are small deviations (<<1), j=1,2,…,R. assuming equal priors, and non-zero loss function. The sum rule can be stated as:

where T is the threshold value.

The proposed algorithm performance was tested on 1.6 GHZ processor with 512kb cache, 1GB ram, Windows XP, using matlab7.0.

The data base used is made of 880 fingerprints, scanned from 44 persons, 10 fingers per person and twice a finger. According to quality of the images we divided the fingerprints to 5 classes. First two classes contain fine fingerprints, with good quality. Third class contains fingerprints that are noisy and not full-print images. Fourth and fifth classes contain fingerprints with much of noise and bad quality due fingers dirt, dryness and other issues (**Figure 12,13,14**).

**Figure 14:** query images from db#4 (a),(c), template images (b),(e). in first
two fingerprints the matcher didn’t recognize the finger, so by increasing
the threshold a false fingerprint showed up. In (c),(d) and (e), the matcher
didn’t recognize the right fingerprint (e), the query image (c) is a low quality
fingerprint, by increasing the threshold the matcher introduced (d) as the
result.

To demonstrate the multi-fingers fusion effect, we tested proposed algorithm once using two fingerprints, once with three fingerprints and so on. **Figure 15 and 16** shows that when we use more fingerprints for identification, this will increase the space between imposter and genuine classes.

In this paper we have proposed a hybrid algorithm that was base on both minutiae and correlation concepts, and by fusing the results we increased the precision. We are working on approaches that use ridge shapes and paths as features not the minutiae points. This can reduce the error sensitivity since ridges are more resistance against noise and deformations comparing to minutiae. Also we are working on correlation subject, having a number of reference points for example nine; we can warp the query image on the template image, so the correlation may be reduced to minimum.

- Maltoni D, Maio D, Jain AK, Prabhakar S (2009) Handbook ofFingerprint Recognition. Second edition, Springer Verlag.
- Marcialis GL, RoliF (2004) Fingerprint verification by decision-levelfusion of optical and capacitive sensors. BiometricAuthentication 3087: 307-317.
- MarcialisGL, Roli F (2005)Fusion of multiple fingerprint matchers by single-layer perceptron withclass-separation loss function. Pattern Recognition Letters - Special issue:Artificial neural networks in pattern recognition 26: 1830-1839.
- JainAK, Prabhakar S, Chen S (1999) Combining multiple matchers for a high securityfingerprint verification system. PatternRecognition Letters 20: 1371-1379.
- JainA, Ross A, Prabhakar S (2001) Fingerprint matching using minutiae and texturefeatures. Int'l Conference on Image Processing (ICIP) 3: 282-285.
- Marcialis GL, RoliF (2003) Experimental results on Fusion of Multiple Fingerprint Matchers. Audio-and Video-Based Biometric Person Authentication 2688: 814-820.
- PrabhakarS, Jain AK (2002) Decision-level fusion in fingerprint verification. PatternRecognition 35: 861-874.
- ShaL, Zhao F, Tang X (2007) A two-stagefusion scheme using multiple fingerprint impressions. IEEE International Conference onImage Processing ICIP II - 385 -II - 388.
- RossA, Jain A, Reisman J (2002) A HybridFingerprint Matcher. 16th InternationalConference onPattern Recognition795-798.
- OhtsukaT, Watanabe D, Aoki H (2007) Fingerprint Core and Delta Detection by CandidateAnalysis. MVA2007 IAPR Conference on Machine Vision Applications 130-133.
- JohalNK, Kamra A (2011) A Novel Method for Fingerprint Core Point Detection,International Journal of Scientific & Engineering Research 2: 1-6.
- Tomohiko (2005)A New Core and Delta Detection for Fingerprints Using the Extended RelationGraph. IEICE Trans. Fundamentals E88–A: 2587-2595.
- Yoshida K, HonmaS, Ohtsuka T, Hiroyuki A (2009) New Fingerprint Minutiae Extraction Using RidgeFlux Analysis 266-269.
- TakeshiO (2005) A New Detection Approach for the Fingerprint Core Location UsingExtended Relation Graph. IEICE - Transactions on Information and Systems E88-D:2308-2312.
- JulasayvakeA (2007) An algorithm for fingerprintcore point detection. 9th International Symposium on Signal Processing and Its Applications 1-4.

Select your language of interest to view the total content in your interested language

- Adomian Decomposition Method
- Algebra
- Algebraic Geometry
- Algorithm
- Analytical Geometry
- Applied Mathematics
- Artificial Intelligence Studies
- Axioms
- Balance Law
- Behaviometrics
- Big Data Analytics
- Big data
- Binary and Non-normal Continuous Data
- Binomial Regression
- Bioinformatics Modeling
- Biometrics
- Biostatistics methods
- Biostatistics: Current Trends
- Clinical Trail
- Cloud Computation
- Combinatorics
- Complex Analysis
- Computational Model
- Computational Sciences
- Computer Science
- Computer-aided design (CAD)
- Convection Diffusion Equations
- Cross-Covariance and Cross-Correlation
- Data Mining Current Research
- Deformations Theory
- Differential Equations
- Differential Transform Method
- Findings on Machine Learning
- Fourier Analysis
- Fuzzy Boundary Value
- Fuzzy Environments
- Fuzzy Quasi-Metric Space
- Genetic Linkage
- Geometry
- Hamilton Mechanics
- Harmonic Analysis
- Homological Algebra
- Homotopical Algebra
- Hypothesis Testing
- Integrated Analysis
- Integration
- Large-scale Survey Data
- Latin Squares
- Lie Algebra
- Lie Superalgebra
- Lie Theory
- Lie Triple Systems
- Loop Algebra
- Mathematical Modeling
- Matrix
- Microarray Studies
- Mixed Initial-boundary Value
- Molecular Modelling
- Multivariate-Normal Model
- Neural Network
- Noether's theorem
- Non rigid Image Registration
- Nonlinear Differential Equations
- Number Theory
- Numerical Solutions
- Operad Theory
- Physical Mathematics
- Quantum Group
- Quantum Mechanics
- Quantum electrodynamics
- Quasi-Group
- Quasilinear Hyperbolic Systems
- Regressions
- Relativity
- Representation theory
- Riemannian Geometry
- Robotics Research
- Robust Method
- Semi Analytical-Solution
- Sensitivity Analysis
- Smooth Complexities
- Soft Computing
- Soft biometrics
- Spatial Gaussian Markov Random Fields
- Statistical Methods
- Studies on Computational Biology
- Super Algebras
- Symmetric Spaces
- Systems Biology
- Theoretical Physics
- Theory of Mathematical Modeling
- Three Dimensional Steady State
- Topologies
- Topology
- mirror symmetry
- vector bundle

- Total views:
**13157** - [From(publication date):

June-2012 - Sep 23, 2019] - Breakdown by view type
- HTML page views :
**9284** - PDF downloads :
**3873**

**Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals**

International Conferences 2019-20