Loading [MathJax]/extensions/MathMenu.js
Wen-Sheng Chen - IEEE Xplore Author Profile

Showing 1-11 of 11 results

Filter Results

Show

Results

Low-Rank Representation (LRR) is an effective self-expressiveness method, which uses the observed data itself as the dictionary to reconstruct the original data. LRR focuses on representing the global low-dimensional information, but ignores the real fact that data often resides on low-dimensional manifolds embedded in a high-dimensional data. Therefore, LRR can not capture the non-linear geometri...Show More
Linear discriminant analysis (LDA) is one of the commonly used statistical methods for feature extraction in face recognition tasks. However, LDA often suffers from the small sample size (3S) problem, which occurs when the total number of training data is smaller than the dimension of input feature space. To deal with 3S problem, this paper proposes a novel approach for LDA-based face recognition ...Show More
This paper proposes a novel methodology on Mercer kernel construction using interpolatory strategy. Based on a given symmetric and positive semi-definite matrix (Gram matrix) and Cholesky decomposition, it first constructs a nonlinear mapping Φ, which is well-defined on the training data. This mapping is then extended to the whole input feature space by utilizing Lagrange interpolatory basis funct...Show More
This paper addresses incremental learning and time-consuming problems in non-negative matrix factorization (NMF) of face recognition. When the training samples or classes are incremental, almost all existing NMF based methods must implement repetitive learning. Also, they are usually very time-consuming. To overcome these limitations, we proposed a novel constraint block NMF (CBNMF) method, which ...Show More
Kernel Discriminant Analysis (KDA) has been shown to be one of the promising approaches to handle the pose and illumination problem in face recognition. However, empirical results show that the performance for KDA on face recognition is sensitive to the kernel function and its parameters. Instead of following existing KDA methods in selecting popular kernel function, this paper proposes a new appr...Show More
This paper addresses nonlinear feature extraction and small sample size (S3) problems in face recognition. In sample feature space, the distribution of face images is nonlinear because of complex variations in pose, illumination and face expression. The performance of classical linear method, such as Fisher discriminant analysis (FDA), will degrade. To overcome pose and illumination problems, Shan...Show More
This paper addresses two problems in linear discriminant analysis (LDA) of face recognition. The first one is the problem of recognition of human faces under pose and illumination variations. It is well known that the distribution of face images with different pose, illumination, and face expression is complex and nonlinear. The traditional linear methods, such as LDA, will not give a satisfactory...Show More
This paper addresses two LDA problems in face recognition. The first one is small sample size (S3) problem while the second is illumination and pose variations. To overcome the S3 problem, this paper proposes a new method in subspace approach in determining the optimal projection for LDA. Also, an in-depth investigation is conducted on the influence of different illuminations and poses variations....Show More
This work addresses the problem of selection of kernel parameters in kernel fisher discriminant for face recognition. We propose a new criterion and derive a new formation in optimizing the parameters in RBF kernel based on the gradient descent algorithm. The proposed formulation is further integrated into a subspace LDA algorithm and a new face recognition algorithm is developed. FERET database i...Show More
Many face recognition algorithms/systems have been developed in the last decade and excellent performances are also reported when there is sufficient number of representative training samples. In many real-life applications, only one training sample is available. Under this situation, the performance of existing algorithms will be degraded dramatically or the formulation is incorrect, which in tur...Show More
Addresses the problem of facial feature point detection under different lighting conditions. Our goal is to develop an efficient detection algorithm, which is suitable for practical applications. The problems that we need to overcome include (1) high detection accuracy, (2) low computational time and (3) nonlinear illumination. An algorithm is developed and reported in the paper. One of the key fa...Show More