# Uniform Local Binary Pattern for Fingerprint Liveness Detection in the Gaussian Pyramid

Authors: Yujia Jiang; Xin Liu
Journal: Journal of Electrical and Computer Engineering
 (2018)

---

## Abstract

Fingerprint recognition schemas are widely used in our daily life, such as Door Security, Identification, and Phone Verification. However, the existing problem is that fingerprint recognition systems are easily tricked by fake fingerprints for collaboration. Therefore, designing a fingerprint liveness detection module in fingerprint recognition systems is necessary. To solve the above problem and discriminate true fingerprint from fake ones, a novel software-based liveness detection approach using uniform local binary pattern (ULBP) in spatial pyramid is applied to recognize fingerprint liveness in this paper. Firstly, preprocessing operation for each fingerprint is necessary. Then, to solve image rotation and scale invariance, three-layer spatial pyramids of fingerprints are introduced in this paper. Next, texture information for three layers spatial pyramids is described by using uniform local binary pattern to extract features of given fingerprints. The accuracy of our proposed method has been compared with several state-of-the-art methods in fingerprint liveness detection. Experiments based on standard databases, taken from Liveness Detection Competition 2013 composed of four different fingerprint sensors, have been carried out. Finally, classifier model based on extracted features is trained using SVM classifier. Experimental results present that our proposed method can achieve high recognition accuracy compared with other methods.


---

## Body

## 1. Introduction

With the widespread use of smart applications and phones, it brings convenience to our life. However, the security of identity authentication is an issue that needs to be addressed urgently. Traditional identity authentication method can deal with the security issue, but current problem is that tokens or passwords are easy to be forgotten for a long time and bank cards or identity cards, and so on, are easily stolen or lost. Therefore, recognition systems based on biometric traits gradually replace traditional authentication methods nowadays. For example, smart phone fingerprint recognition device: the personal fingerprint information is stored on the phone, so only the user can access and turn on the smart phone. Biometrics system refers to the identification of human beings based on their physiological and behavioral characteristics. The ease of use and low error rates which promote their widespread use are superior to others methods. Of course, biometric systems have their own weakness. For example, biometric systems contain vulnerabilities and are also susceptible to various kinds of sophisticated forms of spoofing. Among these, the fingerprint recognition, the ease of use, and high recognition rate are the main factors that contribute to their widespread use, accounting for the vast majority part [1]. Indeed, early identification systems can be easily spoofed by fake fingerprints, which can be reproduced from common materials. Popular fake fingertip materials such as silicon, wood glue and latex [2, 3] consist of large organic molecules which tend to agglomerate during processing. For example, threats to fingerprint systems are spoof finger attack at the sensor, attack on software modules, and so on [4].Fingerprint liveness detection refers to whether the fingerprints presented are really from a live fingertip or spoofed ones. In order to solve the spoofing, various methods are proposed [5–8] in recent years. The goal of current fingerprint liveness detection research is concerned about how to design a method to discriminate real and fake fingerprints. Because the features of image can be described using textures information, many features based on texture extraction methods spring out according to human vision. In this paper, a novel fingerprint liveness detection method based on uniform local binary pattern in Gaussian pyramid has been proposed. Multiscale analysis using two layers Gaussian pyramid filter has been proved to be more efficient for solving image scale invariance. On the whole, fingerprint liveness detection is regarded as a binary classification problem, in which the given fingerprint image is either a real fingerprint or a spoof one. Feature extraction is a key step for solving the above problem. In our method, Gaussian pyramid filter is introduced to deal with the problem of scale invariance, and feature vectors are constructed using uniform local binary pattern to reduce the number of dimensionality of features. After these, feature vectors of each layer of spatial pyramid image are extracted through using uniform local binary pattern (ULBP). Once the feature vector is generated, the samples classifier model is learnt by using support vector machine. Experimental results based on the LivDet 2013 show that our method exhibits a strong edge.The paper is organized as follows. In Section2, a summary of the related work to the present research is given. Our proposed method about the feature vector extraction is introduced in Section 3. The result and comparison are given in Section 4. Conclusions are drawn in Section 5.


## 2. Related Work

Fingerprint authentication systems are easily cheated by these fake fingerprints, which fake fingerprints that mimic real users’ fingerprints. Therefore, fingerprint liveness detection methods are proposed to prevent fingerprint authentication systems from being fake fingerprints. Because of the alternation of the ridges and valleys on them, fingertips surfaces are intrinsically coarse at certain scale. Furthermore, considering the advantage of software-based detection compared with the hardware-based method, software-based fingerprint liveness detection method is proposed in this paper. Because of moisture of sweat glands, the real fingerprint taken using fingerprint sensor devices will change slightly in a short time span. However, it will not happen in spoof ones. Therefore, researchers detect the fingerprint vitality through the analysis perspiration of fingerprint in different time, and the perspiration pattern changes at different time interval were observed (2 seconds in [6] and 5 seconds in [7]). In [7], they can find that the intervals are longer and the wavy nature is more complex based on the spreading of moisture for the real fingerprint. In order to improve the accuracy of Derakhshani’s proposed method, Schuckers et al. [8, 9] proposed a novel liveness detection method by using wavelet analysis. In their method, multiresolution analyses are used to extract the low frequency content and wavelet packet analyses are used to extract the high frequency content. Other features related to spectral energy distribution have been used by using different transformation. Thin-plate model has been used by analysing fingertip distortion in [10]. In their method, the tester press his fingertip on the surface of fingerprint sensor and rotate their fingers in four directions (0 degree, 90 degree, 180 degree and 270 degree) to capture a sequence of frames. Then, relevant features based on the skin deformation based on capturing finger distortion images are constructed. In [11], a liveness detection method using one-way analysis of variance ANOVA and Multiple-Comparison Method to do the statistical tests on the dataset of real fingers and spoof ones was proposed. Because fake fingerprint image quality is not as good as the real fingerprint image, it is difficult to forge a real fingerprint image with the same or better quality fingerprint images. Based on this consideration, [12] uses the coarseness of the fingerprint to discriminate features. Nikam and Agarwal detected the fingerprint liveness based on ridgelet transform to extract texture features using only single fingerprint image [13]. The same method is researched in [14], where 25 quality parameters are used as the measure of performance detection. These methods are such as in [15, 16], in which the features used in the classifier are based on the specific fingerprint measurements, such as ridge strength, continuity, and clarity. Ghiani et al. [16] proposed a fingerprint liveness detection method based on wavelet analysis. In 2013, Ghiani et al. [17] detected the vitality of fingerprint images based on residual Gaussian and the noise of the fingerprint images to estimate the coarseness of fingerprint image. There are many small pores of circular structures in real fingertips, and the attackers observed that we cannot accurately imitate sweat pores in spoofed ones. Reference [18] proposed a new detection method by comparing pore quantity between recorded fingerprints and the query ones. After that, Gragnaniello et al. [19] proposed a novel detection method based on the optimum threshold from correlations peaks to detect which peaks are active pores. Many methods based on texture features have been proposed for liveness detection, such as statistical, signal processing approaches and model based and structural ones [20]. Rao and Jain [21] proposed a fingerprint liveness detection method based on minimizing the energy associated with phase and orientation maps. Multiresolution texture feature analysis in their method and cross ridge frequency analysis techniques are used. Ratha et al. [22] texture features based on the spatial gray level dependence method are extracted by using spatial gray level dependence method (SGLDM) for personal verification and discrimination. In latest literatures, much attention has been also focused on the wavelet transform domain. Jain et al. proposed many fingerprint liveness detection methods, such as the curvelet transform [23, 24], the Gabor filters [12], and the gray level cooccurrence matrices which are combined with the wavelet transform [7, 14, 25].


## 3. Feature Extraction

The problem of fingerprint liveness detection is seen as two-class classification problem where a given fingerprint image is either real or fake, so the feature extraction is the key step. A general diagram showing different phases of our method is shown in Figure1, which mainly includes two phases: image training process and image testing process. Next we will give a detailed description on feature extraction of a given image.Figure 1
The flowchart of the proposed method [9].


### 3.1. Gaussian Pyramid Filter (GPF)

Image pyramid is the major description of image multiscale, and it is an effective but simple structure that interprets image in multiple resolutions. An image pyramid is image set, which comes from the same original image and the resolutions of the image gradually decreases in the form of pyramid. It is sampled by a cascade downsampling until a certain termination condition is researched. We compare a layer of images to a pyramid; the higher the hierarchy, the smaller the image and the lower the resolution. An image pyramid is a series of images sets that are progressively reduced in the shape of a pyramid. At the bottom of the pyramid is the high-resolution, and the top pyramid is low resolution approximation. When moving to the top of the pyramid, the resolutions of images decrease gradually. Because of the size of the baseJ is 2J×2J or N×N, where J=log⁡2N; Thus, the size of intermediatej is 2j×2j, and the range ofj is 0≤j≤J. The complete pyramid is composed of J+1 resolutions, so the range of size of different resolutions is 2J×2J to 20×20. However, most pyramids only have P+1 layers, where 1≤P≤J. In this paper, Gaussian pyramid is introduced to deal with scale invariance. Two steps are included: (a) the convolution of original Image Gi and Gaussian kernelK are conducted; (b) removing the even rows and columns using downsampling operation. Then the images shrunk to a quarter of the original image. Finally, We can obtain the entire pyramid by iterating over the steps above. The Gaussian kernelK is as follows:(1)K=116∗1464141624164624362464162416414641.After downsampling operation, the image is scaled to half of the original image. Figure2(a) shows the original fingerprint image, and Figure 2(b) is an image after one-layer Gaussian kernel operation, and Figure 2(c) is an image after two-layer Gaussian kernel operation.Figure 2
The different scale image based downsampling operation.
(a)
(b)
(c)


### 3.2. Uniform Local Binary Pattern

Local Binary Pattern (LBP), which has scale invariance and gray invariance, is used to describe the image local texture information, and the process of texture features extraction of given image is as follows. Firstly, the pixel values of eight neighbors in3×3 window are compared with the center pixel of the 3×3 window, respectively, and binary relations are computed by using (2). In (2), z denotes the comparative results between the center pixel and eight adjacent pixels, respectively. Then, the LBP code is weighted by using binary relationship of power of two and summed to obtain the LBP code of the current selected center pixel. Eq. (3) can calculate the LBP code. In (3),I(xc,yc) represents the center pixel values of the 3×3 window, and the eight adjacent pixels are g0,…,g7:(2)sz=1,z≥00,z<0,(3)LBP⁡xc,yc=∑i=07sgi,gc2i.An example of LBP operation is shown in Figure3. Firstly, Figure 3(a) is the part of image, whose size is 3×3. In the 3×3 window, the pixel value of center pixel is 45. Then, binary relationships are constructed using (2), in which eight adjacent pixel values are compared with the center pixel, respectively. The so-threshold binary values in Figure 3(b) responding to Figure 3(a) using (2) are obtained. Figure 3(c) is a binary relationship of power of two. Next we can calculate, converting the binary number into a decimal number in a clockwise direction by (3), the pixel value of center pixel using LBP. Finally, the local texture feature of image can be shown by counting the histogram of pixel value after LBP operation. Figure 3(c), LBP code of the center pixel: 1×20+0×21+0×22+1×23+0×24+1×25+1×26+0×27=1+8+32+64=105.Figure 3
An example of the LBP operation.Therefore, features of image can be described by counting histogram which is formed by 256 LBP codes. However, the current problem is that the binary models after LBP operation are too many. Thus, to solve the problem and improve statistics, uniform local binary pattern is proposed. It finds that the majority transformation of LBP modes only contains two jumps from one to zero or from zero to one, for example, 00000000 (zero jump), 00000111 (only one jump from zero to one), and 10001111 (two jumps are included, one is from one to zero, and another is from zero to one). The above three examples are all uniform local binary pattern. Besides these, others are called mixed model. Based on this finding, uniform local binary pattern is proposed. And for eight adjacent pixel sampling point in the3×3 window, the number of original binary model is reduced from 28=256 to 8×(8-1)+2=58 after introducing uniform local binary pattern operation. On one hand, uniform local binary pattern can reduce the dimensionality of feature vectors, on the other hand, it can solve the effects of high frequency noise.


### 3.3. Support Vector Machine (SVM)

Support Vector Machines (SVM) is a general two-class classifier, which is widely used in the research field of computer vision, pattern recognition, and deep learning. The goal of SVM is to find the hyperplane of the classification requirement, which can divide two classification samples correctly; at the same time, the classification interval is the largest. Figure4 shows the optimal line of classification in linear separable cases.H denotes the optimal line, which can be achieved by maximizing the distance maxmargin=w/2 betweenH1 andH2. LIBSVM software package [7, 25, 26] is a most commonly used classification tool. Two key issues need to be considered when using SVM.Figure 4
The optimal line of classification in linear separable cases.One problem is how to select an appropriate kernel function of SVM. The goal of kernel function is that the two classification samples are linearly separable by an appropriate transformation in high-dimensional space; however, the two classification samples are linearly nonseparable in low dimensional space. According to the problem of linear separable and linear inseparable, different kernel functions are chosen. It is noted that the classification labels and features are all nonlinear. In our method, RBF kernel function is selected, which can make nonlinearly mapping to a high-dimensional space.Another problem is how to select parameters. Two parameters are included in the RBF kernel function:C and Υ. To train a better classifier, parameter optimization operation is used. In LIBSVM, gnuplot.exe is an executable tool, which is used to find the optimal parameters pairs C and Υ, while the goal of the parameter optimization operation is to classify the unknown data. Finally, we can search the results of the optimal parameters by using the “Grid-search and Cross-validation”.


## 3.1. Gaussian Pyramid Filter (GPF)

Image pyramid is the major description of image multiscale, and it is an effective but simple structure that interprets image in multiple resolutions. An image pyramid is image set, which comes from the same original image and the resolutions of the image gradually decreases in the form of pyramid. It is sampled by a cascade downsampling until a certain termination condition is researched. We compare a layer of images to a pyramid; the higher the hierarchy, the smaller the image and the lower the resolution. An image pyramid is a series of images sets that are progressively reduced in the shape of a pyramid. At the bottom of the pyramid is the high-resolution, and the top pyramid is low resolution approximation. When moving to the top of the pyramid, the resolutions of images decrease gradually. Because of the size of the baseJ is 2J×2J or N×N, where J=log⁡2N; Thus, the size of intermediatej is 2j×2j, and the range ofj is 0≤j≤J. The complete pyramid is composed of J+1 resolutions, so the range of size of different resolutions is 2J×2J to 20×20. However, most pyramids only have P+1 layers, where 1≤P≤J. In this paper, Gaussian pyramid is introduced to deal with scale invariance. Two steps are included: (a) the convolution of original Image Gi and Gaussian kernelK are conducted; (b) removing the even rows and columns using downsampling operation. Then the images shrunk to a quarter of the original image. Finally, We can obtain the entire pyramid by iterating over the steps above. The Gaussian kernelK is as follows:(1)K=116∗1464141624164624362464162416414641.After downsampling operation, the image is scaled to half of the original image. Figure2(a) shows the original fingerprint image, and Figure 2(b) is an image after one-layer Gaussian kernel operation, and Figure 2(c) is an image after two-layer Gaussian kernel operation.Figure 2
The different scale image based downsampling operation.
(a)
(b)
(c)


## 3.2. Uniform Local Binary Pattern

Local Binary Pattern (LBP), which has scale invariance and gray invariance, is used to describe the image local texture information, and the process of texture features extraction of given image is as follows. Firstly, the pixel values of eight neighbors in3×3 window are compared with the center pixel of the 3×3 window, respectively, and binary relations are computed by using (2). In (2), z denotes the comparative results between the center pixel and eight adjacent pixels, respectively. Then, the LBP code is weighted by using binary relationship of power of two and summed to obtain the LBP code of the current selected center pixel. Eq. (3) can calculate the LBP code. In (3),I(xc,yc) represents the center pixel values of the 3×3 window, and the eight adjacent pixels are g0,…,g7:(2)sz=1,z≥00,z<0,(3)LBP⁡xc,yc=∑i=07sgi,gc2i.An example of LBP operation is shown in Figure3. Firstly, Figure 3(a) is the part of image, whose size is 3×3. In the 3×3 window, the pixel value of center pixel is 45. Then, binary relationships are constructed using (2), in which eight adjacent pixel values are compared with the center pixel, respectively. The so-threshold binary values in Figure 3(b) responding to Figure 3(a) using (2) are obtained. Figure 3(c) is a binary relationship of power of two. Next we can calculate, converting the binary number into a decimal number in a clockwise direction by (3), the pixel value of center pixel using LBP. Finally, the local texture feature of image can be shown by counting the histogram of pixel value after LBP operation. Figure 3(c), LBP code of the center pixel: 1×20+0×21+0×22+1×23+0×24+1×25+1×26+0×27=1+8+32+64=105.Figure 3
An example of the LBP operation.Therefore, features of image can be described by counting histogram which is formed by 256 LBP codes. However, the current problem is that the binary models after LBP operation are too many. Thus, to solve the problem and improve statistics, uniform local binary pattern is proposed. It finds that the majority transformation of LBP modes only contains two jumps from one to zero or from zero to one, for example, 00000000 (zero jump), 00000111 (only one jump from zero to one), and 10001111 (two jumps are included, one is from one to zero, and another is from zero to one). The above three examples are all uniform local binary pattern. Besides these, others are called mixed model. Based on this finding, uniform local binary pattern is proposed. And for eight adjacent pixel sampling point in the3×3 window, the number of original binary model is reduced from 28=256 to 8×(8-1)+2=58 after introducing uniform local binary pattern operation. On one hand, uniform local binary pattern can reduce the dimensionality of feature vectors, on the other hand, it can solve the effects of high frequency noise.


## 3.3. Support Vector Machine (SVM)

Support Vector Machines (SVM) is a general two-class classifier, which is widely used in the research field of computer vision, pattern recognition, and deep learning. The goal of SVM is to find the hyperplane of the classification requirement, which can divide two classification samples correctly; at the same time, the classification interval is the largest. Figure4 shows the optimal line of classification in linear separable cases.H denotes the optimal line, which can be achieved by maximizing the distance maxmargin=w/2 betweenH1 andH2. LIBSVM software package [7, 25, 26] is a most commonly used classification tool. Two key issues need to be considered when using SVM.Figure 4
The optimal line of classification in linear separable cases.One problem is how to select an appropriate kernel function of SVM. The goal of kernel function is that the two classification samples are linearly separable by an appropriate transformation in high-dimensional space; however, the two classification samples are linearly nonseparable in low dimensional space. According to the problem of linear separable and linear inseparable, different kernel functions are chosen. It is noted that the classification labels and features are all nonlinear. In our method, RBF kernel function is selected, which can make nonlinearly mapping to a high-dimensional space.Another problem is how to select parameters. Two parameters are included in the RBF kernel function:C and Υ. To train a better classifier, parameter optimization operation is used. In LIBSVM, gnuplot.exe is an executable tool, which is used to find the optimal parameters pairs C and Υ, while the goal of the parameter optimization operation is to classify the unknown data. Finally, we can search the results of the optimal parameters by using the “Grid-search and Cross-validation”.


## 4. Experiment

The performance of our method is evaluated by using one official dataset: LivDet 2013 [27], which are the publicly available datasets provided in the 2013 Fingerprint Liveness Detection Competition. Firstly, a brief introduction about the official databases is given in this section. Secondly, feature vectors are constructed by using our method. Then, the validation criterion is defined which is used to evaluate the performance of our method. Finally, experiments results based on the official dataset LivDet 2013 are obtained, which shows that our proposed method is superior to others’ methods.


### 4.1. Databases Introduction

The Department of Electrical and Computer Engineering of Clarkson University (USA) and the Department of Electronic Engineering of the University of Cagliari (Italy) held the first LivDet competition [5, 27] to help researchers study fingerprints liveness and compare the performance of the proposed state-of-the-art detection methods in 2009. Currently, four publicly official fingerprints datasets are published. And the LivDet 2013 Fingerprint dataset was divided into two parts: one is training part, which is used to learn a trained model classifier, and another set is testing samples, which are used to estimate the performance of the proposed method.LivDet 2013 fingerprints are obtained through using four different optical fingerprint sensors (such as (a) Italdata ET10 (500 dpi), (b) CrossMatch Verifier 300LC (500 dpi), (c) Biometrika FX2000 (569 dpi), and (d) Swipe (96 dpi)). In this fingerprint set, 8874 real fingerprints and 7979 spoof fingerprints are included, and five different materials, such as Gelatin, Ecoflex, Latex, Modasil, and wood glue, are made fake fingerprints. A part of the fingerprints is used to train the SVM classifiers with the RBF kernel and the rest are used to evaluate the performance of classifier.The dataset of each fingerprint sensor is divided into two parts: (1) a testing set and (2) a training set. As shown in Table1, the fingerprint testing set is used to assess the performance of proposed method and the latter is used to learn a classifier model. More detailed parameters about LivDet 2013 are listed in Table 1. In Addition, some fingerprint images of real and spoof are presented in Figure 5. The material used is specified for the generation of the fake fingers, such as Playdoh, Latex, BodyDouble, and Ecoflex. It is hard for our eyes to distinguish the real fingerprints from the spoof ones. Therefore, our task is designing a method to distinguish the fingerprint liveness.Table 1
Table of the detailed information of LivDet 2013.
Database ID
Sensor
Model number
Res. (dpi)
Image size
Number of image in training set
Number of images in testing set
Real
Fake
Real
Fake
Liv2013-1
Biometrika
FX200
569
352 × 384
1000
1000
1000
1000
Liv2013-2
CrossMatch
V300LC
500
800 × 750
1250
1000
1250
1000
Liv2013-3
Italdata
ET10
500
480 × 640
1000
1000
1000
1000
Liv2013-4
Swipe
---
96
1500 × 208
1221
979
1153
1000Figure 5
Typical sample images of real and spoof fingerprints those can be found in the LivDet 2013.


### 4.2. Gaussian Multiscale Transformation and Feature Extraction

In this experiment, to solve scale invariance of fingerprint image, Gaussian pyramid structure is used in the fingerprint liveness detection. After Gaussian pyramid operation, features based on uniform local binary pattern are extracted. For example, in Figure2, the size of the original image Figure 2(a) is 256×256. First of all, preprocessing operation is necessary for the given fingerprint images, such as image gray processing. Then, two-layer Gaussian pyramid transformation has been done to solve the image scale invariance by calculating the convolution operation of original fingerprint image and Gaussian filter. After every one-layer Gaussian pyramid transformation, the size of the current image is a quarter of the previous level. Figure 2(b) and Figure 2(c) show the images after Gaussian filter operation. The two images are represented by the symbolGP1 andGP2, respectively, whose sizes are 128×128 and 64×64. To make scale invariance of the extracted texture feature, characteristics of rotation invariance are used based on uniform local binary pattern. Next, features are constructed in original fingerprint image and two-layer pyramids. Since the LBP code can describe local micromode information of the original image, the local features of the fingerprint image can be represented by counting the histogram of pixel values after LBP operation. However, uniform local binary pattern only considers the eight-bit binary of pixel values, which contain two jumps from one to zero or from zero to one in the eight-bit binary. Due to fingerprint images being transformed to two-layer pyramid, feature vectors are extracted based on ULBP in original fingerprint image and two-pyramid image. After constructing the feature vector with uniform local binary pattern, normalization is necessary to unify the data scales. Finally, features are extracted. These features of training sets are trained a classifier model by using SVM, and features of testing sets evaluated the performance of classifier.


### 4.3. Performance Metrics and Classification Results

The LivDet 2013 Datasets derive from 2013 Fingerprint Liveness Detection Competition, and these fingerprints are downloaded from the website. The performance of method is validated by using the Average Classification Error (ACE), which is considered as standard metric for evaluation of the fingerprint liveness. It is defined as(4)ACE=FAR+FRR2,where, in (4),(5)FAR=Total Number Imposter Fingerprints Accepted as GenuineTotal Number of Forgery Tests Performed,FRR=Total Number Genuine Fingerprints Accepted as ImposterTotal Number of Genuine Matching Tests Performed.In (4), FAR (False Accept Rate) accounts for the percentage of fake fingerprints being misclassified as real one, and FRR (False Reject Rate) shows the percentage of real fingerprints being assigned to the spoofed ones. As shown in Figure 1, two successive processes are included: training process and testing processes.Process 1(training process). In this process, feature extraction is the key step to achieve fingerprint liveness detection. To solve the scale invariance and reduce the dimensionality of features, Gaussian pyramid in introduced to solve the problem of scale invariance and the uniform local binary pattern is used to reduce the dimensionality of feature. About the construction of feature vectors under different scale image having been talked in Section 4.2. Next, feature vector of original image and each pyramid image is extracted by using our proposed method. Finally, classifier is built by using executable file svm-train.exe to train the obtained feature vectors in SVM. In order to obtain optimal classifier, parameters optimization operation is necessary in this process. During the process, parameter pair C,Υ is learnt. Figure 6 shows optimal parameters pair values C,Υ for the four different fingerprint sensors. For example, the same color denotes the same value at the same C,Υ. In Figure 6(a), the green line denotes the optimal parameters pairs when the value of parameter pair C,Υ is (32768,8). And the classification accuracy is 95.5% in the current parameter pair C,Υ. That is to say, we can obtain the best classifier model when parameter pair value is set as (32768, 8) in testing process. Similarly, the optimal parameter pairs corresponding Figures 5(b), 5(c), and 5(d) can be found. If not operation, various of different parameter pairs C,Υ are needed to try to gain a better classifier model. Finally, the classifier has been trained.Figure 6
Results of the Parameter optimization based on different sensors in LivDet 2013.
(a)
Results of the Biometrika sensor
(b)
Results of the CrossMatch sensor
(c)
Results of the Italdata sensor
(d)
Results of the Swipe sensorProcess 2(testing process). To distinguish real fingerprint from the spoof ones, fingerprint liveness detection based on uniform local binary pattern in Gaussian pyramid is proposed in this paper. Before constructing feature vectors, image preprocessing operation is necessary. To address the scale invariance of images and reduce the dimensionality of features vectors, Gaussian pyramid filter operation is introduced. Both the Testing process and training processes are conducted based on MATLAB R2014a platform. As mentioned before, the executable file svm-train.exe tool are used to obtain the optimal parameter pair C,Υ in this paper. In our experiment, the ACE detection accuracy and its comparison with the current methods for detecting fingerprint vitality are listed in Table 2. The accuracy of best designed methods from LivDet 2013 and the others’ results are shown in Table 2. It shows that our method achieves detection accuracy superior to other methods proposed in the LivDet 2013. In order to facilitate the comparison of the results, the best obtained results in Table 2 are highlighted in bold. We can clearly notice that the ACE (Average Classification Rate) of our method achieved is obviously superior to other ones in LivDet 2013.Table 2
The results of the best different algorithms of LivDet 2013 in terms of average accuracy are cited from [27].
Methods
The average classification error ACE in (%)
Bimometrika
Cmatch
Italata
Swipe
Average
Our method
10.68
46.09
13.7
14.35
21.205
Frassetto2 [28]
25.65
49.87
55.45
4.02
33.75
ATVS [27]
5.05
54.8
50
46.45
39.08
UniNap2 [27]
6.55
52.13
9.45
26.85
23.75
HZ-JLW [27]
32.95
55.56
13.15
15.19
29.21


## 4.1. Databases Introduction

The Department of Electrical and Computer Engineering of Clarkson University (USA) and the Department of Electronic Engineering of the University of Cagliari (Italy) held the first LivDet competition [5, 27] to help researchers study fingerprints liveness and compare the performance of the proposed state-of-the-art detection methods in 2009. Currently, four publicly official fingerprints datasets are published. And the LivDet 2013 Fingerprint dataset was divided into two parts: one is training part, which is used to learn a trained model classifier, and another set is testing samples, which are used to estimate the performance of the proposed method.LivDet 2013 fingerprints are obtained through using four different optical fingerprint sensors (such as (a) Italdata ET10 (500 dpi), (b) CrossMatch Verifier 300LC (500 dpi), (c) Biometrika FX2000 (569 dpi), and (d) Swipe (96 dpi)). In this fingerprint set, 8874 real fingerprints and 7979 spoof fingerprints are included, and five different materials, such as Gelatin, Ecoflex, Latex, Modasil, and wood glue, are made fake fingerprints. A part of the fingerprints is used to train the SVM classifiers with the RBF kernel and the rest are used to evaluate the performance of classifier.The dataset of each fingerprint sensor is divided into two parts: (1) a testing set and (2) a training set. As shown in Table1, the fingerprint testing set is used to assess the performance of proposed method and the latter is used to learn a classifier model. More detailed parameters about LivDet 2013 are listed in Table 1. In Addition, some fingerprint images of real and spoof are presented in Figure 5. The material used is specified for the generation of the fake fingers, such as Playdoh, Latex, BodyDouble, and Ecoflex. It is hard for our eyes to distinguish the real fingerprints from the spoof ones. Therefore, our task is designing a method to distinguish the fingerprint liveness.Table 1
Table of the detailed information of LivDet 2013.
Database ID
Sensor
Model number
Res. (dpi)
Image size
Number of image in training set
Number of images in testing set
Real
Fake
Real
Fake
Liv2013-1
Biometrika
FX200
569
352 × 384
1000
1000
1000
1000
Liv2013-2
CrossMatch
V300LC
500
800 × 750
1250
1000
1250
1000
Liv2013-3
Italdata
ET10
500
480 × 640
1000
1000
1000
1000
Liv2013-4
Swipe
---
96
1500 × 208
1221
979
1153
1000Figure 5
Typical sample images of real and spoof fingerprints those can be found in the LivDet 2013.


## 4.2. Gaussian Multiscale Transformation and Feature Extraction

In this experiment, to solve scale invariance of fingerprint image, Gaussian pyramid structure is used in the fingerprint liveness detection. After Gaussian pyramid operation, features based on uniform local binary pattern are extracted. For example, in Figure2, the size of the original image Figure 2(a) is 256×256. First of all, preprocessing operation is necessary for the given fingerprint images, such as image gray processing. Then, two-layer Gaussian pyramid transformation has been done to solve the image scale invariance by calculating the convolution operation of original fingerprint image and Gaussian filter. After every one-layer Gaussian pyramid transformation, the size of the current image is a quarter of the previous level. Figure 2(b) and Figure 2(c) show the images after Gaussian filter operation. The two images are represented by the symbolGP1 andGP2, respectively, whose sizes are 128×128 and 64×64. To make scale invariance of the extracted texture feature, characteristics of rotation invariance are used based on uniform local binary pattern. Next, features are constructed in original fingerprint image and two-layer pyramids. Since the LBP code can describe local micromode information of the original image, the local features of the fingerprint image can be represented by counting the histogram of pixel values after LBP operation. However, uniform local binary pattern only considers the eight-bit binary of pixel values, which contain two jumps from one to zero or from zero to one in the eight-bit binary. Due to fingerprint images being transformed to two-layer pyramid, feature vectors are extracted based on ULBP in original fingerprint image and two-pyramid image. After constructing the feature vector with uniform local binary pattern, normalization is necessary to unify the data scales. Finally, features are extracted. These features of training sets are trained a classifier model by using SVM, and features of testing sets evaluated the performance of classifier.


## 4.3. Performance Metrics and Classification Results

The LivDet 2013 Datasets derive from 2013 Fingerprint Liveness Detection Competition, and these fingerprints are downloaded from the website. The performance of method is validated by using the Average Classification Error (ACE), which is considered as standard metric for evaluation of the fingerprint liveness. It is defined as(4)ACE=FAR+FRR2,where, in (4),(5)FAR=Total Number Imposter Fingerprints Accepted as GenuineTotal Number of Forgery Tests Performed,FRR=Total Number Genuine Fingerprints Accepted as ImposterTotal Number of Genuine Matching Tests Performed.In (4), FAR (False Accept Rate) accounts for the percentage of fake fingerprints being misclassified as real one, and FRR (False Reject Rate) shows the percentage of real fingerprints being assigned to the spoofed ones. As shown in Figure 1, two successive processes are included: training process and testing processes.Process 1(training process). In this process, feature extraction is the key step to achieve fingerprint liveness detection. To solve the scale invariance and reduce the dimensionality of features, Gaussian pyramid in introduced to solve the problem of scale invariance and the uniform local binary pattern is used to reduce the dimensionality of feature. About the construction of feature vectors under different scale image having been talked in Section 4.2. Next, feature vector of original image and each pyramid image is extracted by using our proposed method. Finally, classifier is built by using executable file svm-train.exe to train the obtained feature vectors in SVM. In order to obtain optimal classifier, parameters optimization operation is necessary in this process. During the process, parameter pair C,Υ is learnt. Figure 6 shows optimal parameters pair values C,Υ for the four different fingerprint sensors. For example, the same color denotes the same value at the same C,Υ. In Figure 6(a), the green line denotes the optimal parameters pairs when the value of parameter pair C,Υ is (32768,8). And the classification accuracy is 95.5% in the current parameter pair C,Υ. That is to say, we can obtain the best classifier model when parameter pair value is set as (32768, 8) in testing process. Similarly, the optimal parameter pairs corresponding Figures 5(b), 5(c), and 5(d) can be found. If not operation, various of different parameter pairs C,Υ are needed to try to gain a better classifier model. Finally, the classifier has been trained.Figure 6
Results of the Parameter optimization based on different sensors in LivDet 2013.
(a)
Results of the Biometrika sensor
(b)
Results of the CrossMatch sensor
(c)
Results of the Italdata sensor
(d)
Results of the Swipe sensorProcess 2(testing process). To distinguish real fingerprint from the spoof ones, fingerprint liveness detection based on uniform local binary pattern in Gaussian pyramid is proposed in this paper. Before constructing feature vectors, image preprocessing operation is necessary. To address the scale invariance of images and reduce the dimensionality of features vectors, Gaussian pyramid filter operation is introduced. Both the Testing process and training processes are conducted based on MATLAB R2014a platform. As mentioned before, the executable file svm-train.exe tool are used to obtain the optimal parameter pair C,Υ in this paper. In our experiment, the ACE detection accuracy and its comparison with the current methods for detecting fingerprint vitality are listed in Table 2. The accuracy of best designed methods from LivDet 2013 and the others’ results are shown in Table 2. It shows that our method achieves detection accuracy superior to other methods proposed in the LivDet 2013. In order to facilitate the comparison of the results, the best obtained results in Table 2 are highlighted in bold. We can clearly notice that the ACE (Average Classification Rate) of our method achieved is obviously superior to other ones in LivDet 2013.Table 2
The results of the best different algorithms of LivDet 2013 in terms of average accuracy are cited from [27].
Methods
The average classification error ACE in (%)
Bimometrika
Cmatch
Italata
Swipe
Average
Our method
10.68
46.09
13.7
14.35
21.205
Frassetto2 [28]
25.65
49.87
55.45
4.02
33.75
ATVS [27]
5.05
54.8
50
46.45
39.08
UniNap2 [27]
6.55
52.13
9.45
26.85
23.75
HZ-JLW [27]
32.95
55.56
13.15
15.19
29.21


## 5. Conclusions and Future Work

To solve fingerprint liveness and improve the security of authentication systems, a novel fingerprint liveness detection method based on uniform local binary pattern is proposed in this paper. The advantages of ULBP are that the dimensionality of feature vectors reduced compared with LBP. For the model of3×3 window, the models of original eight bits binary reduce from 256 to 58. The constructed feature vectors have been evaluated on publicly available databases LivDet 2013, which is a database released in the 2013 LivDet competition [27]. After the obtained features are trained by the SVM classifier, we can get a classifier model. With the help of the trained model, we can predict the classifier accuracy of testing dataset. Furthermore, the our method is part of the software-based solutions and it distinguishes real fingerprint images from the spoof ones; only one fingerprint without extra special hardware devices is added to the sensor. Liveness detection methods such as the one presented in this paper are of great importance in the biometric recognition field as they help to prevent direct attacks from the fake fingerprints (those carried out with synthetic traits and very difficult to detect).The classifier performance of fingerprints datasets is extremely affected by the noise during the training process and testing process. When noise of fingerprint image is considered, the predicting results are unsatisfactory. Yet, we can get rid of the influence of noise by introducing noise filters with idea from Jin et al. [29]. Besides, more layers Gaussian pyramids are generated to further solve the scale invariance. These will be done in our future works.



---

*Source: 1539298-2018-01-09.xml*