Professional Documents
Culture Documents
s s
+ > < =
l i
i i i
b x x y x f
1
. ) ( (3)
Training a linear SVM means finding the embedding strengths
{i} and offset b such that hyperplane (w, b) separates pos-
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 8 August 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 2558
itive samples from negatives ones with a maximal margin.
Notice that not all input vectors {xi} might be used in the
dual representation of w; those vectors xi that have weight
i > 0 and form w are called support vectors.
C. Non-linear case
In real-life problems it is rarely the case that positive
and negative samples are linearly separable. Non-linear
support vector classifiers map input space X into a feature
space F via a usually non-linear map : X F, x 1
(x) and solve the linear separation problem in the feature
space by finding weights i of the dual expression of the
separating hyperplanes vector w:
s s
=
l i
i i i
x y
1
) ( (4)
While the decision function f (x) takes the form
s s
+ < =
l i
i i i
b x x y x f
1
) ( ). ( ) ( (5)
Usually F is
function K(x, y) that computes thedot product in F , K(x,
y) =< (x) (y) >. The decision function (5) can then be
computed by just using the kernel function and it can also
be shown that finding the maximum margin separating
hyperplane is equivalent to solving the following
optimization problem
(
s s l j i
j i j i j i i
x x K y y
, 1
) , (
2
1
max
(6)
s s
= s s s s
l i
i i i
y l i c
1
0 , 1 , 0
Where positive C is a parameter showing the trade-off
between margin maximization and training error
minimization.The kernel function K avoid working directly
in feature space F. After solving (6), offset b can be chosen
so that the margins between the hyperplane and
(
+ =
s s l i
i i i
b x x k y x f
1
) , ( sgn )) ( sgn(
(7)
The two classes of sample images are equal then have
our decision function Commonly used kernels include
polynomial kernels K(x, y) =(x +y) d and the Gaussian
kernel K(x, y) =exp (||xy||2).This implementation use the
Gaussian kernel, however one of the interesting points for
further research is approaches for choosing an optimal kernel
for the given input data.
V. EXPERIMENTAL RESULTS
In order to demonstrate the effectiveness of SVMs for
object recognition under varying illumination conditions, it
conducted a number of experiments by using the Face
Database. It is known that face recognition under varying
illumination conditions is a very difficult task because
variations due to changes in illumination are usually larger
than those due to changes in face identity [13]. The
performance of generative methods for face recognition [8,
1] implies that the assumption that there is no intersection
among illumination cones is approximately satisfied.
Fig 1.Components-based approach detection and training
Componenet based approach detection and training
presented in figure 1.It represents the features.
D. Face image database
The database consists of images of 10 individuals in 9
poses acquired under 64 different point light sources and an
ambient light: 5850 images in total. The coordinates of the
left eye, right eye, and mouth are appended for images in the
frontal pose, and the coordinate of the face center is
appended for images in other poses. Each image is assigned
to one of 5 subsets according to the angle between the
direction of the light source and the optical axis of a camera.
Fig.2.Illumination images in database for single person 16
illumination Images are there.
Fig.2.shows the different illumination conditions of image
database.
Fig.3.Input Image
Fig.4.Enhanced Image
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 8 August 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 2559
Image Enhancem
Fig 3 and 4 represents input image and enhanced image.
After Image Enhancement, feature extractions are performed
such as Hog, lbp, colour features and Gabor features.
Fig.5.Non overlapping image left side eye
Fig.6.Non overlapping image right side eye
2.Non overlbing image rideside eye.
Fig.7.Non overlapping image left side Nose&Mouth
Fig.8.Non overlapping image right side Nose&mouth
Non overlapping image right and left side eye represent in
figure 5 and 6 and Non overlapping image left and right side
nose and mouth represent in figure 7 and 8.It display the
hog,lbp,color,gabor features.
The table 1 represents the classification using SVM for
identifying the person.
TABLE 1: CLASSIFICATION USING SVM
TABLE 2: CLASSIFICATION USING PLS
Table 2 represents the classification using PLS for identifying
the person.
0
5
10
15
20
Person 1Person 2Person 3Person 4Person 5
I
l
l
u
m
i
n
a
t
i
o
n
Persons
Person 1 Person 2 Person 3 Person 4 Person 5
Person 1 17 0 0 0 0
Person 2 0 17 0 0 0
Person 3 0 0 17 0 0
Person 4 0 0 0 17 0
Person 5 0 0 0 0 17
Person
1
Person
2
Person
3
Person
4
Person
5
Person
1
17 0 1 0 0
Person
2
0 17 0 0 0
Person
3
0 0 15 0 0
Person
4
0 0 0 17 0
Person
5
0 0 1 0 17
International Journal of Computer Trends and Technology (IJCTT) volume 4 Issue 8 August 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page 2560
Fig.9. SVM classification
0
5
10
15
20
Person 1Person 2Person 3Person 4Person 5
I
l
l
u
m
i
n
a
t
i
o
n
Persons
Fig.10.PLS Classification
The classifications chart of SVM and PLS is represented in
figure 9 and 10.It analyse the accuracy performance of SVM
is better than PLS.
97
98
99
PLS SVM
accuracy
Fig.11.Comparison with PLS and SVM
Fig.11 shows the accuracy of SVM and PLS.The
experimental results shows SVM classification is higher than
PLS classification and accuracy of SVM classification is
98.7%.
While comparing SVM with PLS, The table1 shows the
classification of persons. There is no misclassification in
SVM on person identification 3.Table 2 shows there is
misclassification on person identification 3 in PLS, so SVM
has highest accuracy then PLS.
VI. CONCLUSIONS AND FUTURE WORK
This paper discussed the problem of object recognition
under varying illumination conditions, in this paper, an
efficient Support vector machine approach to face
recognition based on wavelet transform is proposed. The
exsisting result shows that the face recognition performance
is relatively unaffected even though there is a transformation
of the face including translation, small rotation and
illumination.The SVM algorithm is used, because it is the
basic and straight forward method for feature extraction. It
provides efficient results and requires less storage.
In the present study, the experiment is conducted by
using face images. However, the proposed method should be
applicable to non-Lambertian objects when illumination
cones of objects are approximated by low dimensional
subspaces.Therefore, the future work plan is to confirm the
effectiveness of SVM method for objects with various
reflectance properties.The future efforts will be on the
recognition of face images in dynamic video sequences and
real time tasks using fuzzy logic.
REFERENCES
[1] R. Basri and D. J acobs, Lambertian reflectance and linear subspaces,
In Proc. IEEE ICCV 2001, pp.383390, 2001.
[2] P. Belhumeur, J . Hespanha, and D. Kriegman, Eigenfaces vs.
Fisherfaces: recognition using class specific linear projection, IEEE
Trans.PAMI, 19(7), pp.711720, 1997.
[3] P. Belhumeur and D. Kriegman, What is theset of images of an object
under all possible lighting conditions?, Intl. J . Computer Vision,
28(3), pp.245260, 1998.
[4] K. Bennett and E. Bredensteiner, Duality and geometry in SVM
classifiers, In Proc. Intl. Conf. Machine Learning (ICML 2000),
pp.6572, 2000.
[5] R. Brunelli and T. Poggio, Face recognition: featuresversus templates,
IEEE Trans. PAMI, 15(10), pp.10421052, 1993.
[6] H. Chen, P. Belhumeur, and D. J acobs, In search of illumination
invariants, In Proc. IEEE CVPR 2000, pp.254261, 2000.
[7] R. Duda, P. Hart, and D. Stork, Pattern Classification, J ohn Wiley
&Sons, New York, 2001.
[8] A. Georghiades, P. Belhumeur, and D. Kriegman, Fromfew to many
illuminations cone models for face recognition under variable lighting
and pose, IEEE Trans. PAMI, 23(6), pp.643660, 2001.
[9] G. Guo, S. Li, and K. Chan, Face recognition by support vector
machines, In Proc. IEEE FG 2000, pp.195201, 2000.
[10] P. Hallinan, A low-dimensional representation of human faces for
arbitrary lighting conditions, In Proc. IEEE CVPR 94, pp.995999,
1994.
[11] B. Heisele, P. Ho, and T. Poggio, Face recognition with support vector
machines: global versus component-based approach, In Proc. IEEE
ICCV 2001, pp.688694, 2001.
[12] Y. Moses, Y. Adini, and S. Ullman, Face recognition: the problemof
compensating for changes in illumination direction, In Proc. ECCV
94, pp.286296, 1994.
[13] H. Murase and S. Nayar, Visual learning and recognition of 3-D
objects fromappearance, Intl. J . Computer Vision, 14(1), pp.524,
1995..
[14] P. Phillips, Support vector machines applied to face recognition,
Advances in Neural Information Processing Systems 11, pp.803809,
1998.
[15] M. Pontil and A. Verri, Support vector machines for 3D object
recognition, IEEE Trans. PAMI, 20(6), pp.637646, 1998.
[16] R. Ramamoorthi and P. Hanrahan, On the relationship between
radiance and irradiance: determining the illumination fromimagesof a
convex Lambertian object, J . Opt. Soc. Am. A, 18(10), pp.2448
2459,2001.
[17] R. Ramamoorthi and P. Hanrahan, A signal-processing framework for
inverse rendering, In Proc. ACM SIGGRAPH 2001, pp.117128,
2001.