DLDA/QR: A robust direct LDA algorithm for face recognition and its theoretical foundation

Abstract

Feature extraction is one of the hot topics in face recognition. However, many face extraction methods will suffer from the "small sample size" problem, such as Linear Discriminant Analysis (LDA). Direct Linear Discriminant Analysis (DLDA) is an effective method to address this problem. But conventional DLDA algorithm is often computationally expensive and not scalable. In this paper, DLDA is analyzed from a new viewpoint via QR decomposition and an efficient and robust method named DLDA/QR algorithm is proposed. The proposed algorithm achieves high efficiency by introducing the QR decomposition on a small-size matrix, while keeping competitive classification accuracy. Experimental results on ORL face database demonstrate the effectiveness of the proposed method. © Springer-Verlag Berlin Heidelberg 2007.