4.6 Article

Deterministic multikernel extreme learning machine with fuzzy feature extraction for pattern classification

Journal

MULTIMEDIA TOOLS AND APPLICATIONS
Volume 80, Issue 21-23, Pages 32423-32447

Publisher

SPRINGER
DOI: 10.1007/s11042-021-11097-3

Keywords

Pattern classification; ELM; KELM; MKL; Deterministic learning; Fuzzy feature extraction

Ask authors/readers for more resources

A novel multikernel deterministic extreme learning machine (ELM) and its variants are developed in this paper for classification of non-linear problems. By analytically calculating parameters and utilizing data fusion proficiency of multiple kernel learning, a deterministic solution with high face recognition success rate is achieved.
In this paper a novel multikernel deterministic extreme learning machine (ELM) and its variants are developed for classification of non-linear problems. Over a decade ELM is proved to be efficacious learning algorithms, but due to the non-deterministic and single kernel dependent feature mapping proprietary, it cannot be efficiently applied to real time classification problems that require invariant output solution. We address this problem by analytically calculation of input and hidden layer parameters for achieving the deterministic solution and exploiting the data fusion proficiency of multiple kernel learning. This investigation originates a novel deterministic ELM with single layer architecture in which kernel function is aggregation of linear combination of disparate base kernels. The weight of kernels depends upon perspicacity of problem and is empirically calculated. To further enhance the performance we utilize the capabilities of fuzzy set to find the pixel-wise coalition of face images with different classes. This handles the uncertainty involved in face recognition under varying environment condition. The pixel-wise membership value extracts the unseen information from images up to significant extent. The validity of the proposed approach is tested extensively on diverse set of face databases: databases with and without illumination variations and discrete types of kernels. The proposed algorithms achieve 100% recognition rate for Yale database, when seven and eight images per identity are considered for training. Also, the superior recognition rate is achieved for AT & T, Georgia Tech and AR databases, when compared with contemporary methods that prove the efficacy of proposed approaches in uncontrolled conditions significantly.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available