We propose a novel manifold learning approach, called Neighborhood Discriminant Projection (NDP), for robust face recognition. The purpose of NDP is to preserve the within-class neighboring geometry of the image space, while keeping away the projected vectors of the samples of different classes. For representing the intrinsic within-class neighboring geometry and the similarity of the samples of different classes, the within-class affinity weight and the between-class affinity weight are used to model the within-class submanifold and the between-class submanifold of the samples, respectively. Several experiments on face recog-nition are conducted to demonstrate the effectiveness and robustness of our proposed method. 1
AbstractThe sparse manifold clustering and embedding (SMCE) algorithm can be used to find a low-dime...
Abstract—Conventional appearance-based face recognition methods usually assume that there are multip...
Learning a robust projection with a small number of training samples is still a challenging problem ...
Abstract. In this paper, we propose a new supervised Neighborhood Discriminative Manifold Projection...
In this paper, a discriminative manifold learning method for face recognition is proposed which achi...
2011 18th IEEE International Conference on Image Processing, ICIP 2011, Brussels, 11-14 September 20...
Dimensionality reduction is a crucial step for pattern recognition. Recently, a new kind of dimensio...
In this paper, we propose a novel bilateral 2-D neighborhood preserving discriminant embedding for s...
Manifold learning aims to map the original data from a high-dimensional space into a low-dimensional...
Many natural image sets, depicting objects whose ap-pearance is changing due to motion, pose or ligh...
Linear Discriminant Analysis is optimal under the assumption that the covariance matrices of the con...
Dimensionality reduction is extremely important for understanding the intrinsic structure hidden in ...
Abstract. The locally linear embedding (LLE) algorithm can be used to discover a low-dimensional sub...
Abstract. The locally linear embedding (LLE) algorithm can be used to discover a low-dimensional sub...
Abstract. In this paper we propose a novel non-linear discriminative analysis technique for manifold...
AbstractThe sparse manifold clustering and embedding (SMCE) algorithm can be used to find a low-dime...
Abstract—Conventional appearance-based face recognition methods usually assume that there are multip...
Learning a robust projection with a small number of training samples is still a challenging problem ...
Abstract. In this paper, we propose a new supervised Neighborhood Discriminative Manifold Projection...
In this paper, a discriminative manifold learning method for face recognition is proposed which achi...
2011 18th IEEE International Conference on Image Processing, ICIP 2011, Brussels, 11-14 September 20...
Dimensionality reduction is a crucial step for pattern recognition. Recently, a new kind of dimensio...
In this paper, we propose a novel bilateral 2-D neighborhood preserving discriminant embedding for s...
Manifold learning aims to map the original data from a high-dimensional space into a low-dimensional...
Many natural image sets, depicting objects whose ap-pearance is changing due to motion, pose or ligh...
Linear Discriminant Analysis is optimal under the assumption that the covariance matrices of the con...
Dimensionality reduction is extremely important for understanding the intrinsic structure hidden in ...
Abstract. The locally linear embedding (LLE) algorithm can be used to discover a low-dimensional sub...
Abstract. The locally linear embedding (LLE) algorithm can be used to discover a low-dimensional sub...
Abstract. In this paper we propose a novel non-linear discriminative analysis technique for manifold...
AbstractThe sparse manifold clustering and embedding (SMCE) algorithm can be used to find a low-dime...
Abstract—Conventional appearance-based face recognition methods usually assume that there are multip...
Learning a robust projection with a small number of training samples is still a challenging problem ...