Watermelon Ripeness Detection via Extreme Learning Machine with Kernel Principal Component Analysis Based on Acoustic Signals

Author(s):  
Yinghao Zhang ◽  
Xiaoyan Deng ◽  
Zhou Xu ◽  
Peipei Yuan

Many investigations have proved that the acoustics method is intuitive and effective for determining watermelon ripeness. The objective of this work is to drive a new robust acoustics classification scheme KPCA-ELM, which is based on the kernel principal component analysis (KPCA) and extreme learning machine (ELM). Acoustic signals are sampled by a microphone from unripe, ripe and over-ripe watermelon samples, which are randomly divided into two sample sets for training and testing. A set of basic signals is first obtained via KPCA of the training sample. Thus, any given signal can be represented as a linear combination of basis signals, and the coefficients of linear combination are extracted as the features of a signal. Corresponding to the unripe, ripe and over-ripe watermelons, a three-class ELM identification model is constructed based on the training data. The scheme presented in this paper is tested with the testing sample and an accuracy of 92% is achieved. To further evaluate the scheme performance, a comparison of ELM and SVM is conducted in terms of the classification results. The results reveal that the proposed scheme can classify faster than SVM, while ELM is better than SVM in accuracy.

Author(s):  
Bacha Sawssen ◽  
Taouali Okba ◽  
Liouane Noureeddine

The new corona virus 2019 (COVID-19) has become the most pressing issue facing mankind. Like a wildfire burning through the world, the COVID-19 disease has changed the global landscape in only one year. In this mini-review, a novel image classifier based on Kernel Extreme Learning Machine (KELM) and Kernel Principal Component Analysis (KPCA) is presented. The proposed algorithm called KELM-KPCA, aims to detect COVID-19 disease in chest radiographs, using a constrained dataset.


2013 ◽  
Vol 347-350 ◽  
pp. 2390-2394
Author(s):  
Xiao Fang Liu ◽  
Chun Yang

Nonlinear feature extraction used standard Kernel Principal Component Analysis (KPCA) method has large memories and high computational complexity in large datasets. A Greedy Kernel Principal Component Analysis (GKPCA) method is applied to reduce training data and deal with the nonlinear feature extraction problem for training data of large data in classification. First, a subset, which approximates to the original training data, is selected from the full training data using the greedy technique of the GKPCA method. Then, the feature extraction model is trained by the subset instead of the full training data. Finally, FCM algorithm classifies feature extraction data of the GKPCA, KPCA and PCA methods, respectively. The simulation results indicate that the feature extraction performance of both the GKPCA, and KPCA methods outperform the PCA method. In addition of retaining the performance of the KPCA method, the GKPCA method reduces computational complexity due to the reduced training set in classification.


Sign in / Sign up

Export Citation Format

Share Document