Eigenvector weighting function in face recognition
Summary: Graph-based subspace learning is a class of dimensionality reduction technique in face recognition. The technique reveals the local manifold structure of face data that hidden in the image space via a linear projection. However, the real world face data may be too complex to measure due to both external imaging noises and the intra-class variations of the face images. Hence, features which are extracted by the graph-based technique could be noisy. An appropriate weight should be imposed to the data features for better data discrimination. In this paper, a piecewise weighting function, known as Eigenvector Weighting Function (EWF), is proposed and implemented in two graph based subspace learning techniques, namely Locality Preserving Projection and Neighbourhood Preserving Embedding. Specifically, the computed projection subspace of the learning approach is decomposed into three partitions: a subspace due to intra-class variations, an intrinsic face subspace, and a subspace which is attributed to imaging noises. Projected data features are weighted differently in these subspaces to emphasize the intrinsic face subspace while penalizing the other two subspaces. Experiments on FERET and FRGC databases are conducted to show the promising performance of the proposed technique.
- Face recognition using classification-based linear projections
- Supervised orthogonal discriminant subspace projects learning for face recognition
- scientific article; zbMATH DE number 5669909
- Adaptively weighted 2DPCA based on local feature for face recognition
- Supervised regularization locality-preserving projection method for face recognition
This page was built for publication: Eigenvector weighting function in face recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q541338)
