Abstract

Recently, a graph-based method was proposed for Linear Dimensionality Reduction (LDR). It is based on Locality Preserving (LPP). LPP is a typical linear graph-based dimensionality reduction (DR) method that has been successfully applied in many practical problems such as face recognition. LPP is essentially a linearized version of Laplacian Eigenmaps. When dealing with face recognition problems, LPP is preceded by a Principal Component Analysis (PCA) step in order to avoid possible singularities. Both PCA and LPP are computed by solving an eigen decomposition problem. In this paper, we propose a novel approach called Selective Locality Preserving Projections that performs an eigenvector selection associated with LPP. Consequently, the problem of dimension estimation for LPP is solved. Moreover, we propose a selective approach that performs eigenvector selection for the case where the mapped samples are formed by concatenating the output of PCA and LPP. We have tested our proposed approaches on several public face data sets. Experiments on ORL, UMIST, and YALE Face Databases show significant performance improvements in recognition over the classical LPP. The proposed approach lends itself nicely to many biometric applications.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.