Face recognition using kernel direct discriminant analysis algorithms

  title={Face recognition using kernel direct discriminant analysis algorithms},
  author={Juwei Lu and Konstantinos N. Plataniotis and Anastasios N. Venetsanopoulos},
  journal={IEEE transactions on neural networks},
  volume={14 1},
Techniques that can introduce low-dimensional feature representation with enhanced discriminatory power is of paramount importance in face recognition (FR) systems. It is well known that the distribution of face images, under a perceivable variation in viewpoint, illumination or facial expression, is highly nonlinear and complex. It is, therefore, not surprising that linear techniques, such as those based on principle component analysis (PCA) or linear discriminant analysis (LDA), cannot… 

Figures and Tables from this paper

Discriminant learning for face recognition

In this research, pattern recognition methods are integrated with emerging machine learning approaches, such as kernel and boosting methods, in an attempt to overcome the technical limitations of existing FR methods.

Regularized D-LDA for face recognition

A new regularized discriminant analysis method is proposed that effectively solves the so-called "small sample size" problem in very high-dimensional face image space and outperforms traditional methods such as eigenfaces, QDA and direct LDA in a number of application scenarios.

Kernel-based improved discriminant analysis and its application to face recognition

This paper presents a variant of KDA called kernel-based improved discriminant analysis (KIDA), which can effectively deal with the small sample size problem and experiments show that the proposed method is superior to the traditional KDA and LDA.

Kernel machine-based one-parameter regularized Fisher discriminant method for face recognition

A new kernel machine-based one-parameter regularized Fisher discriminant technique based on the conjugate gradient method for face recognition that gives superior results compared with the existing LDA-based methods.

Class-Specific Kernel-Discriminant Analysis for Face Verification

Novel nonlinear subspace methods for face verification that outperform other commonly used kernel approaches such as kernel-PCA, kernel direct discriminant analysis, and other two-class and multiclass variants of kernel-discriminant analysis based on Fisher's criterion are proposed.

Face classification based on Shannon wavelet kernel and modified Fisher criterion

Shannon wavelet kernel based subspace Fisher discriminant (SWK-SFD) method is developed and not only overcomes some drawbacks of existing FDA based algorithms, but also has good computational complexity.

Multiple Data-Dependent Kernel Fisher Discriminant Analysis for Face Recognition

To improve the performance of KFDA in face recognition, a novel algorithm named multiple data-dependent kernel Fisher discriminant analysis (MDKFDA) is proposed in this paper and experimental results on the three face databases validate the effectiveness of the proposed algorithm.

Kernel-based Subspace Analysis for Face Recognition

It appears that face recognition may be robust to facial expression changes, and thus applicable, and the transformation of kernel-based discriminant analysis has a beneficial effect on the classification performance.

Subspace Methods for Face Recognition: Singularity, Regularization, and Robustness

Face recognition has been an important issue in computer vision and pattern recognition over the last several decades (Zhao et al., 2003). While human can recognize faces easily, automated face

Weighted Piecewise LDA for Solving the Small Sample Size Problem in Face Verification

A novel algorithm that can be used to boost the performance of face-verification methods that utilize Fisher's criterion is presented and evaluated and Experimental results indicate that the proposed framework greatly improves the face- Verification performance.



Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection

A face recognition algorithm which is insensitive to large variation in lighting direction and facial expression is developed, based on Fisher's linear discriminant and produces well separated classes in a low-dimensional subspace, even under severe variations in lighting and facial expressions.

Face recognition with radial basis function (RBF) neural networks

A novel paradigm is proposed whereby data information is encapsulated in determining the structure and initial parameters of the RBF neural classifier before learning takes place, and the dimension of the search space is drastically reduced in the gradient paradigm.

A direct LDA algorithm for high-dimensional data - with application to face recognition

Dynamic Vision - From Images to Face Recognition

Many of the issues raised are relevant to object recognition in general, and such visual learning machines have numerous potential applications in areas such as visual surveillance multimedia and visually mediated interaction.

Human Face Recognition and the Face Image Set's Topology

A scale-space matching technique that allows it to take advantage of knowledge about important geometrical transformations and about the topology of the face subregion in image space to be applicable to a large variety of object recognition tasks.

Face recognition: a convolutional neural-network approach

A hybrid neural-network for human face recognition which compares favourably with other methods and analyzes the computational complexity and discusses how new classes could be added to the trained recognizer.

Human and machine recognition of faces: a survey

A critical survey of existing literature on human and machine recognition of faces is presented, followed by a brief overview of the literature on face recognition in the psychophysics community and a detailed overview of move than 20 years of research done in the engineering community.

Automatic recognition and analysis of human faces and facial expressions: a survey

Generalized Discriminant Analysis Using a Kernel Approach

A new method that is close to the support vector machines insofar as the GDA method provides a mapping of the input vectors into high-dimensional feature space to deal with nonlinear discriminant analysis using kernel function operator.