Performance Evaluation of Selected Feature Extraction Techniques in Digital Face Image Processing
Performance Evaluation of Selected Feature Extraction Techniques in Digital Face Image Processing
ISSN No:-2456-2165
Abstract:- Digital image processing is the use of Feature extraction is related to dimensionality
computer algorithms to analyze digital images. Digital reduction (also named a feature vector) [40], [3]. Feature
image processing, involves many processing stages of extraction method can be either holistic or local. The holistic
which feature extraction stage is important. Feature feature extraction techniques are principle component
extraction involves reducing the number of resources analysis [39], [33], linear discriminate analysis [28], [29],
required to describe a large set of data. However, independent component analyse (ICA) [37] are used to
choosing a feature extraction techniques is a problem extracted the features of the whole facial images or sub-
because of their deficiencies. Thus, this paper presents a images. Although considerably good recognition accuracy
comparative performance analysis of selected feature can be obtained using holistic-based techniques but the
extraction techniques in human face images. 90 face limitation is that they cannot control illumination and local
images were acquired with three different poses viz: variations are difficult to describe. Using holistic
normal, angry and laughing. The face images were first algorithms, the global structure of the image is pin-pointed
pre-processed and then subjected to selected feature and the correlation between the images is computed. Many
extraction techniques (Local binary pattern, Principal scholars have employed local-based feature extraction
component analysis, Gabor filter and Linear techniques to overcome the drawbacks of holistic-based
discriminant analysis). The extracted features were then feature extraction techniques. The most local feature
classified using Backpropagation neural network. The methods that are used in face recognition systems are: local
results of recognition accuracy produced by Gabor filter, binary patterns (LBP) method [4], discrete wavelet
PCA, LDA and LBP at 0.76 threshold are 76.7%, 72.2%. transform (DWT) method [24] and Gabor filter [27], [20].
78.9% and 85.6%. Hence, it can be deduced that LBP
performed the best among the four selected feature However all these techniques have pros and cons. LBP
extraction techniques. is an appearance-based method which produce relatively
good results even at variability of the images collection.
Keywords:- Digital Image Processing, Feature Extraction, LBP is relatively insensitive to illumination changes, and its
Local Binary Pattern, Principal Component Analysis, computational simplicity. However, It is sensitive to noisy
Gabor Filter, Linear Discriminant Analysis. pixels wherein the value of the pixels can be easily affected
by the erroneous surrounding pixels. The PCA technique18
I. INTRODUCTION converts each two dimensional image into a one
dimensional vector. This vector is then decomposed into
Digital image processing is a field that explains the use orthogonal (uncorrelated) principle components (known as
of computer algorithms to analyze digital images. The action eigenfaces). PCA improves the performance of the machine
of retrieving an image from source, usually a hardware- learning algorithm as it eliminates correlated variables that
based source for processing (webcam or camera). Several don't contribute in any decision making.; helps in
images have been subjected to digital classifications like overcoming data over fitting issues by decreasing the
trauma-related data [15]; hypertensive data [41]; cancer data number of features; and produces results in high variance
[36]; [39] used Baboon, House, Lena and Peppers; [41] which improves visualization. However, PCA produces
plant leaf diseases; [19] concrete surface images; [46] breast low interpretability of principal components [2]. Gabor
cancer, facial images [9] etc. Digital image processing filtering is a popular approach to extract features from the
involves four stages viz; image acquisition, pre-processing, face images with different orientations by convolving the
feature extraction and classification. [12], [43]. image with the Gabor wavelet basis function. However,
Every image produces a large number of Gabor filtered
images depending upon the number of scale and orientation
Face database
Pre-processing Steps
Image Resize
Pose Orientation
Colour Transformation
Step 5: Output selected LBP features Convert all images in vector representation Z = {z1; z2…..
zN}, where the dimension of Z is M x_1;M = ro x_co.
Technique Two: PCA algorithm is shown in algorithm Calculate the mean of each class μi, total mean of all data
2. μ, between-class matrix SB(M _M), and within-class
Algorithm 2: PCA [18] matrix SW(M_M) of X
Following are steps involve; Find the k eigenvectors of SB with nonzero eigenvalues,
Step 1: Column or row vector of size N2 represents the and denote them as U =[u1;u2……uk}(i.e. UT SbU > 0).
set of M images (B1, B2, B3…BM) with size N*N (9)
Step 2: The training set image average (μ) is described as Calculate the eigenvalues and eigenvectors of UT SWU,
1 and then sort the eigenvalues and discard the
𝜇 = 𝑚 ∑𝑀 𝑛=1 𝐵𝑛 (4)
eigenvectors which have high values. The selected
Step 3: the average image by vector (W) is different for eigenvectors are denoted by V; thus, V represents the null
each trainee image space of SW.
Wi = Bi - μ (5) The final LDA matrix (ᴪ) consists of the range SB and
Step 4: Total Scatter Matrix or Covariance Matrix is the null space of SW as follows, ᴪ =UV.
calculated from Φ as shown below: The original data are projected on the LDA space as
𝐶 = ∑𝑀 𝑛=1 𝑤𝑛 𝑤𝑛 𝑡 = 𝐴𝐴𝑇 (6)
follows,
where A= [W1W2W3…Wn] Y = X ᴪ = XUV (10)
Step 5: Measure the eigenvectors UL and eigenvalues λL
of the covariance matrix C. C. Image Matching
Step6: For image classification, this feature space can be The image classification was done by Back-
utilized. Measure the vectors of weights propagation neural network. The algorithm of BNN is given
below. The back propagation algorithm is implemented
ΩT = [w1, w2, …, wM'], (7)
using following steps.
Initialize weights to small random values Wih ,Whj.
whereby, Feed input vector X1,X2....through Network and
Hk = UkT (B - μ), k = 1, 2, …, M' (8) computing weighting sum coming into node and then
apply the sigmoid function
Technique 3: Gabor Filters algorithm is shown in
algorithm 3
Algorithm 3: Gabor filter [43] (11)
Gabor Filters: Algorithm 3: Algorithm to Extract Feature
Vector Where Wih is weights between input nodes and hidden
Data: GABOR_MAG{No_of_Scale, No_of_Orient} nodes,
Result: FEATURE_VECTOR
Block_Size :=32 x 32, Total_Filter := 40; Sh is weighting sum coming into hidden node
While i ≤ No_of_Scale do
While i ≤ No_of_Orient do
Current_Tmg := GABOR_M AG{i, j} if (12)
GABOR_M AG{I, j}(x,y) =
The results obtained from the tables showed that obtained for in Table 1 for LBP at 0.76 threshold are REC of
maximum values were got at threshold of 0.76. The results 88.3%, SPEC of 80.0%, FMR of 20.0%, FNMR of 11.7%
obtained for in Table 3 Gabor filter at 0.76 threshold are and ACC of 85.6%.
Recall of 78.3% , SPEC of 73.3%, FMR of 26.7%, FNMR
of 21.7% and ACC of 76.7%. The results obtained for in Hence, it can be deduced that LBP performed the best
Table 2 for PCA at 0.76 threshold are REC of 75.0%, SPEC among the four selected feature extraction techniques. The
of 66.7%, FMR of 33.3%, FNMR of 25.0% and ACC of ROC graphs of Specificity vs thresholds, Recall vs
72.2%. The results obtained for in Table 4 for LDA at 0.76 thresholds, and Accuracy vs thresholds are shown in figure
threshold are REC of 80.0%, SPEC of 76.7%, FMR of 6, 7 and 8 respectively.
23.3%, FNMR of 20.0% and ACC of 78.9%. The results