International Conference on Communication and Signal Processing, April 3-5, 2018, India
Face Recognition using DRLBP and SIFT
Feature Extraction
M.Sushama and E.Rajinikanth

Abstract—The detection of human face from images plays a
vital role in Computer vision, cognitive science and Forensic
Science. The various computational and mathematical models, for
classifying face including Scale Invariant Feature Transform
(SIFT) and Dominant Rotated Local Binary Pattern (DRLBP)
have been proposed to yield better performance. This paper
proposes a novel method of classifying the human face using
Artificial Neural Network. This is done by pre-processing the face
image at first and then extracting the face features using SIFT.
Then the detection of human faces is done using Back
Propagation Network (BPN). The process of combining SIFT and
DRLBP perform better accuracy rather using separately.
Index Terms—Face Recognition, Dominant local binary
pattern, Histogram and Feature Extraction, SIFT.
I. INTRODUCTION
A. HUMAN FACE RECOGNITION
Nowadays we’seen and come to know that aadhaar
identification problems for many people in government ,
public distribution systems and many other aspects. Got up
with an inspiration to find out a solution with Face
Recognition using DRLBP &SIFT Feature Extraction.
DRLBP &SIFT Feature Extraction procedure is an accurate
and perfect solution for all identification problems. So, it
would be very useful in Banking Services, ATM Services,
Aadhaar linked programs, Police investigations and many
more service sectors.
Scale Invariant Feature Transform (SIFT) are features
extracted from images to help in reliable matching
between different views of the same object. The extracted
features are invariant to scale and orientation, and are
highly distinctive of the image. [a] This computes the
locations of potential interest points in the image by
detecting the maxima and minima for a function of
Gaussian filters which is applied different scales all over
the images and resampling those images. [b] These images
are discarded due to low contrast and an edge response
points , then it is assigned to the dominant orientation.[c]
M.Sushama and E.Rajinikanth are with the Sathyabama Institute of Science
and Technology, Chennai
978-1-5386-3521-6/18/$31.00 ©2018 IEEE
0994
Finally, a local feature descriptor is computed at each key
point. This descriptor is based on the local image gradient,
transformed according to the orientation of the key point
to provide rotation and scale invariance. [d] Every feature is
a vector of dimension 128 distinctively identifying the
neighborhood around the key point.
This paper proposes a user’s identity verification using
Dominant Rotate Local Binary Pattern and Scale Invariant
feature transformation. The software which is required for this
paper is MATLAB 7.0 FRAMEWORKS and PYTHON.
There are several ways which is mentioned by section wise.
Section I describes an Introduction of human face recognition.
Section II describes about many related works. Section III says
about the methodologies of preprocessing an image, DRLBP,
Histogram and GLCM Properties, Feature Extraction and
Back Propagation Network (BPN). Section IV describes the
experimental Results and Output. Section V concludes the
paper with Conclusion and Future works.
II. RELATED WORK
The Conveyed Information is similar to some of the
discussed methods are as follows.[1] Lei Xu, Lei Huang,
Changping Lui, there is an another form of identifying the
effect of illumination problems that could change the basic
appearance of an image in the human face recognition system.
many image processing method can toss out the low frequency
components of an image. Illumination can cause distortion of
processed images and perform poorly under normal lightening.
Firstly we choose a an appropriate images which can be
named as raw vs processed images. Hence they lightened up
with an idea that can dealed with illumination problems. So,
there is an adaptive method that can give robust performance
after the combination of data base images.
[2] Mehyar Emambakhsh, et all Currently the present
generation is facing the 3d technology issues. their
performance is increasing in day to day life. This imaging
systems has different noise components which can be deduced
by post processing methods in recognition systems. there is a
best performance in denoising techniques of 3D image
processing methods. As per the denoising techniques an image
is re-alligned , resampled and later on the face is cropped
which results in the feature space as query and gallery. By this
way, the mask size of an image is larger compared to 3d facial
recognition system [3] Sanjay Thakre,In this there are two
cases where biometric features and finger print features are
compared to identify how many face images are attempted and that can be rectified in object tracking such as scale images ,
which has good performance. moving back ground and motion blur images. For improving
[4] an enhanced FR System using Fast Walsh Hadamard the detection rate in CCTV footages we can use the
Transform and Chiral Superimposition Technique as efficient heterogeneous training data and data augmentation. Moreover,
pre-processing methods and Dual sub-band based Discrete the growth of intrinsic camera parameters are increasing
Wavelet Transform(DWT) for feature extraction Niveditha G rapidly.
V, Sharmila B P , ] Present face recognition systems are facing
many problems which can be poses and illuminations. So they III. BLOCK DIAGRAM
tried to improve the performance of FR systems. three The block diagram of face detection is shown in Fig. 1.
techniques are used viz is Fast walsh hadamard transform,
chiral image superimposition and discrete wavelet transform. A. PREPROCESSING& NORMALISATION
All these techniques are used particular stages to improve the Normalisation of pre-processing takes place in the sample
overall performance of FR systems. values of the variable. A count value or data is set into an
[5] Method of pose neutralisation based on flipping an dimensions of certain image pixels. First one free space sample
image and then fusing with the original, and a novel method of is scaled and corrected up with original image. The sample
illumination equalisation(AIE) based on erosion and dilation
image has a pixel range of [ i, j ] where
S. Hitesh Babu, Shreyas H.R, FR systems has many challenges
in facing the effects of pose problems and illumination i contains ith no.of rows
problems under lightening conditions. This paper has a
combination of active illumination equalization,image j contains jth no.of columns
sharpening,standard deviation filtering,mirror image super
imposition and binary particle swarm optimization which is
used for the implementation of feature space in the optimal
feature subset[6] a Computer Vision application to enable
message composition by Head Tracking Laura Montanini,
Enea Cippitella, The FR system which is helpful for
identifying the robbers in an ATM securities and banking
purposes.The research work that is obtained from the previous
work is [6] the human face appearance which is utterly
change the pose, illumination and background of an image.
There variations in the Face recognition is difficult to
recognize when the more variations occurred . to solve these
type of difficulties we used two different techniques namely
EAFI and image folding. The selection of features in dwt and
dct transforms has high recognition rates. Fig. 1. Block diagram of face detection
[7] a real time transmission and display system of a spherical B. DOMINANT ROTATE LOCAL BINARY PATTERN
image stream from a robot Yoshito Okada, Takumi
It rotates the binary values of an image.Divide the window
Fujinami,the capable of identifying the head movements at
different angles and poses is obtained in this paper. Hence into cells (e.g. 16x16 pixels for each cell).For each pixel in a
there is a real time transmission occurs to display an image in cell, compare the pixel to each of its 8 neighbors (on its left-
the system. This system has an hard mount display with an imu top, left-middle, left-bottom, right-top, etc.). Suppose if the
so that it can perform the operations by varying fastly. all these pixel value is greater than the neighbour's value of 5 , then
operations can used for building an actual robot.[8] an the binary digit should betake as "1". Otherwise, it can be
effective robust method for detecting faces in video sequences taken as "0". This gives an 8-digit binary number which is
based on Haar features P.Ithava Rani, K. Ithaya
usually converted to decimal for convenience. Fig. 2
Muneeswaran,the face detection system plays a crucial role at
video based sequences in computer vision system. these represents the pixel range of the face image.
computer vision systems is used for video surveillance, face
recognition ,emotions recognition, movement recognition and
data base management. this paper has high detection rates in
video sequences which is capable of processing the images
and to detect the human faces.
[9] the use of heterogeneous training data and data
augmentation is explored to improve their detection rate in
challenging CCTV scenes A.Dimou, P.Medentziduo,
F.Alvarez Garcia,in this the CCTV footage is often used for Fig. 2. Represents the pixel range of the face image that includes the skin
length, size of the image.The strength of the skin varies from person to
object tracking due to zoom operations, low camera quality
person.
and diverse working environments. There are several problems

0995
 C. SCALE INVARIANT FEATURE EXTRACTION
Scale Invariant Feature Transform (SIFT) are features
extracted from images to help in reliable matching
between different views of the same object. The extracted
features are invariant to scale and orientation, and are
highly distinctive of the image. [a] This computes the
locations of potential interest points in the image by
detecting the maxima and minima for a function of
Gaussian filters which is applied at different scales all
over the images and re-sampling those images. [b] These
images are discarded due to low contrast and an edge
response points , then it is assigned to the dominant
orientation.[c] Finally , a local feature descriptor is
computed at each key point. This descriptor is based on
the local image gradient, transformed according to the
orientation of the key point to provide rotation and scale
invariance. [d] Every feature is a vector of dimension
128distinctively identifying the neighborhood around the
key point.
D. GLCM PROPERTIES AND CO-OCCURANCE MATRIX
It is an image that ranges the corresponding pixel values into
the gray scale values or with other colours.It is defined for
the specifying the spatial relationship with an pixel value i and
j .For an instance the position operator of the function (x,y)
that indicates (2,1) is applicable to an pixel value of an image
then it determines the "two down , one right". Thereby a
matrix is formed by an gray scale values which is known as
p*p occurrence matrix. In any image the spatial relationship
between two pixels i and j determines the sum of the both gray
scale values of the image is equal to 1.
E. ENERGY
It is defined by the sum of squared elements in an rectangular
image which had their own uniformity.
2
(1)
F. ENTROPY
It gives a measure of complexity of the image. Complex
textures tend to have higher entropy. this is often a live of
randomness, having its highest price once the weather of C
area unit all equal. within the case of a game board, the
entropy would be low.
(2)
Where,
p(i , j) is the co occurrence matrix.
0996
G. CONTRAST
This measures the local variations and texture of
shadow depth in the gray level co-occurrence matrix.
H. CORRELATION
This measures the joint probability of the occurrence
of specified pixel pairs. Correlation may be a line of gray level
linear dependence between the pixels at the specified positions
relative to every alternative.
I. HOMOGENITY
Measures the closeness of the distribution of elements in the
GLCM to the GLCM diagonal to the texture of an
image.Angular Second Moment(ASM) could be a life of
homogeneity of a picture. A homogeneous scene can contain
solely many gray levels giving with a GLCM co-occurance
matrix. However it comparatively has high values of p(i, j).
Thus, the addition of squares will be always high.
J. BACK PROPAGATION NETWORK
The performance of the Back Propagation network was
evaluated in terms of training performance and classification
accuracies. Back Propagation network gives fast and accurate
classification and is a promising tool for classification of the
tumors. The back-propagation learning rule can be used to
adjust the weights and biases of networks to minimize the sum
squared error of the network. Back propagation network
depends upon the feed forward neural network. Feed forward
neural network is the simplest and easiest way in performing
the operations. It is based on the single layered neural network,
hence it is known as artificial neural network. The following
steps which is needed to perform in the artificial neural
network is mentioned below. They are as follows:
1. Activation of the input layer.
2. Transforming the information to the hidden
layer.
3. weights of the output layer.
The main goal of the back propagation network is supervised
learning algorithm. It used to map a set of input values to the
output values. It is to train the multi layered neural network
which has an appropriate arbitrary values of input and output.
This is function is to design values of one or more variable
into the real value or function. This can be also known an error
function or loss function. In the back propagation network,
error function finds the difference between the present input to
thee expected output.
This network has certain modes of learning methods. They are
stochastic and batch.
 K. Stochastic
In stochastic learning , each input has a weight
adjustment. So that every input should depend upon the
initialisation of weights. This stochastic produces more noise
using the local gradient process. Hence this calculates the
network points which can deduce the local minima.

L. Batch
In batch learning, weights are adjusted based on the
input values. In this the performance yields more faster and
more stable network. Thus it contains mini number of samples Fig. 5. shows that dominant rotate local binary pattern is applied for the input
and rest other samples are places in a batch from the data set. image

Limitations
The limitations of back propagation network has no
assurance to find the global minima of error function. Back
propagation does not need the normalisation of input vectors
but normalisation has high performance.
DRLBP ALGORITHM
INPUT AND OUTPUT IMAGES
The input image, face detection and dominant rotate local
binary pattern are shown in Fig. 3, Fig. 4 and Fig. 5
respectively.
Here the input binary image is converted into gray scale
image. So, that the camera can identify the image very easily.
Fig. 6, 7, 8, 9 and 10 respresents the dominant rotate local
binary pattern, gray scale image of left eye, right eye, nose and
mouth respectively. Fig. 11 detects the face image parts and
Fig. 12 identifies the particular location points. Fig. 13 and
Fig. 14 shows the aunthentication person and face recoginition
performance analysis.

Fig. 3. InputImage Fig. 6. Represents the sinusoidal pulsating signal of dominant rotate local
binary pattern

Fig. 7. Represents the gray scale image of left eye

Fig. 4. Face detection

The above image shows that the image is scanned and the face
is cropped with an rectangular box. It descibes that the image
is in binary image.there by it can detect the face of the image. Fig. 8. Represents the gray scale image of right eye

0997
 Fig. 9. Shows that the gray scale image of nose

Fig. 14. Shows the Performance Analysis of Face Recognition. Here the x-
axis is represented as number of samples are taken and y-axis represents the
face recognition accuracy
Fig. 10. Represents the gray scale image of mouth

IV. EXPERIMENTAL RESULTS

Hence, In this paper we came into an approach for Face
recognition using DRLBP&SIFT Feature Extraction.
Furthermore, the evaluation is done by using some of
parameters like accuracy, sensitivity and specificity which
could show best performance of the output shown in Fig. 15.

Fig. 11. Detecting the parts of the face image

Fig. 15. Parameters of the face recognition

A. COMPARISION

S.No Parameters Existing system Proposed

system

1. Accuracy 48% 75%

Fig. 12. Identifying the points of particular location B. PERFORMANCE

Serial Parameters Percentage(%)

no

1. Sensitivity 86%
Fig. 13. Shows the authentication person
2. Specificity 60%
For Example If any image is not identified from the date base
3. Accuracy 75%
then it will show that the person is an unauthenticated person.

0998
 V. CONCLUSION AND FUTURE WORK
In this paper we came into an approach for Face
recognition using DRLBP &SIFT Feature Extraction. This can
be used in Banking Purposes, ATM Securities and many more
Home applicable services. This idea has come through the
criminal detection that could help policemen to identify the
face of the criminal. Lamiaa A.Elrefaei et all has proposed a
paper on real time face recognition on client-server based
video sequences. this paper is used to find number of true
faces and number of false faces are identified. Hence, their
accuracy for finding the images is 48%. We proposed a
framework on face recognition using dominant rotate local
binary pattern and scale invariant feature extraction to detect
whether the person is an authenticate or an unauthenticated.
Hence by using the parameters like sensitivity, specificity and
accuracy has high performance compared to the Viola-Jones
algorithm. The Future scope of this paper can implement in
video based features.
ACKNOWLEDGMENT
We are pleased to acknowledge our sincere gratitude to
E.Rajinikanth, Asst.Professor, Department of ETCE,
Sathyabama Institute of Science and Technology, for guiding
us in all the aspects we needed and his constant support, which
lead us work towards the project effectively and progress
ahead through all the trouble shoots during the project.
REFERENCES
[1] Lei Xu, Lei Huang, Changping Lui, “Raw vs Processed: how to
use the Raw and Processes images for Robust face Recogition
under varying illumination”, in International conference on
Pattern Recognition, 2010.
0999
[2] Mehyar Emambakhsh, Jiangning Gao, Adrian N Evans,” An
Evaluation of Denoising Algorithms for 3D Face Recognition”
in International Conference on Imaging for Crime Detection and
Prevention, 2013.
[3] Sanjay Thakre,”Secure Reliable Multi-model Biometric
Fingerprint and Face Recogition” in International Conference on
Computer Communication and Informatics,2017.
[4] Niveditha G V, Sharmila B P,” DWT-based Face Recognition
using Fast Walsh Hadamard Transform and Chiral image
Superimposition as preprocessing techniques”, in International
Conference on Electronics and Communications, 2015.
[5] S. Hitesh Babu, Shreyas H.R,”Face Recognition using Active
Illumination Equalisation and Mirror Image Superimposition as
Pre-processing techniques”, in International Conference on
Signal and Image Processing,2014.
[6] LauraMontanini,Enea Cippitella, “Real Time Message
Composition Through Head Movements in Portable Android
Devices”, IEEEInternational Conference on Consumer
Electronics (ICCE) in 2014.
[7] Yoshito Okada, Takumi Fujinami,”Real-time Display of
Onboard Spherical Images That Synchronizes Head Pose of
Operator for Robotic Search”, IEEE International Symposium
on Safety, Security, and Rescue Robotics (SSRR) in 2016.
[8] P.Ithava Rani, K. Ithaya Muneeswaran ,“Robust Real Time Face
detectionautomatically from video sequence based on Haar
features”, International Conference on Communication and
Network Technologies (ICCNT) in 2014.
[9] A.Dimou, P.Medentziduo, F.Alvarez Garcia,”Multi-target
detection in CCTV Footage for Tracking applications using
deep learning techniques”,IEEE in Spain Information
Technology Institute in 2016.