A generalized Foley-Sammon transform based on generalized fisher discriminant criterion and its application to face recognition

Authors:
Yue-Fei Guo;Shi-Jin Li;Jing-Yu Yang;Ting-Ting Shu;Li-De Wu
Affiliations:
Department of Computer Science, Information System Integration Lab., Fudan University, Shanghai 200433, China;Department of Computer, HoHai University, Nanjing 210098, China;Department of Computer, NUST, Nanjing 210094, China;Department of Computer, NUST, Nanjing 210094, China;Department of Computer Science, Information System Integration Lab., Fudan University, Shanghai 200433, China
Venue:
Pattern Recognition Letters
Year:
2003

Citing 4
Cited 22

Optimal discriminant plane for a small number of samples and design method of classifier on the plane

Pattern Recognition
Algebraic feature extraction of image for recognition

Pattern Recognition
Optimal Fisher discriminant analysis using the rank decomposition

Pattern Recognition
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection

IEEE Transactions on Pattern Analysis and Machine Intelligence

Learning a Mahalanobis distance metric for data clustering and classification

Pattern Recognition
Mechanic signal analysis based on the Haar-type orthogonal matrix

Expert Systems with Applications: An International Journal
Neighborhood MinMax projections

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Trace ratio problem revisited

IEEE Transactions on Neural Networks
Kernel Generalized Foley-Sammon Transform with Cluster-Weighted

ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
A general kernelization framework for learning algorithms based on kernel PCA

Neurocomputing
Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data

Pattern Recognition
Locality preserving discriminant projections for face and palmprint recognition

Neurocomputing
Uncorrelated trace ratio linear discriminant analysis for undersampled problems

Pattern Recognition Letters
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis

SIAM Journal on Matrix Analysis and Applications
Maximum Margin Multisurface Support Tensor Machines with application to image classification and segmentation

Expert Systems with Applications: An International Journal
Graph optimization for dimensionality reduction with sparsity constraints

Pattern Recognition
Fast Kernel Discriminant Analysis for Classification of Liver Cancer Mass Spectra

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Trace Ratio Optimization Problem for Dimensionality Reduction

SIAM Journal on Matrix Analysis and Applications
Simultaneous model-based clustering and visualization in the Fisher discriminative subspace

Statistics and Computing
Generalized foley-sammon transform with kernels

ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
Robust linearly optimized discriminant analysis

Neurocomputing
Trace ratio criterion based generalized discriminative learning for semi-supervised dimensionality reduction

Pattern Recognition
Football video segmentation based on video production strategy

ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
Incremental complete LDA for face recognition

Pattern Recognition
Probabilistic Fisher discriminant analysis: A robust and flexible alternative to Fisher discriminant analysis

Neurocomputing
Constrained large Margin Local Projection algorithms and extensions for multimodal dimensionality reduction

Pattern Recognition

Quantified Score

Hi-index	0.10

Visualization

Abstract

As the generalization of Fisher discriminant criterion, in this paper, the conception of the generalized Fisher discriminant criterion is presented. On the basis of the generalized Fisher discriminant criterion, the generalized Foley-Sammon transform (GFST) is proposed. The main difference between the GFST and the Foley-Sammon transform (FST) is that the sample set has the minimum within-class scatter and the maximum between-class scatter in the subspace spanned by all discriminant vectors constituting GFST while the sample set has these properties only on the one-dimensional subspace spanned by each discriminant vector constituting FST, that is, the transformed sample set by GFST has the best discriminant ability in global sense while FST has this property only in part sense. To calculate the GFST, an iterative algorithm is proposed, which is proven to Converge to the precise solution. The speed and errors of the iterative procedure are also analyzed in detail. Lastly, our method is applied to facial image recognition, and the experimental results show that present method is superior to the existing methods in terms of correct classification rate.