Robust discriminative nonnegative patch alignment for occluded face recognition

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Face occlusion is one of the most challenging problems for robust face recognition. Nonnegative matrix factorization (NMF) has been widely used in local feature extraction for computer vision. However, standard NMF is not robust to occlusion. In this paper, we propose a robust discriminative representation learning method under nonnegative patch alignment, which can take account of the geometric structure and discriminative information simultaneously. Specifically, we utilize linear reconstruction coefficients to characterize local geometric structure and maximize the pair wise fisher distance to improve the separability of different classes. The reconstruction errors are measured with weighted distance, and the weights for each pixel are learned adaptively with our proposed update rule. Experimental results on two benchmark datasets demonstrate the learned representation is more discriminative and robust than most of the existing methods in occluded face recognition.

Cite

CITATION STYLE

APA

Ou, W., Li, G., Yu, S., Xie, G., Ren, F., & Tang, Y. (2015). Robust discriminative nonnegative patch alignment for occluded face recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9492, pp. 207–215). Springer Verlag. https://doi.org/10.1007/978-3-319-26561-2_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free