Sciweavers

Share
CVPR
2007
IEEE

Learning a Spatially Smooth Subspace for Face Recognition

11 years 1 months ago
Learning a Spatially Smooth Subspace for Face Recognition
Subspace learning based face recognition methods have attracted considerable interests in recently years, including Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Locality Preserving Projection (LPP), Neighborhood Preserving Embedding (NPE), Marginal Fisher Analysis (MFA) and Local Discriminant Embedding (LDE). These methods consider an n1 ? n2 image as a vector in Rn1?n2 and the pixels of each image are considered as independent. While an image represented in the plane is intrinsically a matrix. The pixels spatially close to each other may be correlated. Even though we have n1 ? n2 pixels per image, this spatial correlation suggests the real number of freedom is far less. In this paper, we introduce a regularized subspace learning model using a Laplacian penalty to constrain the coefficients to be spatially smooth. All these existing subspace learning algorithms can fit into this model and produce a spatially smooth subspace which is better for image represen...
Deng Cai, Xiaofei He, Yuxiao Hu, Jiawei Han, Thoma
Added 12 Oct 2009
Updated 12 Oct 2009
Type Conference
Year 2007
Where CVPR
Authors Deng Cai, Xiaofei He, Yuxiao Hu, Jiawei Han, Thomas S. Huang
Comments (0)
books