International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

Various Approaches of Support vector Machines and combined Classifiers in

Face Recognition
Navin Prakash,

Dr.Yashpal Singh,

Research Scholar,
IFTM University, Moradabad
naveenshran@gmail.com

Associate Professor,
B.I.E.T.-Jhansi
yash_biet@yahoo.co.in

AbstractIn this paper we present the various approaches used in face recognition from 2001-2012.because in last decade face recognition is
using in many fields like Security sectors, identity authentication. Today we need correct and speedy performance in face recognition. This time
the face recognition technology is in matured stage because research is conducting continuously in this field. Some extensions of Support vector
machine (SVM) is reviewed that gives amazing performance in face recognition.Here we also review some papers of combined classifier
approaches that is also a dynamic research area in a pattern recognition.
Keywords: Face Recognition, Combined classifiers, Support vector Machines.

__________________________________________________*****_________________________________________________
I.
INTRODUCTION
Biometric recognition refers to the use of unique
physiological and behavioral characteristics, called
biometrics. A reliable identification system is a significant
component in several applications as to genuine users. A
biometric system may operate in two styles either in
verification mode or identification mode. In verification or
authentication, the user claims an identity and the system
verifies whether the claim is genuine that is 1: 1 Matching.
And Matching is 1: N in an identification system. A face
recognition system encounters various difficulties. The main
objectives is to design robust face recognition system to deal
these difficulties.
II.
EXTENSIONS OF SUPPORT VECTOR MACHINES
Support Vector Machines (SVM), offered by Vapink et al, is
a novel machine learning technique in light of statistical
learning theory. Contrasted with other machine learning
systems, for example, artificial neural networks, SVM can
tackle the issue of high dimension and local minima
effectively, which improves it have generalization ability.
Because of the amazing performance of SVM, SVM has
been effectively connected in numerous fields, for example,
text classification, time series prediction, pattern recognition
and image processing. The extension covers, however not
limited to the accompanying areas:

Linear SVM
Mathematical basis of SVM
Statistical learning theory
SVM for regression
Kernel function
Nonlinear SVM
SVM for classification
Multiple birth SVM (MBSVM)
Twin SVM (TWSVM)

Fuzzy SVM (FSVM)

Granular SVM (GSVM)
SVM applications
III.
SVM BASED FACE RECOGNITION REVIEW
Here some papers related to SVM, combined with other
technology from 2012 -2001 are given as:
An improved discriminative
common vectors and support vector machine based face
recognition approach (2012)In this paper [1], researchers proposed an enhanced
discriminative common vectors and support vector machine
based face recognition method. They plan an enhanced
discriminative common vector by change for the Fisher the
standard that can assess the inside of class and betweenclass scatter matrices all the more precisely for classification
purposes. At that point, they utilize support vector machine
as the classifier. Testing on two open substantial face
database ORL and AR database, the trial results exhibit that
the proposed technique is a viable face recognition
approach, which beats a few representative recognition
methods.
Face Recognition based on Principle Component
Analysis and Support Vector Machine (2011)In [2], face recognition is done utilizing PCA as feature
extractor and SVM is as a classifier. Tests have done on
Cambridge ORL database. This paper contrasts proposed
technique and PCA and nearest neighbors (PCA and NN)
routines for face recognition and support vector machine on
recognition rate and support vector machine on recognition
time separately. In conclusion support vector machine on
recognition rate of this system under small samples
circumstances is superior to anything other two
methods(PCA+NN and SVM).This system is helpful just for
a small sample of training data.
5941

IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

Face recognition using fuzzy rough set and support

vector machine (2010)This paper [3], proposed a technique for face recognition
utilizing the support vector machine (SVM) in view of the
fuzzy-rough set theory (FRST).Initially, features from
human face pictures are extracted by combining the 2-D
wavelet decomposition strategy with the grayscale integral
projection technique. And after that, the feature reduction
algorithm used FRST in face recognition. The feature
reduction algorithm taking into account FRST can dispose
of the repetitive elements of sample dataset and diminish the
space dimension of the sample data. The proposed technique
abstains from dispersing so as to lose of data brought on
before original rough set attribute reduction. The
exploratory results, when contrasted and the original rough
set strategy, demonstrate that the proposed system
accomplishes amazing performance in terms of recognition
rates.
Face Recognition based on DWT/DCT and SVM (2010)This paper [4], proposes a combined feature extraction
system which depends on DWT and DCT for face
recognition. The experimental result demonstrates that our
system is better than conventional PCA. The principle
reason is that the low-frequency sub-band got from DWT
adds to the global description of a face picture and is not
effectively exasperates by noises and facial expressions and
DCT endeavors between pixel redundancies to render
excellent decorrelation for face picture.
Facial Expression Recognition Approach Based on Least
Squares Support Vector Machine with Improved
Particle Swarm Optimization Algorithm (2010)In this paper [5], the issue in parameter determination of
least squares support vector machine (LS-SVM) confines
the advancement of LS-SVM, to pick the optimal
parameters of LS-SVM automatically, we proposed an
improved particle swarm optimization (PSO) algorithm
which can expand the convergent speed as well as enhance
the overall searching ability of the algorithm. The enhanced
PSO algorithm can increase the capacity of keeping away
from local optimum effectively. We utilize the enhanced
PSO algorithm to pick the optimal parameters of LS-SVM
automatically in the facial expression recognition system.
The exploratory results demonstrate that the proposed LSSVM strategy with improved PSO is better than BP
network, conventional SVM, and PSO-SVM.
ISVM for Face Recognition (2010)The similarity of human faces, unusual varieties and
maturing are the crucial obstacles in face recognition. To
handle this if large set of training images are utilized then

computational complexity will get increment as pictures are

fairly high dimension however in the event that training set
kept small, performance diminishes. Since both
classification and feature information are important for a
face recognition system DCT is utilized to bring down the
computational complexity and SVM for classification. Since
SVM is a famous classification tool yet the primary
disservice of SVM is its vast memory requirement and
calculation time to manage large data set. In this way this
paper [6], utilized incremental learning methodology i.e.
ISVM to stay away from large training time and memory
utilization for face recognition. The greatest point of interest
of utilizing the proposed strategy is that it not just decreases
the training time and updating time additionally enhances
the classification accuracy rate up to 100 %. Tests are
performed on ORL face database and results has
demonstrated that not just the training time utilized by the
ISVM is less contrasted with SVM additionally the
recognition rate raised to 100%.The greatest point of
preference of utilizing the incremental SVM is that it not
just decreases the training time and updating time
additionally enhances the classification accuracy rate to
100%.
Face recognition based on PCA and SVM optimized by
MEB (2010)In [7], this paper proposed another structure of face
recognition in light of PCA and SVM.All together to reduce
the computation of SVM algorithm in framework, MEB
(minimum closing ball) was brought into the system. The
test results has demonstrated that proposed algorithm can
show signs of improvement results than fundamentals PCA
and PCA_SVM algorithm. The accuracy rate of MEB
streamlining strategy is just .01 .So we have to more change.
Incremental and Decremental Support Vector Machine
Learning (2010)In this paper [8], Authors an on-line recursive algorithm for
training support vector machines, one vector at once, is
exhibited. Adiabatic increments hold the Kuhn-Tucker
conditions on all beforehand seen training data, in various
steps each computed analytically. The incremental strategy
is reversible, and decremental "unlearning" offers an
effective system to correctly estimate leave-one-out
generalization performance. Interpretation of decremental
unlearning in feature space reveals insight into the
relationship in the middle of generalization and geometry of
the data. Incremental learning and, specifically, decremental
unlearning offer a straightforward and computationally
effective plan for on-line SVM training and exact leave-oneout evaluation on the training data. The techniques can be
straightforwardly reached out to a broader class of kernel
5942

IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

learning machines with convex quadratic cost functional

under linear limits, including SVM regression. The
algorithm is naturally on-line and stretches out to querybased learning systems. Geometric interpretation of
decremental unlearning in feature space elucidates an
association, like, between generalization performance and
distance of the data from the subspace spanned by the
margin vectors.
Face recognition system using SVM and Feature
extraction by PCA and LDA combination (2009)In [9], presented an innovative approach for face
recognition. Initially PCA is used as dimension reduction
and LDA used for feature extraction .After that SVM is used
as Classifier. the experiments carried out on ORL database
results show that PCA+LDA+SVM had better recognition
rate than the other two method PCA+NCC and
PCA+LDA+NCC.
Face recognition based on multi class SVM (2009)In [10], embracing multi-class SVM to acknowledge face
recognition .In this methodology PCA is utilized to diminish
dimensions so that feature extraction is completed on face
picture. At that point a technique taking into account one
versus all SVM is executed to acknowledge multiclass
classifier on feature vectors of the face picture results of
experiments applied to ORL and Yale databases
demonstrate that our methodology is viable. By one versus
all SVM system, they acquired recognition rates as high as
93.5% in ORL and 97.3 at Yale database. In this system
radial base functions are utilized and it is important to
choose a kernel parameters and another parameter in
particular the penalty factor. In spite of the fact that tests this
paper completed our selection of kernel function parameter
and in addition penalty factors. At that point a couple of
good parameter is chosen by classification effect of the
trained SVM on the testing set.
Evaluation of face recognition system using support
vector machine (2009)
In [11], present face recognition system taking into account
SVM which go about as multi-class classifier. The
performance of this framework is assessed utilizing Yale
database with different facial expression and illumination
condition. This strategy train and test picture with raw
pictures information of 625 features. The results gave better
result in terms of recognition rate in contrast PCA. This
methodology is diverse to other on the grounds that there are
no preprocessing steps done before recognition undertaking
is performed. In this framework performs classification task
up to 84% on Yale database which is more noteworthy than
the mix of PCA and SVM (liner kernel).This strategy is
relevant just on liner kernel.

Study of face recognition algorithm based on proximal

support vector machine (2009)In [12], face recognition algorithm in light of SVM has
better recognition rate, however, the time of training is long
when it have a large number of samples. To defeat this issue
in this paper the face recognition algorithm in view of
proximal SVM was proposed, which the first face picture
through PCA then utilize PSVM to classify. The trial results
in ORL and Yale database demonstrate that the training time
has a more noteworthy lessening and recognition rate slight
lower than conventional SVM.The lessening of training time
is SVM's a few percent. Especially, it has better improve of
training time when dimension is low and have a bigger
number of samples. Customary SVM figured quadratic
programming problems it need commonly to enhance to
iterative and additional tedious and it depends on a long
time training when a huge number of samples has.PSVM
algorithm does not have to iterative to ascertain and it is
comparable to taking care of an issue of linear equations.
A New Sampling-based SVM for Face Recognition
(2009)With a specific end goal to choose boundary samples, this
paper [13], presented a novel sample selection strategy
named Kernel Subclass Convex Hull (KSCH) sample choice
technique, which iteratively select boundary samples of
every class convex hull in high dimensional space (by kernel
trick).Trial results on face databases demonstrate that our
KSCH test choice technique can choose less high-quality
sample to look after SVM with high recognition accuracy
and rapidly executing speed. The test results on MIT-CBCL
and UMIST face databases demonstrated that our KSCH the
technique could viably decrease the size of the training set
with good classification accuracy, and overwhelming
enhance the executing rate of SVM.
A Semi-Supervised Support Vector Machine Based
Algorithm for Face Recognition (2009)This paper [14], presents a novel SVM based face
recognition strategy has the capacity learn and recognition
faces that are not in the face database some time
recently.The paper exhibits the hypothesis and the
experimental results utilizing the new approach. Our
exploratory results demonstrate that the accuracy rate of the
proposed algorithm ranges from 91% up to 100%.
The Techniques for Face Recognition with Support
Vector Machines (2009)This face identification system must be powerful to the
different nature of the pictures, for example, light, face
expression, glasses, facial hair, and mustaches and so on.
Creators proposed the wavelet transformation algorithms for
5943

IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

lessening the source information space. They understood the

technique for the values' extension of pixels to the entire
intensity range and the algorithm of the equalization of the
histogram to adjust image intensity values. In this paper
[15], researchers proposed a proficient face identification
proof framework in light of support vector machines. This
framework is expected for face identification by utilizing the
picture even low quality. The time calculation used for face
recognition is plausible to apply real-time systems because
of the size sensible of the feature vector.
Face Recognition Based on Face Gabor Image and SVM
(2009)The paper [16], proposed a powerful algorithm for face
recognition utilizing face Gabor image and Support Vector
Machine (SVM).The face Gabor picture was firstly
determined by down sampling and concatenating the Gabor
wavelets representations, which is the face's convolution
picture with a family of Gabor kernels, and after that the 2D
Principle Component Analysis (2DPCA) technique is
connected to the face Gabor picture to extract the feature
space. At last, Support Vector Machine (SVM) is utilized to
characterize. Test results on ORL database demonstrate that
the face Gabor picture conveys more Discriminant data and
the proposed strategy can accomplish 99.5% recognition
rate on full face dataset and accomplish 98.0%
acknowledgment rate on the unitary dataset.
SVM Classifier for Face Recognition
Unconstrained Correlation Filter (2009)-

Based

on

The paper [17], exhibited a novel strategy for face

recognition procedure utilizing a blend of unconstrained
correlation filter and support vector machine. Though, the
authors utilized the unconstrained minimum average
correlation energy (UMACE) filter. The UMACE filter
created recognition parameter taking into account top to side
lobe ratio (PSR).Rather than training to the support vector
machine by the face picture for classification, the PSR
values from a set of UMACE filters was utilized to train the
SVM.The proposed system is tried with Cropped Yale B
illumination database and the method demonstrates the huge
decrease in error rate contrasted with traditional UMACE
filter based method.
SVM-based Discriminant Analysis for Face Recognition
(2008)In [18], proposed a method to locate an optimal LDA matrix
by overhauling the between-class scatter matrix
consolidating a Support Vector Machine (SVM).The exact
assessment demonstrates the observable performance
change over the conventional LDA.Since, The proposed

strategy can be promptly stretched out to a non-linear

rendition of SVM.
Face recognition using Multi Scale PCA and support
vector machine (2008)In [19], a novel multi-scale PCA and SVM for face
recognition was proposed. Firstly Gabor wavelet transform
results included five scales and eight directions calculated
and 40 feature matrices which recreated with the same scale
and the same directions transform results of different face
picture got. Also, the dimensionality reduction procedure
with PCA was connected to form the new training samples;
at last 40 SVM classifier obliged and the vote choice system
was utilized to determine the recognition results. This
methodology has gotten a decent recognition performance
through reorganizing the Gabor feature, reducing the
dimension by MS-PCA and SVM applied as classifies
Research on Face Recognition based on Boolean Kernel
SVM (2008)Authors Proposed recognizing strategies based on Boolean
kernel function SVM.Firstly, Karhunen-Loeve transform
was utilized to get the representation premise of face picture
set, furthermore, the extracted characteristics is deciphered
into 0-1 format, thirdly, SVM based Boolean kernel function
was utilized to order. The face acknowledgment explore
different avenues regarding ORL face databases
demonstrates that the proposed system prompted altogether
better
acknowledgment
precision
contrasted
and
conventional PCA system and linear SVM.This paper[20],
presented another nonlinear part capacity for face
recognition - MDNF Boolean kernel function and tests
ordinarily on the standard database Olathe results appear
this technique is legitimate and ascendant contrasted and the
conventional PCA calculation and linear SVM .
Using Support Vector Machines to Enhance the
Performance of Bayesian Face Recognition (2007)In this paper [21], developed to a direct Bayesian-based
support vector machine (SVM) by joining the Bayesian
examination with the SVM.Not at all like conventional
SVM-based face recognition systems that oblige one to train
an expansive number of SVMs, the direct Bayesian SVM
needs one and only SVM trained to classify the face
difference between intrapersonal variety and additional
individual variety. Keeping in mind the end goal to enhance
the recognition performance, they create three more
Bayesian-based SVMs, including the one-versus-all
technique, the hierarchical agglomerative clustering-based
method, and the adaptive clustering method. At long last,
they join the adaptive clustering method with multilevel
5944

IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

subspace analysis to further enhance the acknowledgment

execution.

Locating Facial Feature Points Using Support Vector

Machines (2005)-

An improved PCA face recognition algorithm based on

discrete wavelet transformation and Support vector
machine (2007)-

In this paper [25], offered a novel facial feature point

extraction plan utilizing SVM and binarization strategies is
proposed Authors use the great generalization capacity of
SVM to make the phase of pattern Recognition extremely
exact, and affirm the predominance with trial results. To
precisely find the desired feature points, they firstly apply
the binarization strategy with a careful-selected color
criterion to strengthen features; at that point, it is able to find
the endpoints of prepared features as the desired feature
points. Amid the investigations, they established that in spite
of the fact that including all the data into SVM preparing
will ascend the classification exactness higher than 98%, on
the other hand, it appears to be not lucrative to exchange this
small accuracy change (around 3%) for the enlarged manysided quality in SVM calculation.

In [22], the 2-D discrete wavelet transformation used to

handle the ORL database face picture to shape the low
frequency sub-image by separating the low frequency
component, then the PCA is used to get the Characteristics
sub picture, finally the extracted Eigen faces input to the
SVM classifier for training and recognition. The
experiments demonstrate that algorithm can enhance the
calculation speed and recognition rate.
Facial Feature Selection Based on SVMs by Regularized
Risk Minimization (2006)this paper [23], presented a strategy in light of SVMs by
regularized risk minimization for the facial feature selection
going for enhancing execution of the classifier by (1)
utilizing WT + KPCA as filter way to deal with pick an set
of more important delegates to substitute the first
information for feature selection;(2) utilizing SVM RFE
iterative method as wrapper way to deal with acquire the
optimum feature subset;(3) utilizing regularized risk
minimization as feature selection ranking criterion. Test
results on FERET face database subsets show that the
proposed strategy has a noteworthy improvement in the
classification accuracy and speed. So author says that it is a
successful answer for high dimensional facial feature
selection.
Face Recognition Based on Wavelet Transform and
SVM (2005)This paper [24], proposed another plan for human face
recognition utilizing wavelet transform combined with
support vector machine and in addition clustering method.
The components in examination are:1) Using low frequency
sub band coefficients LL of wavelet decomposition as input
for SVM, to weaken the impact of common contrasts,2) Do
fine acknowledgment by multi system for PCA, LFA on
pre-accepted picture to diminish FAR and for machine
learning,3) Conduct homomorphic filter to face picture for
pre-processing to manage illuminations influence,4)Machine
learning while recognition, upgrade or modify mode vectors
by aftereffects of fine recognition,5) Clustering before doing
face recognition, on multi-target exhibition to decrease
inquiry time. Test result demonstrates that their
methodology expanded the face recognition accuracy and
more strong to expression, illumination, etc.

A SVM Face Recognition Method Based on GaborFeatured Key Points (2005)This paper [26], introduced a novel face acknowledgment
methodology in light of Support Vector Machine and
Gabor-Featured Key Points, which takes technological
favorable circumstances of both Support Vector Machine
and Gabor feature extraction. The primary commitments of
this paper accordingly lie in the accompanying perspectives:
(1) Support Vector Machine was effectively connected to
face recognition by utilizing Gabor elements of key focuses;
(2) Gabor elements of key focus acquainted with speak to an
entire face in a processable dimensional space. Accordingly,
experiments on FERET and AT&T databases have indicated
huge better performance with this system.
Support Vector Machine with Local Summation Kernel
for Robust Face Recognition (2004)This paper [27], presented Support Vector Machine (SVM)
with local summation kernel for vigorous face recognition.
In any case, customary strategies apply one kernel to global
features. The viability of local features was not used in those
methods. Keeping in mind the end goal to utilize the
effectiveness of local features in SVM, one kernel is applied
to local features. It is important to compute one kernel value
from local kernels keeping in mind the end goal to utilize
the local kernels in SVM.The proposed system is contrasted
and the global kernel-based SVM.The recognition rate of the
proposed system is more than 80% under large occlusion,
while the recognition rate of the SVM with global Gaussian
kernel diminishes significantly.
A SVM-Based Method for Face recognition using a wavelet
PCA Representation of Faces (2004)5945

IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

This paper [28], proposed another technique for face

representation. For face representation we have utilized a
two-stage system, initial two-dimensional discrete wavelet
transform (DWT) is utilized to change the appearances to a
more segregated space and after that principal component
analysis (PCA) is connected. The proposed system created a
huge change which incorporates a generous lessening in
error rate and in time of processing amid the acquiring PCA
orthonormal basis.
Bayesian Face Recognition Using Support Vector
Machine and Face Clustering (2004)In this paper [29], authors first developed to a direct
Bayesian based Support Vector Machine by joining the
Bayesian investigation with the SVM.Dissimilar to
customary SVM-based face recognition technique that needs
to train countless SVMs, the direct Bayesians needs stand
out SVM prepared to classify the face distinction between
intrapersonal variety and extra-personal variation. To
enhance the recognition performance they create three more
Bayesian based SVMs, counting the one-versus-all method,
the Hierarchical Agglomerative Clustering based method,
and the adaptive clustering method. They demonstrate the
improvement of the new algorithms over conventional
subspace methods through experiments on two face
databases, the FERET database, and the XM2VTS database.
Whats more, the clustering strategy is likewise reached out
to the unified subspace face recognition method.
Improving the Performance of Multi-Class SVMs in
Face Recognition with Nearest Neighbor Rule (2003)In this paper [30], researcher proposed a NNR technique (in
the PCA+LDA subspace) to diminish the number of training
classes for multi-class SVMs, with a specific end goal to
accelerate the classification time. They explored different
avenues regarding the binary tree organized multi-class
SVMs and one-versus - one strategy manufactured from the
lessened number of classes. Proposed multi-class SVMsbased technique showed lower error rate than that of the
current NNC technique with a aster classification time
contrasted with that of multi-class SVMs.they checked that
our new multiclass SVMs-based system can be accomplish
quick and compelling face recognition. The classification
procedure of their system is much quicker.
Face Recognition Using Support Vector Machines with
the Robust Feature (2003)This paper [31], presented an efficient face recognition
algorithm by mix of MFA and LS-SVM.Authors presented a
novel face recognition framework that hybrids the Gabor
wavelet, KPCA, and SVM.This algorithm determines
initially augmented Gabor-face vector based upon the

Gabor wavelet transformation of the raw face pictures,

which is strong to expression and pose variation. The
KPCA, which empowers the principal components to be
processed inside of the product space of the input
augmented Gabor-face vector, is utilized to successfully
effectively extract feature of the augmented Gabor-face
vector. The SVM is utilized to classify those powerful
features, and acquired high the accuracy. The exploratory
results with the ORL face database demonstrate the better
effectiveness of the proposed algorithm.
Facial Component Extraction and Face Recognition with
Support Vector Machines (2002)This technique [32], utilized a two-stage approach for face
recognition as: Initial various facial parts are discovered,
which are then glued together, furthermore, the subsequent
face vector is recognized as speaking to one of the
conceivable persons. Amid the extraction step, a wavelet
statistics subsystem gives the conceivable locations of eyes
and mouth which are utilized by the Support Vector
Machine (SVM) a subsystem to extract facial components.
The application of wavelet system speeds up the recognition
process meaningfully. Tests completed utilizing the AT&T
(previously ORL) face database, the algorithm is quick
(under 0:1 second for every picture) with great results.
Face Recognition with Support Vector Machines: Global
versus Component-based Approach (2001)In this paper [33], authors presented a component-based
method and two global methods for face recognition and
assess them concerning robustness against pose changes. In
the component system first find facial components, extract
them and combine them into a single feature vector and
classified by SVM.The two global systems recognize faces
by classifying a single feature vector comprising of the gray
values of the entire face picture. In the first global system,
they trained a single SVM classifier for every individual in
the database. The second system comprises of sets of
viewpoint particular SVM classifiers and includes clustering
amid training. They performed broad tests on a database
which included faces turned up to around 40" inside and out.
The component system clearly outperformed both global
systems on a11 tests. They tried the systems on a database
which included faces rotated in depth up to about 40'.In all
experiments, the component-based system outperformed the
global systems despite the fact that they utilized all the more
effective classifiers (.non-linear instead of linear SVMs)for
the global system. This demonstrates that utilizing facial
components rather than the entire face design as input
features essentially disentangles the assignment of face
recognition.

5946
IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

Face Recognition by Support Vector Machines (2000)In this paper [34], the SVMs with a binary tree recognition
system
are
utilized
to
handle
the
face
recognitionproblem.Researchers show the capability of
SVMs on the Cambridge ORL face database, containing
truly a high degree of variability in expression, pose, and
facial details. They additionally show the recognition
investigate a bigger face database of 1079 pictures of 137
people. They contrasted the SVMs based recognition and the
standard Eigenface methodology utilizing the Nearest
Center Classification (NCC) model. They exhibited the face
recognition analyzes utilizing linear support vector
machines with a binary tree classification strategy. As
appeared in the correlation with different strategies, SVMs
can be viably trained for face recognition. The exploratory
results demonstrate that the SVMs are a superior learning
algorithm than the nearest center approach for face
recognition.
IV.

MULTIPLE CLASSIFIER SYSTEMS REVIEW

As of late, MCSs in view of the blend of yields of an

arrangement of diverse classifiers have been proposed in the
field of face recognition as a technique for growing superior
characterization systems. Generally, the methodology
utilized as a part of the pattern recognition systems has been
to tentatively think about the performance of a few
classifiers keeping in mind the end goal to choose the best
one. On the other hand, an option methodology in view of
multiple classifiers has risen over late years and spoke to a
takeoff from the conventional technique. This methodology
goes under different names, for example, MCS or council or
gathering of classifiers, and has been produced to address
the down to earth issue of planning automatic pattern
recognition systems with enhanced precision. A parameterbased combined classifier has been created in [35] so as to
enhance the generalization capability and thus the system
performance of face recognition system. A blend of three
LVQ neural systems that are prepared on distinctive
parameters demonstrated fruitful in speculation for invariant
face recognition. The combined classifier brought about
enhanced system accuracy contrasted with the component
classifiers. With just three preparing faces, the system
performance on account of the KUFB is 100%. Reference
[36] presents a framework for invariant face recognition. A
combined classifier uses the generalization capacities of
both LVQ and Radial Basis Function (RBF) neural systems
to construct an representative model of a face from a mixed
bag of preparing examples with distinctive stances, points of
interest and outward appearances. The combined
generalization slip of the classifier is observed to be lower
than that of every individual classifier. Another face
combination system is executed for diminishing the false

acknowledgment rate and upgrading the dismissal capacity

of the classifier. The system is equipped for perceiving a
face in under one second. The surely understood ORL
database is utilized for testing the combined classifier. On
account of the ORL database, a right recognition rate of
99.5% at 0.5% dismissal rate is accomplished. Reference
[37] speaks to a face recognition committee machine
(FRCM), which collects the yields of different face
recognition algorithms, Eigenface, Fisherface, Elastic Graph
Matching (EGM), SVM and neural system, to acquire a
brought together choice with enhanced exactness. This
FRCM outflanks every one of the people by and large. It
accomplishes 86.1% on Yale face database and 98.8% on
ORL face database. In [38], a hybrid face recognition
strategy that holistic and feature analysis-based
methodology utilizing a Markov random field (MRF) model
is exhibited. The face pictures are isolated into littlepatches,
and the MRF model is utilized to speak to the relationship
between the picture patches and the patch ID's. The MRF
model is initiallygained from the training picture patches,
given a test picture. The most likely fix ID's are then
gathered utilizing the belief propagation (BP) HM. At long
last, the picture's ID is controlled by a voting scheme from
the assessed patch ID's. This technique accomplished
96.11% on Yale face database and 86.95% on ORL face
database. In [39], a combined classifier system comprising
of an ensemble of neural systems depends on varying the
parameters identified with the design and training of
classifiers. The boosted algorithm is utilized to make
irritation of the training set utilizing MLP as a base
classifier. The last result is joined by utilizing simple
majority vote rule. This system accomplished 99.5% on
Yale face database and 100% on ORL face database. To the
best of our insight, these outcomes are the best in the literary
works.
V.

MULTIPLE CLASSIFIER SYSTEMS

REVIEW

Since the performance of any classifier is more sensitive to a

few elements and generally invariant to others, a recent
pattern has been to individual classifiers with a specific end
goal to incorporate their corresponding data and
consequently make a system that is more vigorous than any
individual classifier to variables that muddle the recognition
assignment. Such systems have been termed as multiple
classifier systems (MCSs) [40] and are an exceptionally
dynamic research area at present.
Face Recognition using Multiple Classifiers (2006)This paper, [41] proposed a real-time successful face
recognition system for customer applications. Since the way
of use domain requires real-time result and better accuracy,
5947

IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

it represents a serious Challenge. To address this challenge,

they concentrate on different classification systems,
specifically, Support vector machine (SVM), linear
discriminant analysis (LDA) and K-nearest neighbor
(KNN). Authors watched that in spite of the fact that KNN
is as effective as SVM yet KNN denies its use Because of
high response time when information is high dimensional.
To accelerate KNN recovery they proposed a feature
reduction technique utilizing Principle component analysis
(PCA) to Encourage real-time face recognition alongside
better exactness. They apply KNN after we reduce the
quantity of features by PCA. Henceforth, they test different
classification approaches, to be specific, SVM, KNN, and

KNN with PCA, LDA, and LDA with PCA on a benchmark

dataset and exhibit the viability of KNN with PCA over
SVM and LDA.
Numerous methodologies proposed for face recognition
incorporate the accompanying: Lu et al. [42] combined the
consequences of PCA, ICA and LDA utilizing the sum rule
and RBF system based [46] combination procedure (Fig.
xyz); Marcialis and Roli [43-45] consolidated the results of
the PCA and LDA algorithms; Achermann and Bunke [47]
used basic fusion rules (rank sum, majority voting, Bayes
combination rule) to incorporate the weighted results of
three classifiers taking into account frontal and profile views
of countenances;

Figure 1.: Classifier combination system framework [187].

Tolba and Abu-Rezq [48] utilized a simple combination rule
for fusing the decisions of RBF and LVQ systems; Wan et
al. [49] utilized an SVM and HMM hybrid model; Kwak
and Pedrycz [50] partitioned the face into three regions,
applied the Fisherfaces strategy to the region and
additionally to the entire face and after that integrated the
classification results utilizing the Choquet fuzzy integral
[51]; addadnia et. al. [52] utilized PCA, the Pseudo Zernike
Moment Invariant (PZMI) [53, 54] and the Zernike moment
Invariant (ZMI) to extract feature vectors in parallel, which
were then classified at the same time by independent RBF
neural systems what's more, the outputs of these networks
were then combined by a majority rule to determine the final
identity of the person in the input image.

References
[1] Wen, Ying. "An improved discriminative common vectors
and support vector machine based face recognition
approach." Expert Systems with Applications39.4 (2012):
4628-4632.
[2] Chengliang Wang;Libin Lan;Yuwei Zhang; Minjie
Gu; Face Recognition Based on Principle Component
Analysis and Support Vector Machine : 3rd International
Workshop on Intelligent Systems and Applications
(ISA),2011,pp.1-4
[3] Shi-yi Wang; Tao Liang; Face recognition using fuzzy
rough set and support vector machine IEEE
International Conference on Intelligent Computing and
Intelligent Systems (ICIS), 2010 Volume: 2 ,pp: 777 779

5948
IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

[4] Meihua Wang;

Hong Jiang;
Ying Li; Face
recognition based on DWT/DCT and SVM International
Conference on Computer Application and System
Modeling (ICCASM), 2010 , V3,pp:507 510
[5] Shuaishi Liu; Yantao Tian; Cheng Peng; Jinsong Li;
Facial expression recognition approach based on least
squares support vector machine with improved particle
swarm optimization algorithm IEEE International
Conference on Robotics and Biomimetics (ROBIO),
2010 pp: 399 - 404
[6] Sisodia, D.; Shrivastava, S.K.; Jain, R.C.; ISVM for
Face Recognition International Conference on
Computational
Intelligence
and
Communication
Networks (CICN), 2010 pp: 554 - 559
[7] Gao Wei; Zhao Hai; Mei Zhan; Zhang Lizhong; Face
Recognition Based on PCA and SVM Optimized by
MEB 3rd International Conference on Intelligent
Networks and Intelligent Systems (ICINIS), 2010,pp 68
71
[8] [150] Karasuyama, M.; Takeuchi, I.; Multiple
Incremental Decremental Learning of Support Vector
Machines IEEE Transactions on Neural Networks,
Volume: 21 , Issue: 7 ,2010 , pp: 1048 - 1059
[9] Jianke Li; Baojun Zhao; Hui Zhang; Jichao Jiao; Face
Recognition System Using SVM Classifier and Feature
Extraction by PCA and LDA Combination International
Conference on Computational Intelligence and Software
Engineering (CiSE), 2009 ,pp 1 4
[10] Zhao Lihong; Song Ying; Zhu Yushi; Zhang Cheng;
Zheng Yi; Face recognition based on multi-class SVM
Chinese Conference Control and Decision, 2009. CCDC
'09, 2009,pp: 5871 5873
[11] Becker, B.C.; Ortiz, E.G.; Evaluation of face
recognition techniques for application to facebook 8th
IEEE International Conference on Automatic Face &
Gesture Recognition, 2008. FG '08. pp: 1 - 6
[12] Liying Lang; Feijia Xia; Xiaojie Wang; Study of Face
Recognition Algorithm Based on Proximal Support
Vector Machine Second International Conference on
Intelligent Computation Technology and Automation,
2009. ICICTA '09. pp: 702 - 705
[13] Wenhan
Jiang;
Xiaofei
Zhou;
Hongchuan
Hou; Xinggang Lin;A New Sampling-Based SVM for
Face Recognition Chinese Conference on Pattern
Recognition, 2009. CCPR 2009, pp 1 5
[14] Wei-Shan Yang; Chun-Wei Tsai; Keng-Mao Cho; ChuSing Yang; Shou-Jen Lin; Ming-Chao Chiang; A semisupervised support vector machine based algorithm for
face recognition IEEE International Conference on
Systems, Man and Cybernetics, 2009. SMC 2009, pp
1609 - 1614
[15] Igor Frolov ; Rauf Sadykhov The Techniques for Face
Recognition with Support Vector Machines Proceedings
of the International Multiconference on Computer
Science and Information Technology pp. 3136,2009
[16] Xiao-ming Wang; Chang Huang; Guo-yu Ni; Jin-gao
Liu; Face Recognition Based on Face Gabor Image and
SVM 2nd International Congress on Image and Signal
Processing, CISP '09, 2009 , pp 1 4

[17] Banerjee, P.K.; Chandra, J.K.; Datta, A.K.; SVM

classifier for face recognition based on unconstrained
correlation filter International Conference on Signal and
Image Processing Applications (ICSIPA), 2009 IEEE
,2009 , pp: 290 - 294
[18] [160]Sang-Ki Kim; Kar-Ann Toh; Sangyoun Lee;
SVM-based Discriminant Analysis for face recognition
3rd IEEE Conference on Industrial Electronics and
Applications, 2008. ICIEA 2008. ,2008, pp: 2112 - 2115
[19] Guoyun Zhang; Jing Zhang; Face recognition using
multi-scale PCA and Support Vector Machine 7th
World Congress on
Intelligent Control and
Automation(WCICA), 2008. pp 5906 5910
[20] Kebin Cui; Feng Han; Ping Wang; Research on Face
Recognition Based on Boolean Kernel SVM Fourth
International Conference on Natural Computation, 2008.
ICNC '08,Volume:2 , pp: 148 - 152
[21] Zhifeng Li; Xiaoou Tang; Using Support Vector
Machines to Enhance the Performance of Bayesian Face
Recognition IEEE Transactions on Information
Forensics and Security, Volume: 2 , Issue: 2 ,2007 , pp:
174 - 180
[22] Hong Wang; Su Yang; Wei Liao An Improved PCA
Face Recognition Algorithm Based on the Discrete
Wavelet Transform and the Support Vector Machines
International Conference on Computational Intelligence
and Security Workshops, 2007.pp 308-311
[23] Weihong Li; Weiguo Gong; Liping Yang; Weimin Chen;
Xiaohua Gu; Facial Feature Selection Based on SVMs
by Regularized Risk Minimization 18th International
Conference on Pattern Recognition,ICPR 2006,Volume:
3 ,pp: 540 - 543
[24] Bing Luo ;Yun Zhang ; Yun-Hong Pan ; GuangDong ;
Guang Dong; China Face recognition based on wavelet
transform and SVM IEEE International Conference
onInformation Acquisition, 2005, 5 pp
[25] Chia-Te Liao; Yu-Kuen Wu; Shang-Hong Lai;
Locating facial feature points using support vector
machines 9th International Workshop on Cellular
Neural Networks and Their Applications, 2005,pp: 296 299
[26] Jun Qin; Zhong-Shi He; A SVM face recognition
method based on Gabor-featured key points
Proceedings of International Conference on Machine
Learning and Cybernetics, 2005,pp 5144 - 5149
[27] Hotta, K.; Support vector machine with local
summation kernel for robust face recognition
Proceedings of the 17th International Conference on
Pattern Recognition, 2004. ICPR 2004. Volume: 3, pp:
482 - 485
[28] Safari, M.; Harandi, M.T.; Araabi, B.N.; A SVM-based
method for face recognition using a wavelet PCA
representation of faces International Conference on
Image Processing, ICIP '04. 2004 ,pp 853 856
[29] Zhifeng Li; Xiaoou Tang; Bayesian face recognition
using support vector machine and face clustering
Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition CVPR,
2004,pp II-374 - II-380 Vol.2
5949

IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 10

ISSN: 2321-8169
5941 - 5950

__________________________________________________________________________________________________________________________________

[30] Chang-Hun Lee; Sung-Wook Park; Weide Chang; JongWook Park; Improving the performance of multi-class
SVMs in face recognition with nearest neighbor rule
Proceedings. 15th IEEE International Conference on
Tools with Artificial Intelligence, 2003, pp: 411 - 415
[31] Guang Dai; Changle Zhou; Face recognition using
support vector machines with the robust feature
Proceedings The 12th IEEE International Workshop on
Robot and Human Interactive Communication, ROMAN
2003,2003 , pp: 49 - 53
[32] Dihua Xi; Podolak, I.T.; Seong-Whan Lee; Facial
component extraction and face recognition with support
vector machines Proceedings. Fifth IEEE International
Conference on Automatic Face and Gesture Recognition,
2002. pp: 76 - 81
[33] Heisele, B.; Ho, P.; Poggio, T.; Face recognition with
support vector machines: global versus component-based
approach Proceedings. Eighth IEEE International
Conference on Computer Vision, ICCV 2001,Volume: 2
,pp: 688 - 694 .
[34] Guodong Guo; Li, S.Z.; Kapluk Chan; Face recognition
by support vector machines Proceedings Fourth IEEE
International Conference on Automatic Face and Gesture
Recognition, 2000 , pp: 196 - 201
[35] A.S. Tolba, " A parameterbased combined classifier for
invariant face recognition," Cybernetics and Systems,
vol. 31, pp. 289-302, 2000.
[36] A.S. Tolba, and A.N. Abu-Rezq, "Combined classifiers
for invariant face recognition," Pattern Anal. Appl. Vol.
3, no. 4, pp. 289-302, 2000.
[37] Ho-Man Tang, Michael Lyu, and Irwin King, "Face
recognition committee machine," In Proceedings of IEEE
International Conference on Acoustics, Speech, and
Signal Processing (ICASSP 2003), pp. 837- 840, April 610, 2003.
[38] Rui Huang, Vladimir Pavlovic, and Dimitris N. Metaxas,
"A hybrid face recognition method using Markov
random fields," ICPR (3) , pp.157-160, 2004.
[39] A.S. Tolba, A.H. El-Baz, and A.A. El-Harby, "A robust
boosted parameter- based combined classifier for pattern
recognition,"submitted for publication.
[40] F. Roli and J. Kittler, "Multiple Classifier Systems,Third
International Workshop, MCS 2002, Cagliari,Italy, June
24-26, 2002, Proceedings," in Lecture Notes in Computer
Science, Vol.2364, Lecture Notes in Computer Science:
Springer Verlag, 2002.
[41]Praveen
pallabhi;
thuraisingham
bhavaniFace
recognition using Multiple Classifiers Proceeding of the
IEEE Conference on Tools in Artificial Intelligence,
2006
[42] X. Lu, Y. Wang, and A. K. Jain, "Combining Classifiers
for Face Recognition," in Proc. IEEE International
Conference on Multimedia & Expo (ICME 2003).
Baltimore, MD, 2003, pp.13-16.
[43] G. L. Marcialis and F. Roli, "Fusion of LDA and PCA
for face recognition," in Proceedings of the Workshop on
Machine Vision and Perception, 8th Workshop of the
Italian Association for Artificial Intelligence (ALLA 02),
2002.

[44] G. L. Marcialis and F. Roli, "Fusion of LDA and PCA

for face verification," in Proceedings of the Workshop on
Biometric Authentication, Vol.2359, LNCS, M.
Tistarelli, J. Bigun, and A. K. Jain, Eds. Copenhagen,
Denmark: Springer-Verlag, 2002, pp.30-37.
[45] G. L. Marcialis and F. Roli, "Fusion of appearancebased
face recognition algorithms," Pattern Analysis and
Applications, Vol.7, pp.151-163, 2004.
[46] C. M. Bishop, Neural Networks for Pattern Recognition:
Oxford University Press, UK, 1995.
[47] B. Achermann and H. Bunke, "Combination of
Classifiers on the Decision Level for Face
Recognition,"Insitut fur Informatik und angewandte
Mathematik, Universitat Bern, Bern, Germany,Technical
Report IAM-96-002 January 1996.
[48] A. S. Tolba and A. N. Abu-Rezq, "Combined Classifier
for Invariant Face Recognition," PatternAnalysis and
Applications, Vol.3, pp.289-302, 2000.
[49] Y. H. Wan, S. M. Ji, Y. Xie, X. Zhang, and P. J. Xie,
"Video program clustering indexing based on face
recognition hybrid model of hidden Markov model and
support vector machine," in Combinatorial Image
Analysis, Proceedings, Vol.3322, Lecture Notes In
Computer Science, 2004, pp.739-749.
[50] K. C. Kwak and W. Pedrycz, "Face recognition: A study
in information fusion using fuzzy integral,"Pattern
Recognition Letters, Vol.26, pp.719-733, 2005.
[51] T. Murofushi and M. Sugeno, "An interpretation of fuzzy
measures and the Choquet integral as an integral with
respect to a fuzzy measure," Fuzzy Sets System, Vol.29,
pp.201-227, 1988.
[52] J. Haddadnia, K. Faez, and M. Ahmadi, "N-Feature
Neural Network Human Face Recognition," Image and
Vision Computing, Vol.22, pp.1071-1082, 2002.
[53] J. Haddadnia, K. Faez, and P. Moallem, "Neural network
based face recognition with moment invariants," in IEEE
International Conference on Image Processing, Vol.1.
Thessaloniki, Greece, 2001,pp.1018-1021.
[54] J. Haddadnia, M. Ahmadi, and K. Faez, "An Efficient
Method for Recognition of Human Face Recognition
Using Higher Order Pseudo Zernike Moment Invariant,"
in The 5th IEEE Int. Conf. on Automatic Face and
Gesture Recognition. Washington, DC, USA, 2002.

5950
IJRITCC | October 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________________