scholarly journals Improving Human Motion Classification by Applying Bagging and Symmetry to PCA-Based Features

Symmetry ◽  
2019 ◽  
Vol 11 (10) ◽  
pp. 1264 ◽  
Author(s):  
Tomasz Hachaj
Keyword(s):  
Nearest Neighbor ◽  
Recognition Rate ◽  
Principal Component ◽  
Human Motion ◽  
Support Vector ◽  
Human Observer ◽  
Weak Classifier ◽  
Motion Classification ◽  
Observer Motion ◽  
Human Motion Classification

This paper proposes a method for improving human motion classification by applying bagging and symmetry to Principal Component Analysis (PCA)-based features. In contrast to well-known bagging algorithms such as random forest, the proposed method recalculates the motion features for each “weak classifier” (it does not randomly sample a feature set). The proposed classification method was evaluated on a challenging (even to a human observer) motion capture recording dataset of martial arts techniques performed by professional karate sportspeople. The dataset consisted of 360 recordings in 12 motion classes. Because some classes of these motions might be symmetrical (which means that they are performed with a dominant left or right hand/leg), an analysis was conducted to determine whether accounting for symmetry could improve the recognition rate of a classifier. The experimental results show that applying the proposed classifiers’ bagging procedure increased the recognition rate (RR) of the Nearest-Neighbor (NNg) and Support Vector Machine (SVM) classifiers by more than 5% and 3%, respectively. The RR of one trained classifier (SVM) was higher when we did not use symmetry. On the other hand, the application of symmetry information for bagged NNg improved its recognition rate compared with the results without symmetry information. We can conclude that symmetry information might be helpful in situations in which it is not possible to optimize the decision borders of the classifier (for example, when we do not have direct information about class labels). The experiment presented in this paper shows that, in this case, bagging and mirroring might help find a similar object in the training set that shares the same class label. Both the dataset that was used for the evaluation and the implementation of the proposed method can be downloaded, so the experiment is easily reproducible.

Decision Fusion Gait Recognition Based on Bayesian Rule and Support Vector Machine

2013 ◽  
Vol 411-414 ◽  
pp. 1287-1290 ◽  
Author(s):  
Hong Zheng ◽  
Kai Zhang
Keyword(s):  
Support Vector Machine ◽  
Nearest Neighbor ◽  
Recognition Performance ◽  
National Laboratory ◽  
Gait Recognition ◽  
Recognition Rate ◽  
Principal Component ◽  
Decision Fusion ◽  
Support Vector ◽  
Correct Recognition Rate

To distinguish people’s identities, the information is normally included in one gait periodic sequence image. First, the gait energy image for feature extraction of wavelet moments was constructed. After boundary unwrapping, the gait silhouette boundary was extracted and principal component analysis (PCA) was use to obtain its compressed contour features. Then nearest neighbor classifier and support vector machines were applied for classification of these two features. Finally, support vector machine (SVM) on Bayesian rule were used to complete gait recognition with information fusion of different features. The method is evaluated on the National Laboratory of Pattern Recognition (NLPR) gait database and the correct recognition rate is relatively high. The experimental results show that the proposed method has good recognition performance.

IMPROVEMENT OF THE PERFORMANCE OF FINGERPRINT VERIFICATION USING A COMBINATORIAL APPROACH

2018 ◽  
Vol 30 (03) ◽  
pp. 1850019
Author(s):  
Fatemeh Alimardani ◽  
Reza Boostani
Keyword(s):  
Nearest Neighbor ◽  
State Of The Art ◽  
Recognition Rate ◽  
Acceptance Rate ◽  
Feature Reduction ◽  
Support Vector ◽  
Fingerprint Verification ◽  
Linear Discriminant ◽  
Comparative Results ◽  
Verification Systems

Fingerprint verification systems have attracted much attention in secure organizations; however, conventional methods still suffer from unconvincing recognition rate for noisy fingerprint images. To design a robust verification system, in this paper, wavelet and contourlet transforms (CTS) were suggested as efficient feature extraction techniques to elicit a coverall set of descriptive features to characterize fingerprint images. Contourlet coefficients capture the smooth contours of fingerprints while wavelet coefficients reveal its rough details. Due to the high dimensionality of the elicited features, across group variance (AGV), greedy overall relevancy (GOR) and Davis–Bouldin fast feature reduction (DB-FFR) methods were adopted to remove the redundant features. These features were applied to three different classifiers including Boosting Direct Linear Discriminant Analysis (BDLDA), Support Vector Machine (SVM) and Modified Nearest Neighbor (MNN). The proposed method along with state-of-the-art methods were evaluated, over the FVC2004 dataset, in terms of genuine acceptance rate (GAR), false acceptance rate (FAR) and equal error rate (EER). The features selected by AGV were the most significant ones and provided 95.12% GAR. Applying the selected features, by the GOR method, to the modified nearest neighbor, resulted in average EER of [Formula: see text]%, which outperformed the compared methods. The comparative results imply the statistical superiority ([Formula: see text]) of the proposed approach compared to the counterparts.

scholarly journals Discrimination between Alternative Herbal Medicines from Different Categories with the Electronic Nose

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2936 ◽  
Author(s):  
Xianghao Zhan ◽  
Xiaoqing Guan ◽  
Rumeng Wu ◽  
Zhan Wang ◽  
You Wang ◽  
...  
Keyword(s):  
Herbal Medicine ◽  
Electronic Nose ◽  
Nearest Neighbor ◽  
Herbal Medicines ◽  
Principal Component ◽  
Support Vector ◽  
Linear Discriminant ◽  
Convenient Means ◽  
Electronic Nose System ◽  
Insight Into

As alternative herbal medicine gains soar in popularity around the world, it is necessary to apply a fast and convenient means for classifying and evaluating herbal medicines. In this work, an electronic nose system with seven classification algorithms is used to discriminate between 12 categories of herbal medicines. The results show that these herbal medicines can be successfully classified, with support vector machine (SVM) and linear discriminant analysis (LDA) outperforming other algorithms in terms of accuracy. When principal component analysis (PCA) is used to lower the number of dimensions, the time cost for classification can be reduced while the data is visualized. Afterwards, conformal predictions based on 1NN (1-Nearest Neighbor) and 3NN (3-Nearest Neighbor) (CP-1NN and CP-3NN) are introduced. CP-1NN and CP-3NN provide additional, yet significant and reliable, information by giving the confidence and credibility associated with each prediction without sacrificing of accuracy. This research provides insight into the construction of a herbal medicine flavor library and gives methods and reference for future works.

Recognition of 3D Objects from 2D Views Features

2015 ◽  
Vol 13 (2) ◽  
pp. 50-58
Author(s):  
R. Khadim ◽  
R. El Ayachi ◽  
Mohamed Fakir
Keyword(s):  
Neural Network ◽  
Support Vector Machine ◽  
Nearest Neighbor ◽  
Color Image ◽  
Recognition Rate ◽  
Experimental Results ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
3D Objects ◽  
Color Descriptor

This paper focuses on the recognition of 3D objects using 2D attributes. In order to increase the recognition rate, the present an hybridization of three approaches to calculate the attributes of color image, this hybridization based on the combination of Zernike moments, Gist descriptors and color descriptor (statistical moments). In the classification phase, three methods are adopted: Neural Network (NN), Support Vector Machine (SVM), and k-nearest neighbor (KNN). The database COIL-100 is used in the experimental results.

scholarly journals Parameters Optimization and Application of SVM Based on PCA-Particle Swarm Algorithm

2019 ◽  
pp. 325-330 ◽  
Author(s):  
Qingmi Yang
Keyword(s):  
Parameter Optimization ◽  
Recognition Accuracy ◽  
Recognition Rate ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Principal Component ◽  
Pso Algorithm ◽  
Parameters Optimization ◽  
Support Vector ◽  
Particle Swarm Algorithm

The parameter optimization of Support Vector Machine (SVM) has been a hot research direction. To improve the optimization rate and classification performance of SVM, the Principal Component Analysis (PCA) - Particle Swarm Optimization (PSO) algorithm was used to optimize the penalty parameters and kernel parameters of SVM. PSO which is to find the optimal solution through continuous iteration combined with PCA that eliminates linear redundancy between data, effectively enhance the generalization ability of the model, reduce the optimization time of parameters, and improve the recognition accuracy. The simulation comparison experiments on 6 UCI datasets illustrate that the excellent performance of the PCA-PSO-SVM model. The results show that the proposed algorithm has higher recognition accuracy and better recognition rate than simple PSO algorithm in the parameter optimization of SVM. It is an effective parameter optimization method.

Sign in / Sign up

Export Citation Format

Share Document