Mahalanobis Distance Based Non-negative Sparse Representation for Face Recognition

Authors:
Yangfeng Ji;Tong Lin;Hongbin Zha
Affiliations:
-;-;-
Venue:
ICMLA '09 Proceedings of the 2009 International Conference on Machine Learning and Applications
Year:
2009

Citing 0
Cited 3

SEMD based sparse gabor representation for eyeglasses-face recognition

ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part II
Using genetic algorithm for classification in face recognition

ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
A hybrid approach combining extreme learning machine and sparse representation for image classification

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sparse representation for machine learning has been exploited in past years. Several sparse representation based classification algorithms have been developed for some applications, for example, face recognition. In this paper, we propose an improved sparse representation based classification algorithm. Firstly, for a discriminative representation, a non-negative constraint of sparse coefficient is added to sparse representation problem. Secondly, Mahalanobis distance is employed instead of Euclidean distance to measure the similarity between original data and reconstructed data. The proposed classification algorithm for face recognition has been evaluated under varying illumination and pose using standard face databases. The experimental results demonstrate that the performance of our algorithm is better than that of the up-to-date face recognition algorithm based on sparse representation.