Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
507
= E[( x m )( x m ) t ] = w + b
p
PCA
denote a linear
n p transformation matrix that maps the original n
dimensional space onto a p dimensional feature subspace
where p < n . The new feature vectors y i p are defined
by:
p
y i = ( PCA
) t x i i = 1,2,...N
J 1 = tr ( w 1 b )
(1)
J 2 = ln b = ln b ln w
(9)
J 3 = tr ( b ) [ tr ( w ) c ]
(10)
J 4 = tr ( b ) tr (
(11)
)( x i m
) t ) /( N 1)
= ( ( x i m
(8)
1
w
p
PCA
are the
(7)
(2)
i =1
m k = m k 1 + ( x k m k 1 )
(3)
k = k 1 + k (x k x tk k 1 )
symmetric w
w1 2 w1 2 =
(4)
(12)
where = w LDA .
12
learning rate.
III. PROPOSED FACE RECOGNITION METHOD
i=1
i=1
b = P ( i )(m i m )(m i m ) t
(6)
i =1
508
B. Dimensionality Reduction
As mentioned in the previous section, we cropped every
input image to 4040 image; as a result the input of this stage
is a preprocessed 16001 vector. We used these vectors to
estimate the covariance matrix [14]. After estimation of the
covariance matrix, significant eigenvectors of the covariance
matrix are computer.
509
510
V. CONCLUDING REMARKS
In this paper, a new Face recognition method is presented.
The new method was considered as a combination of PCA,
LDA and neural networks. We used these algorithms to
construct efficient face recognition method with a high
recognition rate. Proposed method consists of four parts: i)
image preprocessing that includes histogram equalization,
normalization and mean centering, ii) dimension reduction
using PCA that main features that are important for
representing face images are extracted iii) feature extraction
using LDA that significant features for class separability are
selected and iv) neural network classifier that classify input
face images into one of available classes. Simulation results
using YALE face datasets demonstrated the ability of the
proposed method for optimal feature extraction and efficient
face classification. In our simulations, we chose 10 persons
and considered 40 training image and 20 test image for each
person (totally 400 training and 200 test face images).
Experimental results show a high recognition rate equal to
99.5% (in average one misclassification for each 200 face
images) which demonstrated an improvement in comparison
with previous methods. The new face recognition algorithm
can be used in many applications such as security methods.
511
[10] M. Er, S. Wu, J. Lu, L.H.Toh, "face recognition with radial basis
function(RBF) neural networks", IEEE Trans. Neural Networks, Vol.
13, No. 3, pp. 697-710.
[11] K. Lee, Y. Chung, H. Byun, "SVM based face verification with feature
set of small size", electronic letters, Vol. 38, No. 15, PP. 787-789, 2002.
[12] A. M. Martinez, A. C. Kak, PCA versus LDA, IEEE Trans. Pattern
Anal. Machine Intell, Vol. 23, pp. 228-233. 2004.
[13] J.J. Weng, using discriminant eigenfeatures for image retrieval,
IEEE Trans. Pattern Anal. Machine Intell. , Vol. 18, No. 8, pp. 831-836,
1996.
[14] K. Fukunaga, Introduction to Statistical Pattern Recognition, 2nd
Edition, Academic Press, New York, 1990.
[15] S. Pang, S. Ozawa, N. Kasabov, Incremental linear discriminant
analysis for classification of data streams, IEEE Trans. on Systems,
Man and Cybernetics, vol. 35, no. 5, pp. 905-914, 2005.
[16] M.J.Er, W.Chen, S.Wu, High speed face recognition based on discrete
cosine transform and RBF neural network, IEEE Trans. On Neural
Network, Vol. 16, No. 3, PP. 679,691, 2005.
[17] D. Ramaeubramanian, y. Venkatesh, Encoding and recognition of
Faces based on human visual model and DCT, Pattern recognition, Vol.
34, PP. 2447-2458, 2001.
[18] X. Y. Jing, D. Zhang, A face and palm print recognition approach
based on discriminant DCT feature extraction, IEEE trans. on Sys. Man
& Cyb., Vol. 34, No. 6, PP. 2405-2415, 2004.
[19] Z. Pan, A. G. Rust, H. Bolouri,, Image redundancy reduction for neural
network classification using discrete cosine transform, Proc. Int. Conf.
on Neural Network, Vol. 3, PP. 149,154, Italy, 2000.
[20] S. Zhao, R. R. Grigat, Multi block fusion scheme for face recognition,
Int. Con. on Pattern recognition (ICPR), Vol. 1, pp. 309-312, 2004.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
TABLE I
COMPARISON OF RECOGNITION RATE BY CHOOSING DIFFERENT NUMBER OF PCA AND LDA FEATURES
4 LDA features
5 LDA features
6 LDA features
7 LDA features
8 LDA features
9 LDA features
20 PCA features
77%
84%
87.5
87.5%
92%
94.5
40 PCA features
81%
86%
89.5%
90%
93.5%
96.5%
60 PCA features
85%
90.5%
93%
93%
95%
98%
80 PCA features
87.5
92%
94.5
96
98.5%
99%
100 PCA
features
88.5%
92.5%
95%
97%
99.5%
99.5%
TABLE II
COMPARISON OF RECOGNITION RATE OF THE PROPOSED METHOD WITH THE AVAILABLE PREVIOUS METHODS
Recognition Rate
DCT+LDA+RB
Ref. [16] - 2005
DCT+LDA+Short
Dist (Euclidean )Ref. [18] - 2004
PCA+LDA+
Short Dist
(Euclidean )
Ref. [4,6] -1997
Proposed
Method
98.1
97.7
84.5
94.8
84
99.5
512