Combining linear dimensionality reduction and locality preserving projections with feature selection for recognition tasks

Authors:
Fadi Dornaika;Ammar Assoum;Alireza Bosaghzadeh
Affiliations:
University of the Basque Country, San Sebastian, Spain and IKERBASQUE, Basque Foundation for Science, Bilbao, Spain;LaMA Laboratory, Lebanese University, Tripoli, Lebanon;University of the Basque Country, San Sebastian, Spain
Venue:
ACIVS'11 Proceedings of the 13th international conference on Advanced concepts for intelligent vision systems
Year:
2011

Citing 13
Cited 0

Genetic algorithms: A Survey

Computer
Unsupervised Feature Selection Using Feature Similarity

IEEE Transactions on Pattern Analysis and Machine Intelligence
Laplacian Eigenmaps for dimensionality reduction and data representation

Neural Computation
An introduction to variable and feature selection

The Journal of Machine Learning Research
Face Recognition Using Laplacianfaces

IEEE Transactions on Pattern Analysis and Machine Intelligence
Toward Integrating Feature Selection Algorithms for Classification and Clustering

IEEE Transactions on Knowledge and Data Engineering
Where Are Linear Feature Extraction Methods Applicable?

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction

IEEE Transactions on Pattern Analysis and Machine Intelligence
Eigenfaces for recognition

Journal of Cognitive Neuroscience
Top 10 algorithms in data mining

Knowledge and Information Systems
Feature selection with dynamic mutual information

Pattern Recognition
Face recognition using discriminant locality preserving projections

Image and Vision Computing
Graph-optimized locality preserving projections

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, a graph-based method was proposed for Linear Dimensionality Reduction (LDR). It is based on Locality Preserving Projections (LPP). It has been successfully applied in many practical problems such as face recognition. In order to solve the Small Size Problem that usually affects face recognition, LPP is preceded by a Principal Component Analysis (PCA). This paper has two main contributions. First, we propose a recognition scheme based on the concatenation of the features provided by PCA and LPP. We show that this concatenation can improve the recognition performance. Second, we propose a feasible approach to the problem of selecting the best features in this mapped space. We have tested our proposed framework on several public benchmark data sets. Experiments on ORL, UMIST, PF01, and YALE Face Databases and MNIST Handwritten Digit Database show significant performance improvements in recognition.