The Comparison of Laplacianfaces QR Decomposition and Linear Discriminant Analysis QR Decomposition Algorithm for Face Recognition System on Orthogonal Subspace
DOI:
https://doi.org/10.11113/jt.v71.3612Keywords:
Laplacianfaces, Linear Discriminant Analysis, QR decomposition, dimension reduction, classificationAbstract
Development of an optimal face recognition system will greatly depend on the characteristics of the selection process are as a basis to pattern recognition. In the characteristic selection process, there are 2 aspects that will be of mutual influence such the reduction of the amount of data used in the classification aspects and increasing discrimination ability aspects. Linear Discriminat Analysis method helps presenting the global structure while Laplacianfaces method is one method that is based on appearance (appearance-based method) in face recognition, in which the local manifold structure presented in the adjacency graph mapped from the training data points. Linear Discriminant Analysis QR decomposition has a computationally low cost because it has small dimensions so that the efficiency and scalability are very high when compared with algorithms of other Linear Discriminant Analysis methods. Laplacianfaces QR decomposition was a algorithm to obtain highly speed and accuracy, and tiny space to keep data on the face recognition. This algorithm consists of 2 stages. The first stage maximizes the distance of between-class scatter matrices by using QR decomposition and the second stage to minimize the distance of within-class scatter matrices. Therefore, it is obtained an optimal discriminant in the data. In this research, classification using the Euclidean distance method. In these experiments using face databases of the Olivetti-Att-ORL, Bern and Yale. The minimum error was achieved with the Laplacianfaces QR decomposition and Linear Discriminant Analysis QR decomposition are 5.88% and 9.08% respectively.Â
References
Jieping Ye and Qi Li. 2005. A Two-Stage Linear Discriminant Analysis via QR-Decomposition. IEEE Transaction on Pattern Analysis and Machine Intelligence. 27(6): 929–941
P. N. Belhumemour, J. P. Hespanha, and D. J. Kreigman. 1990. Eigenfaces vs. Fisherfaces: Recognation Using Specific Linear Projection. IEEE Trans. Pattern Analysis and Machine Intelligence. 19(7): 711–720.
Fukunaga. Introduction to Statistical Pattern Classification. San Diego, California.
Shakhnarovich and Moghaddam. 2004. Face Recognation in Subspaces, Handbook of Face Recognation. Spriger-Verlag
Turk, M. and Pentlant, A. 1991. Face Recognition Using Eigenfaces. Proc. IEEE Conf. of Computer Vision and Pattern Recognition. 586–591
Lindsay, I. Smith. 2002. A Tutorial on Principal Component Analysis.
S. Balakrishnama, A. Ganapathiraju, Linear Discriminant Analysis–A Breif Tutorial. Institute for Signal and Information Processing.
Howard Anton. 2000. Elementary Linear Algebra. 7thEdition. John Wiley & Sons Inc., New York.
Shapira, L. G., and Stockman, G. C. 2001. Computer Vision. Prentice Hall, Upper Saddle River.
Rully, S. 2004. Sistem Pengenalan Wajah dengan Penerapan Algoritma Genetika pada Optimasi Basis Eigenface dan Proyeksi Fisherface. Master Theses of Computer Science, Universitas Indonesia.
Purbandini. 2006. Sistem Pengenalan Wajah pada Subruang Orthogonal dengan Menggunakan Laplacianfaces Terdekomposisi QR, Master Theses of Informatics Engineering, Institut Teknologi Sepuluh Nopember Surabaya Indonesia.
Xiaofei He, Shuicheng Yan, Yuxiao Hu, Partha N and Hong-Jiang Z. 2005. Face Recognation Using Laplacianfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, Col. 27(3): 328–340.
Tao Xioing, Jieping Ye, Qi Li, Vladimir, C. and Ravi, J. 2004. Efficient Kernel Discriminant Analysis via QR Decomposition. NIPS.
Xiaofei He and Partha N. 2000. Locality Preserving Projections (LPP). University of Chicago.
Haesun Park, Barry L. Drake, Sangmin Lee, Cheong Hee Park. 2007. Fast Linear Discriminant Analysis using QR Decomposition and Regularization. Georgia Institute of Technology.
Jianqiang Gao, Liya Fan, Lizhong Xu. 2012. Solving the Face Recognition Problem Using QR Factorization. WSEAS Transactions On Mathematics. 8(11): 712–721.
Yale Center for Computational Vision and Control. 2006. Yale Face Database. http://cvc.yale.edu/ projects/yalefaces/yalefaces.html.
University of Bern, Bern, Switzerland. 2006. University of Bern Face Database. ftp://iamftp.unibe.ch/pub/Images/FaceImages/.
Research Center of Att, UK, Olivetti–Att–ORL Face Database, http://www.uk.research.att.com/ facedatabase.html.
Downloads
Published
Issue
Section
License
Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.
