Palm Print Recognition Using Local Binary Pattern and Support Vector Machine

1.INTRODUCTION
The Key reasons for a Biometric Personal Identification Traditional Methods may allow unauthorized access. A password assigned to each user may be guessed by an unauthorized user or forgotten by the authentic user.

1/13/2011

INTRODUCTION

Fig. 1 System Block diagram

1/13/2011

INTRODUCTION

Image from PolyU database(2nd version)

1/13/2011

INPUT IMAGE

1.IMAGE SEGMENTATION
1.Algorithm to find points between the fingers 2.Obtaining the Region of Interest 3.Image Pre-processing

1/13/2011

IMAGE SEGMENTATION

II. A.

Using a low pass Gaussian filter with a particular threshold (say T), the palm print image is converted from gray scale image to a binary image.
1/13/2011 IMAGE SEGMANTATION

Fig. 2 Key Point Detection between 2 fingers.

The set of 3 horizontal pixels just above the point of interest should be at the binary value one. The set of three horizontal pixels just below the point of interest should be at the binary value of zero. The pixels on the left and right of the points should have zero level. The pixels on the left and right of the points of interest at a particular distance should have zero level.

1/13/2011

IMAGE SEGMENTATION

II. B.

Fig. 3 (a) Palm Image before rotation (b) Palm Image just before cropping the ROI

1/13/2011

IMAGE SEGMENTATION

 Using the point-finding algorithm we find the key points between the index fingers and the middle finger as in Fig. 3(a), a line segment (L1) is drawn between K1 and K3. The key points will always remain the same and hence by calculating the slope of this line, the image is rotated to make it rotational invariant. After obtaining the rotationally corrected binary image, the key points between the fingers are found again by applying the point-finding algorithm on this image. Next, a line (L2) is drawn perpendicular to the above line through the mid-point of K1 and K3 (as these points will also be invariant for any image of the same hand). Then using L2 as shown in Fig. 3(b) a square region is obtained as shown in Fig. 4(b).

1/13/2011

IMAGE SEGMENTATION

Fig. 4 (a) Original Image (b) Square segmented ROI

Using L2 as shown in Fig. 3(b) a square region is obtained as shown in Fig. 4(b).
1/13/2011 IMAGE SEGMENTATION

II. C.

Image Pre-Processing

In order to increase the computational efficiency, the ROI is compressed using the wavelet decomposition. Furthermore, in order to enhance the main features in the palm such as the principle lines, ridges and wrinkles, a Laplacian filter is applied to the ROI to sharpen the features of the palm, followed by histogram equalization to increase its contrast and finally a Gaussian filter is applied to the ROI to smoothen out the edges.

1/13/2011

IMAGE SEGMENTATION

1.FEATURE EXTRACTION
1.Sobel Operator 2.Local Binary Pattern 3.Feature Representation

1/13/2011

FEATURE EXTRACTION

III. A.

Sobel Operator is used to find the edges of an image in a specified direction. The ROI is operated on in eight directions by the Sobel operator

Fig. 5 Examples of directional responses derived using Sobel operator. (a) Original palm print images, (b) to (e) components of the images in the horizontal, vertical, positive 45, and negative 45 directions.

1/13/2011

FEATURE EXTRACTION

The Sobel masks used are given in Fig. 6.

1 0 1 2 0 2 1 0 1 0 -1 -2 1 0 -1 2 1 0 -1 -2 -1 0 0 0 1 2 1 -2 -1 0 -1 0 1 0 1 2

-1 0 1

-2 0 2

-1 0 1

0 1 2

-1 0 1

-2 -1 0

1 2 1

0 0 0

-1 -2 -1

2 1 0

1 0 -1

0 -1 -2

Fig. 6 3x3 Sobel Operators in different directions

FEATURE EXTRACTION 1/13/2011

III. B.

Local Binary Pattern

The operator assigns a label to every pixel in an image by thresholding the eight neighborhood pixels by the gray value of its centre. The feature vector is formed by concatenating the thresholded binary bits in the anti-clockwise direction, which is shown in Fig. 7. An LBP string is called uniform if it consists of at most 2 bit-wise transitions from 0 to 1 or viceversa. This way the operation results in a set of 59 LBP patterns denoted by {1, 2 59}.
1/13/2011

FEATURE EXTRACTION

Fig. 7 Obtaining a Binary label for a pixel

1/13/2011

FEATURE EXTRACTION

III. C.

Feature Representation

A histogram of labels can be constructed as: The palm print images are divided into 9 equal local regions and the texture descriptor is extracted from each region independently. Application of the Sobel operator in four directions yields four Sobel images which are divided into 9 sub-windows each being a 40x40-pixel image. Thus, the texture descriptor for a given palm print will have a size of {59 (no. of labels) x 9 (no. of sub-windows) x 8 (direction components)} as shown in fig. 8.
1/13/2011

FEATURE EXTRACTION

Fig. 8. Feature representation

1/13/2011 FEATURE EXTRACTION

MATCHING
Chi-Square Method Support vector Machine

1/13/2011

MATCHING

Chi-Square Matching
The Chi-Square distance between the two histograms S and M can be defined as

Where Sb and Mb are normalized enhanced histograms to be compared; indices b refers to the bth bin of the histogram, which in this case varies from 1 to 59.

1/13/2011

MATCHING

<-Same User->

<-Same User->

1/13/2011

Support Vector Machine

SVM looks for Hyper Plane Maximizes Margins Minimizes quantity proportional to number of misclassification errors Creates decision boundary defined by:

1/13/2011

MATCHING

A few kernel function that have been used in this study are
Radial basis function : Sigmoid kernel : Polynomial kernel function: Linear kernel:

1/13/2011

MATCHING

IMPLEMENTATION
The experiments were performed on 2 different sets of Database
PolyU_Palmprint_Database (2nd Version): It contains 40 palm images of , 193 different users o IIT Delhi Database : This database was built at Biometrics laboratory, IIT Delhi and contains a minimum of 7 palm-images of 109 users
o

1/13/2011

IMPLEMENTATION &RESULTS

RESULTS

Table 1: Error Rate plot using SVM as matching technique and different kernel functions. Kernel Function used with PolyU Database IIT-D Database SVM

Linear Polynomial
Chi-Square Matching (EER %) 2.11 3.51

0.50 1.00

1.00 1.60

Table 2: Results using Chi-square matching technique

Database PolyU IIT-D

1/13/2011

GAR when FAR=1%

95.72 92.23

GAR when FAR=2%

97.72 94.45

IMPLEMENTATION &RESULTS

Thank You

Suggestion Please.

1/13/2011