This Article 
 Bibliographic References 
 Add to: 
Discriminative Common Vectors for Face Recognition
January 2005 (vol. 27 no. 1)
pp. 4-13
In face recognition tasks, the dimension of the sample space is typically larger than the number of the samples in the training set. As a consequence, the within-class scatter matrix is singular and the Linear Discriminant Analysis (LDA) method cannot be applied directly. This problem is known as the "small sample size” problem. In this paper, we propose a new face recognition method called the Discriminative Common Vector method based on a variation of Fisher's Linear Discriminant Analysis for the small sample size case. Two different algorithms are given to extract the discriminative common vectors representing each person in the training set of the face database. One algorithm uses the within-class scatter matrix of the samples in the training set while the other uses the subspace methods and the Gram-Schmidt orthogonalization procedure to obtain the discriminative common vectors. Then, the discriminative common vectors are used for classification of new faces. The proposed method yields an optimal solution for maximizing the modified Fisher's Linear Discriminant criterion given in the paper. Our test results show that the Discriminative Common Vector method is superior to other methods in terms of recognition accuracy, efficiency, and numerical stability.

[1] R. Chellappa, C.L. Wilson, and S. Sirohey, “Human and Machine Recognition of Faces: A Survey,” Proc. IEEE, vol. 83, pp. 705-740, May 1995.
[2] W. Zhao, R. Chellappa, and A Krishnaswamy, “Discriminant Analysis of Principal Components for Face Recognition,” Proc. Third IEEE Int'l Conf. Automatic Face and Gesture Recognition, pp. 336-341, Apr. 1998.
[3] W. Zhao, R. Chellappa, A. Rosenfeld, and P.J. Phillips, “Face Recognition: A Literature Survey,” Technical Report CAR-TR-948, Univ. of Maryland, College Park, 2000.
[4] M. Turk, “A Random Walk Through Eigenspace,” IEICE Trans. Information & Systems, vol. E84-D, no. 12, pp. 1586-1695, Dec. 2001.
[5] M. Turk and A.P. Pentland, “Eigenfaces for Recognition,” J. Cognitive Neuroscience, vol. 3, no. 1, pp. 71-86, 1991.
[6] P.N Belhumeur, J.P. Hespanha, and D.J. Kriegman, “Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 7, pp. 711-720, July 1997.
[7] D.L. Swets and J. Weng, “Using Discriminant Eigenfeatures for Image Retrieval,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 8, pp. 831-836, Aug. 1996.
[8] K. Fukunaga, Introduction to Statistical Pattern Recognition, second ed. New York: Academic Press, pp. 31-34, 39-40, 220-221, 1990.
[9] Q. Tian, M. Barbero, Z.H. Gu, and S.H. Lee, “Image Classification by the Foley-Sammon Transform,” Optical Eng., vol. 25, no. 7, pp. 834-840, 1986.
[10] Z.-Q. Hong and J.-Y. Yang, “Optimal Discriminant Plane for a Small Number of Samples and Design Method of Classifier on the Plane,” Pattern Recognition, vol. 24, pp. 317-324, 1991.
[11] Y.Q. Cheng, Y.M. Zhuang, and J.Y. Yang, “Optimal Fisher Discriminate Analysis Using the Rank Decomposition,” Pattern Recognition, vol. 25, pp. 101-111, 1992.
[12] H. Yu and J. Yang, “A Direct LDA Algorithm for High-Dimensional Data with Application to Face Recognition,” Pattern Recognition, vol. 34, pp. 2067-2070, 2001.
[13] Y. Bing, J. Lianfu, and C. Ping, “A New LDA-Based Method for Face Recognition,” Proc. 16th Int'l Conf. Pattern Recognition, vol. 1, pp. 168-171, Aug. 2002.
[14] D.-Q. Dai and P.C. Yuen, “Regularized Discriminant Analysis and Its Application to Face Recognition,” Pattern Recognition, vol. 36, pp. 845-847, 2003.
[15] R. Huang, Q. Liu, H. Lu, and S. Ma, “Solving the Small Size Problem of LDA,” Proc. 16th Int'l Conf. Pattern Recognition, vol. 3, pp. 29-32, Aug. 2002.
[16] J. Yang, D. Zhang, and J.-Y. Yang, “A Generalised K-L Expansion Method Which Can Deal with Small Sample Size and High-Dimensional Problems,” Pattern Analysis & Applications, vol. 6, pp. 47-54, Apr. 2003.
[17] L.-F. Chen, H.-Y.M. Liao, M.-T. Ko, J.-C. Lin, and G.-J. Yu, “A New LDA-Based Face Recognition System Which Can Solve the Small Sample Size Problem,” Pattern Recognition, vol. 33, pp. 1713-1726, 2000.
[18] K. Liu, Y.-Q. Cheng, and J.-Y. Yang, “A Generalized Optimal Set of Discriminant Vectors,” Pattern Recognition, vol. 25, no. 7, pp. 731-739, 1992.
[19] M.B. Gulmezoglu, V. Dzhafarov, M. Keskin, and A. Barkana, “A Novel Approach to Isolated Word Recognition,” IEEE Trans. Speech and Audio Processing, vol. 7, no. 6, Nov. 1999.
[20] M.B. Gulmezoglu, V. Dzhafarov, and A. Barkana, “The Common Vector Approach and Its Relation to Principal Component Analysis,” IEEE Trans. Speech and Audio Processing, vol. 9, no. 6, Sept. 2001.
[21] E. Oja, Subspace Methods of Pattern Recognition. Letchworth, U.K.: Research Studies Press, pp. 13-14, 1983.
[22] A.M. Martinez and R. Benavente, “The AR Face Database,” CVC Technical Report #24, Computer Vision Center (CVC), Barcelona, Spain, 1998.
[23] J. Lu, K.N. Plataniotis, and A.N. Venetsanopoulos, “Face Recognition Using LDA-Based Algorithms,” IEEE Trans. Neural Networks, vol. 14, pp. 195-200, Jan. 2003.
[24] A. Webb, Statistical Pattern Recognition. New York: Oxford Univ. Press, 1999.
[25] Y. Adini, Y. Moses, and S. Ullman, “Face Recognition: The Problem of Compensating for Changes in Illumination Direction,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 7, pp. 721-732, July 1997.
[26] A.M. Martinez and A.C. Kak, “PCA versus LDA,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 2, pp. 228-233, Feb. 2001.

Index Terms:
Common vectors, discriminative common vectors, face recognition, Fisher's linear discriminant analysis, principal component analysis, small sample size, subspace methods.
Hakan Cevikalp, Marian Neamtu, Mitch Wilkes, Atalay Barkana, "Discriminative Common Vectors for Face Recognition," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 1, pp. 4-13, Jan. 2005, doi:10.1109/TPAMI.2005.9
Usage of this product signifies your acceptance of the Terms of Use.