Conference Paper

Face Recognition via Two Dimensional Locality Preserving Projection in Frequency Domain

DOI: 10.1016/j.neucom.2011.08.045 Conference: Life System Modeling and Intelligent Computing - International Conference on Life System Modeling and Simulation, LSMS 2010, and International Conference on Intelligent Computing for Sustainable Energy and Environment, ICSEE 2010, Wuxi, China, September 17-20, 2010. Proceedings, Part III
Source: DBLP


In this paper we propose a new face recognition method based on two-dimensional locality preserving projections (2DLPP) in frequency domain. For this purpose, we first introduce the two-dimensional locality preserving projections. Then the 2DLPP in frequency domain is proposed for face recognition. In fact, two dimensional discrete cosine transform (2DDCT) is used as a pre-processing step and it transforms the face image signals from spatial domain into frequency domain aiming to reduce the effects of illumination and pose changes in face recognition. Then 2DLPP is applied on the upper left corner blocks of the 2DDCT transformed matrices, which represent main energy of each original image. For demonstration, the Olivetti Research Laboratory (ORL), YALE, FERET and YALE-B face datasets are used to compare the proposed approach with the conventional 2DLPP and 2DDCT approaches with the nearest neighborhood (NN) classifier. The experimental results show that the proposed 2DLPP in frequency domain is superior over the 2DLPP in spatial domain and 2DDCT itself in frequency domain.

22 Reads
  • Source
    • "Many researchers make efforts to improve LPP from different perspectives. Discriminant Locality Preserving Projections (DLPP) [12] [13] [14] is deemed as one of the most successful extension of LPP. It improves the discriminating power of LPP via simultaneously maximizing the distance between each two nearby classes and minimizing the original LPP objective. "
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a novel Discriminant Locality Preserving Projections (DLPP) algorithm named {Collaborative Discriminant Locality Preserving Projection (CDLPP). In our algorithm, the discriminating power of DLPP are further exploited from two aspects. On the one hand, the global optimum of class scattering is guaranteed via using the between-class scatter matrix to replace the original denominator of DLPP. On the other hand, motivated by the sparse representation and collaborative representation, a $L_2$-norm constraint is imposed to the projections to discover the collaborations of dimensions in the sample space. We apply our algorithm to face recognition. Three popular face databases, namely AR, ORL and LFW-a, are employed for evaluating the performance of CDLPP. Extensive experimental results demonstrate that CDLPP significantly improve the discriminating power of DLPP and outperform the state-of-the-arts.
  • [Show abstract] [Hide abstract]
    ABSTRACT: We have developed a near-real-time computer system that can locate and track a subject's head, and then recognize the person by comparing characteristics of the face to those of known individuals. The computational approach taken in this system is motivated by both physiology and information theory, as well as by the practical requirements of near-real-time performance and accuracy. Our approach treats the face recognition problem as an intrinsically two-dimensional (2-D) recognition problem rather than requiring recovery of three-dimensional geometry, taking advantage of the fact that faces are normally upright and thus may be described by a small set of 2-D characteristic views. The system functions by projecting face images onto a feature space that spans the significant variations among known face images. The significant features are known as "eigenfaces," because they are the eigenvectors (principal components) of the set of faces; they do not necessarily correspond to features such as eyes, ears, and noses. The projection operation characterizes an individual face by a weighted sum of the eigenface features, and so to recognize a particular face it is necessary only to compare these weights to those of known individuals. Some particular advantages of our approach are that it provides for the ability to learn and later recognize new faces in an unsupervised manner, and that it is easy to implement using a neural network architecture.
    Journal of Cognitive Neuroscience 01/1991; 3(1):71-86. DOI:10.1162/jocn.1991.3.1.71 · 4.09 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Maximum Scatter Difference (MSD) aims to preserve discriminant information of sample space, but it fails to find the essential structure of the samples with nonlinear distribution. To overcome this problem, an efficient feature extraction method named as Locality Preserving Maximum Scatter Difference (LPMSD) projection is proposed in this paper. The new algorithm is developed based on locality preserved embedding and MSD criterion. Thus, the proposed LPMSD not only preserves discriminant information of sample space but also captures the intrinsic submanifold of sample space. Experimental results on ORL, Yale and CAS-PEAL face database indicate that the LPMSD method outperforms the MSD, MMSD and LDA methods under various experimental conditions.
    09/2013; 411-414:1179-1184. DOI:10.4028/
Show more

Similar Publications