Fingerprint Verification using Gabor Co-occurrence Features 1.

Introduction
Fingerprint is an impression of the friction ridges of all or any part of the finger and has been used extensively for personal identification. Among all the biometric techniques, fingerprint-based authentication systems have received more attention because of the long history of fingerprints and their extensive use in forensics. Another advantage in using fingerprint technology is the fairly small storage space required for the biometric template, thus reduce the size of the database memory required. Many approaches were developed for the fingerprint verification algorithm. They are,

1.1. Model based:

The model-based fingerprint classification technique uses the locations of singular points (core and delta) to classify a fingerprint into the five classes.

1.2. Structure based:

In the structure-based approach, the estimated orientation field in a fingerprint image is used to classify the fingerprint into one of the five classes.

1.3. Syntactic based:

A syntactic approach uses the formal grammar to represent and classify fingerprints. The variable sized minutiae based mechanism does not lend itself to indexing mechanisms. Typical graph based and point pattern based approaches to match the minutiae from two fingerprints need to align the unregistered minutiae patterns of different sizes which makes them computationally expensive. Correlation based techniques match the global patterns of the ridges and valleys to determine if the ridges align. The global approach to fingerprint is typically used for indexing and does not offer a very good individual discrimination. Further the indexing efficiency of the existing global representation is poor due to small number of categories that can be effectively identified and a highly skewed distribution of the population, in each category. The local texture analysis technique, is used where the finger print area of interest is tessellated with respect to the core point.

Dept. of ECE, SREC

Page 1

Fingerprint Verification using Gabor Co-occurrence Features 2. Gabor Filter

In image processing, a Gabor filter, named after Dennis Gabor, is a linear filter used for edge detection. Frequency and orientation representations of Gabor filters are similar to those of the human visual system, and they have been found to be particularly appropriate for texture representation and discrimination. In the spatial domain, a 2D Gabor filter is a Gaussian kernel function modulated by a sinusoidal plane wave. The Gabor filters are self-similar: all filters can be generated from one mother wavelet by dilation and rotation. J. G. Daugman discovered that simple cells in the visual cortex of mammalian brains can be modelled by Gabor functions.[1] Thus, image analysis by the Gabor functions is similar to perception in the human visual system.

2.1. Definition:
Its impulse response is defined by a harmonic function multiplied by a Gaussian function. Because of the multiplication-convolution property (Convolution theorem), the Fourier transform of a Gabor filter's impulse response is the convolution of the Fourier transform of the harmonic function and the Fourier transform of the Gaussian function. The filter has a real and an imaginary component representing orthogonal directions. The two components may be formed into a complex number or used individually.

Dept. of ECE, SREC

Page 2

Fingerprint Verification using Gabor Co-occurrence Features

Complex

Real

Imaginary

Where,

In this equation, represents the wavelength of the sinusoidal factor, represents the orientation of the normal to the parallel stripes of a Gabor function, is the phase offset, is the sigma of the Gaussian envelope and is the spatial aspect ratio, and specifies the ellipticity of the support of the Gabor function.

2.2. Gabor Transform:

The Gabor transform, named after Dennis Gabor, is a special case of the short-time Fourier transform. It is used to determine the sinusoidal frequency and phase content of local sections of a signal as it changes over time. The function to be transformed is first multiplied by a Gaussian function, which can be regarded as a window, and the resulting function is then transformed with a Fourier transform to derive the time-frequency analysis. The window function means that the signal near the time being analyzed will have higher weight.

Dept. of ECE, SREC

Page 3

Fingerprint Verification using Gabor Co-occurrence Features

The Gabor transform of a signal x(t) is defined by this formula:

The Gaussian function has infinite range and it is impractical for implementation. But take a look at the distribution of Gaussian function.

Gaussian function with |a|>1.9143 can be regarded as 0 and also can be ignored. Thus the Gabor transform can be simplified as

This simplification makes the Gabor transform practical and realizable.

2.3. Inverse Gabor Transform:

The Gabor transform is invertible. The original signal can be recovered by the following equation

Dept. of ECE, SREC

Page 4

Fingerprint Verification using Gabor Co-occurrence Features

3. Proposed Algorithm
The flow diagram of the proposed algorithm is as shown in figure below. The sequence to be followed in the algorithm is as follows. (1) Enhance the input image by using short time Fourier transform method. (2) Rotate the input image by an angle -15and use core detection algorithm to get the registration point. (3) Define the Tessellation of image space around the registration point and normalize it. (4) Apply Gabor Wavelet decomposition to the pre-processed Fingerprint image to get the filtered image for extraction of feature image. (5) Find the finger code using Statistical features from the local structures defined in Gabor decomposed image. (6) Obtain the Co-occurrence features to further improve the correct recognition. (7) Store the features in Feature library for use in classification.

Flow diagram for the proposed method

Dept. of ECE, SREC

Page 5

Fingerprint Verification using Gabor Co-occurrence Features

3.1. Enhancement of the Image:

This is the first step in finger print verification algorithm. The performance of a finger print feature extraction and matching algorithm depend heavily upon the quality of the input fingerprint image. While the quality of a finger print image cannot be objectively measured, it roughly corresponds to the clarity of the ridge structure in the fingerprint image. A good quality finger print image has high contrast and well-defined ridges and valleys. The fingerprint enhancement is done by using a technique based on Short time Fourier transform analysis.

3.2. Registration Point:

Any point that can be consistently detected in a fingerprint image can be used as a registration point. Registration point is found out by rotating the input image by an angle -15, dividing the input image into blocks, calculating gradients and local orientation, smoothing the orientation image and finding the Poincare index. The angle of rotation, i.e., -15 is found experimentally in order to find the registration point correctly. The least mean square orientation estimation algorithm is used to find the registration point.

3.3. Tessellation of Image Space:

The tessellation of the image space consists of the region of interest and is defined by a collection of sectors. This contains six concentric circles around the centre point and each circle is divided into 8 sectors. Totally the region of interest contains 48 sectors. The number of concentric bands or circles considered around the reference point for feature extraction depends on the area of the finger imaged. The width of the concentric bands depends on the dpi resolution of the sensor. The width of the bands should capture one ridge and valley pair ones average. Here, a band with a width of 20 pixels is necessary to capture a single minutia in a sector, allowing the low-level features to capture this local information.

Dept. of ECE, SREC

Page 6

Fingerprint Verification using Gabor Co-occurrence Features

3.4. Normalization of the Image:

Normalization is done to remove the effects of sensor noise and finger pressure differences. Normalization is done on each sector separately by considering its mean and variance.

Where, Mi and Vi are the estimated mean and variance of sector Si respectively; Mo and Vo are the desired mean and variance respectively; I(x, y) is the input gray value at pixel (x, y); N(x, y) is the normalized gray - level value at pixel (x, y).

3.5. Decomposition of the Image:

Decomposition is done by means of Gabor Wavelet Transform of scale=1 and orientation=4. Gabor filters are band-pass filters which have both orientation-selective and frequency-selective properties. Gabor filters can be designed by the formula as in Equation (3).

Where, x'= x sin + y cos and y'= x cos + y sin

Dept. of ECE, SREC

Page 7

Fingerprint Verification using Gabor Co-occurrence Features

3.6. Feature Vector Extraction:

The Mean, Standard deviation, and Co-occurrence parameters, i.e., contrast in each sector will represent the feature vector. Let Ri (x, y) be the component image corresponding to or sector Si. For i = 0, 1, 2 47 and [0, 45, 90, 135]. The features Mean (Mi) and Standard deviation (Fi), can be defined using Equations (4) and (5).

Where k is the number of pixels in Si. Ri is the sector of the filtered image. Mi is the mean of that sector. The grey level value in each sector of the filtered image will give the finger code. Also the Co-occurrence matrix (C) with distance (1, 1), i.e., one pixel below and one pixel right for each sector is found out and a feature, contrast is calculated from the Co-occurrence matrix using Equation (6) to improve the recognition rate.

Where C (i, j) is the Co-occurrence matrix elements.

Dept. of ECE, SREC

Page 8

Fingerprint Verification using Gabor Co-occurrence Features

3.7. Finger Code Generation:

The averaged statistical and Co-occurrence parameters in each sector will represent the Finger code.

3.8. Fingerprint Classification:

Finger print Classification is done by finding the Euclidean distance between the two corresponding Finger codes. The test Finger code is compared with the entire Finger codes in the database. The Finger code in the data base that gives the minimum distance for the given test finger code will be recognized as one corresponding to the test Fingerprint.

Dept. of ECE, SREC

Page 9

Fingerprint Verification using Gabor Co-occurrence Features

4. Experimental Results and Discussion

Experiments were conducted using three sets of Fingerprint Verification Competition databases, such as FVC2000, FVC20002 and FVC20004 using averaged features of Mean, Standard deviation and Co-occurrence feature-Contrast as Finger code. Also the experiments were carried out for different combination of Training and Recognition sets. In the first set 50% of the images in each Database are used for training and remaining 50%of images in the Database is used for recognition and the results are tabulated in Table. Here the maximum recognition rate obtained is 80%. In the second set all the images in the Database are used for both training and recognition and the maximum recognition rate of 97.5% is obtained as shown in Table.

Finger print verification results for FVC database

Dept. of ECE, SREC

Page 10

Fingerprint Verification using Gabor Co-occurrence Features

5. Conclusion
The proposed algorithm is implemented and tested for all the three FVC databases (FVC2000, FVC2002, and FVC2004) without rejecting any images using Gabor Wavelet transform. The test is done using both overlapping and non-overlapping training and recognition image sets. From the table, it is observed that the maximum recognition rate achieved for over lapping image sets is 97.5% while for non-overlapping image sets, it is 80%. The future work includes improvement of the performance of the proposed method. Further implementing the proposed algorithm with more transforms and finding the transform, which will give maximum recognition rate. In addition if we combine both the minutiae based and filter bank based technique, the recognition rate may improve further.

Dept. of ECE, SREC

Page 11

Fingerprint Verification using Gabor Co-occurrence Features 6. References

[1]. J.Zhou and Jinwei Gu A Model-Based Method for the Computation of Fingerprints Orientation Field, IEEE Transactions on Image Processing, Vol. 13, No. 6, 2004, pp. 885-888. [2]. J. G. Daugman High Confidence Visual Recognition of Persons by a Test of Statistical IndependenceIEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 15, No. 11, 1993, pp. 1148-1161. [3]. A.K. Jain., L. Hong, S. Pankanti, and R. Bolle An Identity Authentication System using Fingerprints,Proceedings of IEEE, Vol. 85, 1997, pp. 13651388. [4]. L. Hong, Y. Wang and A. K. Jain, Fingerprint Image Enhancement Algorithm and Performance Evaluation,IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 21, No. 4, 1998, pp. 777789. [5]. A.K. Jain, S. Prabhakar, L. Hong, and S.Pankanti Filter bank-based Fingerprint Matching IEEETransactions on Image Processing, Vol. 9, No. 5, 2000, pp. 846-859. [6]. A.K. Jain, L. Hong and Prabhakar S, A Multi-channel Approach to Fingerprint Classification IEEETransactions on Pattern Analysis and Machine Intelligence, Vol. 21, No. 4, 1999, pp. 348-359. [7]. A.K. Jain, L. Hong and R. Bolle, On-Line Fingerprint Verification, IEEE Transactions on PatternAnalysis and Machine Intelligence, Vol. 19, No. 4, 1997, pp. 302-314.

Dept. of ECE, SREC

Page 12