Learning Locality-Constrained Collaborative Representation for Face Recognition
Xi Peng, Lei Zhang, Zhang Yi, Kok Kiong Tan

TL;DR
This paper introduces LCCR, a novel face recognition method that integrates manifold learning and sparse representation by enforcing local consistency, leading to improved robustness and discrimination in face recognition tasks.
Contribution
The paper proposes a new coding algorithm, LCCR, which combines local geometric structure with collaborative representation, offering an analytical solution without local minima.
Findings
LCCR outperforms existing methods on multiple facial databases.
LCCR demonstrates robustness against occlusions and illumination variations.
LCCR achieves higher recognition accuracy in diverse conditions.
Abstract
The model of low-dimensional manifold and sparse representation are two well-known concise models that suggest each data can be described by a few characteristics. Manifold learning is usually investigated for dimension reduction by preserving some expected local geometric structures from the original space to a low-dimensional one. The structures are generally determined by using pairwise distance, e.g., Euclidean distance. Alternatively, sparse representation denotes a data point as a linear combination of the points from the same subspace. In practical applications, however, the nearby points in terms of pairwise distance may not belong to the same subspace, and vice versa. Consequently, it is interesting and important to explore how to get a better representation by integrating these two models together. To this end, this paper proposes a novel coding algorithm, called…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
