Spatially smooth subspace face recognition using LOG and DOG penalties

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

Abstract

Subspace face recognition methods have been widely investigated in the last few decades. Since the pixels of an image are spatially correlated and facial images are generally considered to be spatially smoothing, several spatially smooth subspace methods have been proposed for face recognition. In this paper, we first survey the progress and problems in current spatially smooth subspace face recognition methods. Using the penalized subspace learning framework, we then proposed two novel penalty functions, Laplacian of Gaussian (LOG) and Derivative of Gaussian (DOG), for subspace face recognition. LOG and DOG penalties introduce a scale parameter, and thus are more flexible in controlling the degree of smoothness. Experimental results indicate that the proposed methods are effective for face recognition, and achieve higher recognition accuracy than the original subspace methods. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zuo, W., Liu, L., Wang, K., & Zhang, D. (2009). Spatially smooth subspace face recognition using LOG and DOG penalties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5553 LNCS, pp. 439–448). https://doi.org/10.1007/978-3-642-01513-7_48

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