JOURNAL ARTICLE

Face recognition via non-negative sparse low-rank representation classification

Abstract

This paper presents a novel method for robust face recognition, termed non-negative sparse low-rank representation classification (NSLRRC). NSLRRC seeks a sparse, low-rank and non-negative matrix over all training samples. Sparse constraint makes representation vector discriminative, while low-rank matrix will expose the global structures of data. Meanwhile, non-negative representation vectors guarantee that the coefficients are significant and better reflect the dependence among the data. NSLRRC can approximate the test sample and classify it to the correct class on account of the minimal reconstruction residual. Extensive experiments on several public face datasets prove robustness and effectiveness of our method.

Keywords:
Sparse approximation Pattern recognition (psychology) Robustness (evolution) Facial recognition system Discriminative model Artificial intelligence Computer science Rank (graph theory) Sparse matrix Representation (politics) Constraint (computer-aided design) Face (sociological concept) Test data Mathematics Combinatorics

Metrics

2
Cited By
0.17
FWCI (Field Weighted Citation Impact)
28
Refs
0.61
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Face and Expression Recognition
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
Sparse and Compressive Sensing Techniques
Physical Sciences →  Engineering →  Computational Mechanics
Machine Learning and ELM
Physical Sciences →  Computer Science →  Artificial Intelligence
© 2026 ScienceGate Book Chapters — All rights reserved.