scholarly journals Local Non Zero Eigen Value Preservation Based Expression Recognition

2020 ◽  
Vol 8 (6) ◽  
pp. 3823-3832

This work proposes an finest mapping from features space to inherited space using kernel locality non zero eigen values protecting Fisher discriminant analysis subspace approach. This approach is designed by cascading analytical and non-inherited face texture features. Both Gabor magnitude feature vector (GMFV) and phase feature vector (GPFV) are independently accessed. Feature fusion is carried out by cascading geometrical distance feature vector (GDFV) with Gabor magnitude and phase vectors. Feature fusion dataset space is converted into short dimensional inherited space by kernel locality protecting Fisher discriminant analysis method and projected space is normalized by suitable normalization technique to prevent dissimilarity between scores. Final scores of projected domains are fused using greatest fusion rule. Expressions are classified using Euclidean distance matching and support vector machine radial basis function kernel classifier. An experimental outcome emphasizes that the proposed approach is efficient for dimension reduction, competent recognition and classification. Performance of proposed approach is deliberated in comparison with connected subspace approaches. The finest average recognition rate achieves 97.61% for JAFFE and 81.48% YALE database respectively.

2015 ◽  
Vol 2015 ◽  
pp. 1-12
Author(s):  
Tom Diethe

A sparse version of Kernel Fisher Discriminant Analysis using an approach based on Matching Pursuit (MPKFDA) has been shown to be competitive with Kernel Fisher Discriminant Analysis and the Support Vector Machines on publicly available datasets, with additional experiments showing that MPKFDA on average outperforms these algorithms in extremely high dimensional settings. In (nearly) all cases, the resulting classifier was sparser than the Support Vector Machine. Natural questions that arise are what is the relative importance of the use of the Fisher criterion for selecting bases and the deflation step? Can we speed the algorithm up without degrading performance? Here we analyse the algorithm in more detail, providing alternatives to the optimisation criterion and the deflation procedure of the algorithm, and also propose a stagewise version. We demonstrate empirically that these alternatives can provide considerable improvements in the computational complexity, whilst maintaining the performance of the original algorithm (and in some cases improving it).


2011 ◽  
Vol 71-78 ◽  
pp. 4211-4214
Author(s):  
Ping Hua Huang ◽  
Jian Sheng Chen

Based on the theory of Fisher discriminant analysis, this paper aims to develop the Fisher discriminant function model by using the representative water inrush data from the floor of coal mining face, considering comprehensively the factors that affect the water inrush from coal floor. The predicted result is consistent with the actual situation, which corresponds with or better than that of the least squares support vector machine, artificial neural network, and so on. The results indicate that this model is a new effective way of predicting the water inrush from floor and can be widely used in the practical engineering because of the low resubstitution error rate and good distinguishing performance.


Sign in / Sign up

Export Citation Format

Share Document