Feature Extraction and Data Analysis of Basketball Motion Postures: Acquisition with an Inertial Sensor

2021 ◽  
Author(s):  
Zhuqing Li
Keyword(s):  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Inertial Sensors ◽  
Inertial Sensor ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Basketball Players ◽  
Posture Analysis ◽  
Sport Training ◽  
Mean Variance

Abstract This paper mainly analyzed the application of inertial sensors in basketball posture analysis. The data of 20 basketball players in different postures were collected by MEMS inertial sensors. The mean, variance, and skewness were taken as features to compare the performance of C4.5, random forest (RF), k-nearest neighbor (KNN), and support vector machine (SVM) algorithms in analyzing posture data. It was found that the classification accuracy of the KNN algorithm was around 90%, and the classification accuracy of C4.5, RF, and SVM algorithms was all above 90%. The classification accuracy of the RF algorithm was the highest (98.72%), which was significantly higher than C4.5 and SVM algorithms. The results verified the advantages of the RF algorithm in basketball posture analysis. The research results confirm the reliability of the inertial sensor in the field of motion posture analysis and make some contributions to its application in sport training. This paper provides support for the analysis of motion posture.

scholarly journals Identifying Fragmented Reading and Evaluating Its Influence on Cognition Based on Single Trial Electroencephalogram

2021 ◽  
Vol 15 ◽  
Author(s):  
Jingwen Feng ◽  
Bo Hu ◽  
Jingting Sun ◽  
Junpeng Zhang ◽  
Wen Wang ◽  
...  
Keyword(s):  
Cognitive Impairment ◽  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Support Vector ◽  
Continuous Performance Task ◽  
Single Trial ◽  
K Nearest Neighbor ◽  
Background Condition ◽  
Frequency Bands ◽  
Feature Sets

Background: The use of social media daily could nurture a fragmented reading habit. However, little is known whether fragmented reading (FR) affects cognition and what are the underlying electroencephalogram (EEG) alterations it may lead to.Purpose: This study aimed to identify whether individuals have FR habits based on the single-trial EEG spectral features using machine learning (ML), as well as to find out the potential cognitive impairment induced by FR.Methods: Subjects were recruited through a questionnaire and divided into FR and noFR groups according to the time they spent on FR per day. Moreover, 64-channel EEG was acquired in Continuous Performance Task (CPT) and segmented into 0.5–1.5 s post-stimulus epochs under cue and background conditions. The sample sizes were as follows: FR in cue condition, 692 trials; noFR in cue condition, 688 trials; FR in background condition, 561 trials; noFR in background condition, 585 trials. For these single-trials, the relative power (RP) of six frequency bands [delta (1–3 Hz), theta (4–7 Hz), alpha (8–13 Hz), beta1 (14–20 Hz), beta2 (21–29 Hz), lower gamma (30–40 Hz)] were extracted as features. After feature selection, the most important feature sets were fed into three ML models, namely Support-Vector Machine (SVM), K-Nearest Neighbor (KNN), and Naive Bayes to perform the identification of FR. RP of six frequency bands was also used as feature sets to conduct classification tasks.Results: The classification accuracy reached up to 96.52% in the SVM model under cue conditions. Specifically, among six frequency bands, the most important features were found in alpha and gamma bands. Gamma achieved the highest classification accuracy (86.69% for cue, 86.45% for background). In both conditions, alpha RP in central sites of FR was stronger than noFR (p < 0.001). Gamma RP in the frontal site of FR was weaker than noFR in the background condition (p < 0.001), while alpha RP in parieto-occipital sites of FR was stronger than noFR in the cue condition (p < 0.001).Conclusion: Fragmented reading can be identified based on single-trial EEG evoked by CPT using ML, and the RP of alpha and gamma may reflect the impairment on attention and working memory by FR. FR might lead to cognitive impairment and is worth further exploration.

scholarly journals Common Sport Movement Recognition from Wearable Inertial Sensor

2020 ◽  
Vol 8 (5) ◽  
pp. 1285-1292
Keyword(s):  
Nearest Neighbor ◽  
Inertial Sensor ◽  
Window Size ◽  
Evaluation Process ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Total Energy Consumption ◽  
Movement Recognition ◽  
The Common ◽  
And Performance

Common sport movements are the fundamental movements in all kind of sports. There are lots of researches done on classifying sports movements but very few are focused on common sport movement which is the focus of this project. The main aim is to develop an automated algorithm that can detect the common sport movements into walking based and jumping based movement from the wearable inertial sensor. The inertial sensor signals obtained from ten subjects were processed and grouped into walking-based and jumping-based movements. Time-domain features were extracted from the signals. Finally, the classification and performance evaluation process is done by using three different classification models (Support Vector Machine (SVM), k Nearest Neighbor (k-NN) and Decision Tree) with fixed window size of 1.28 seconds at the first stage. At the second stage, the best model from the first stage was used to determine the best window size in extracting the features that represent the walking and jumping based movement. As a result, SVM algorithm with window size of 2 seconds produced the highest overall accuracy of 95.4 % which proved to be the best classification algorithm to classify the common sport movements into walking-based and jumping-based movements. It is hoped that the outcome from this project can be used as a part of developing the overall automated sport movement recognition which is useful for the analyst, coach or player to analyse the performance of the player as well as predicting total energy consumption in preventing the injury among the player

scholarly journals Block-based cloud classification with statistical features and distribution of local texture features

2015 ◽  
Vol 8 (3) ◽  
pp. 1173-1182 ◽  
Author(s):  
H.-Y. Cheng ◽  
C.-C. Yu
Keyword(s):  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Texture Features ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Local Texture ◽  
Cloud Classification ◽  
Block Based ◽  
Combined Feature ◽  
Neighbor Classifier

Abstract. This work performs cloud classification on all-sky images. To deal with mixed cloud types in one image, we propose performing block division and block-based classification. In addition to classical statistical texture features, the proposed method incorporates local binary pattern, which extracts local texture features in the feature vector. The combined feature can effectively preserve global information as well as more discriminating local texture features of different cloud types. The experimental results have shown that applying the combined feature results in higher classification accuracy compared to using classical statistical texture features. In our experiments, it is also validated that using block-based classification outperforms classification on the entire images. Moreover, we report the classification accuracy using different classifiers including the k-nearest neighbor classifier, Bayesian classifier, and support vector machine.

scholarly journals Classifier Performance Evaluation in Wrist and Finger Movement Fitting Task Based on Forearm HD-sEMG

2021 ◽  
Author(s):  
Haiqiang Duan ◽  
Chenyun Dai ◽  
Wei Chen
Keyword(s):  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Hand Movement ◽  
The Other ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Linear Superposition ◽  
Semg Signal ◽  
Linear Discriminant ◽  
Fitting In

Abstract Background: The transmission of human body movements to other devices through wearable smart bracelets have attracted more and more attentions in the field of human-machine interface (HMI) applications. However, due to the limitation of the collection range of wearable bracelets, it is necessary to study the relationship between the superposition of wrist and finger motion and their cooperative motion to simplify the collection system of the device.Methods: The multi-channel high-density surface electromyogram (HD-sEMG) signal has high spatial resolution and can improve the accuracy of multi-channel fitting. In this study, we quantified the HD-sEMG forearm spatial activation features of 256 channels of hand movement, and performed a linear fitting of the quantified features of fingers and wrist movements to verify the linear superposition relationship between fingers and wrist cooperative movements and their independent movements. The most important thing is to classify and predict the results of the fitting and the actual measured fingers and wrist cooperative actions by four commonly used classifiers: Linear Discriminant Analysis (LDA) ,K-Nearest Neighbor (KNN) ,Support Vector Machine (SVM) and Random Forest (RF), and evaluate the performance of the four classifiers in gesture fitting in detail according to the classification results.Results: In a total of 12 kinds of synthetic gesture actions, in the three cases where the number of fitting channels was selected as 8, 32 and 64, four classifiers of LDA, SVM, RF and KNN are used for classification prediction. When the number of fitting channels was 8, the prediction accuracy of LDA classifier was 99.70%, the classification accuracy of KNN was 99.40%, the classification accuracy of SVM was 99.20%, and the classification accuracy of RF was 93.75%. When the number of fitting channels was 32, the accuracy of LDA was 98.51%, the classification accuracy of KNN was 97.92%, the accuracy of SVM is 96.73%, and the accuracy of RF was 86.61%. When the number of fitting channels is 64, the accuracy of LDA is 95.83%, the classification accuracy of KNN is 91.67%, the accuracy of SVM is 86.90%, and the accuracy of RF is 83.30%.Conclusion: It can be seen from the results that when the number of fitting channels is 8, the classification accuracy of the three classifiers of LDA, KNN and SVM is basically the same, but the time-consuming of SVM is very small. When the amount of data is large, the priority should be selected SVM as the classifier. When the number of fitting channels increases, the classification accuracy of the LDA classifier will be higher than the other three classifiers, so the LDA classifier should be more appropriate. The classification accuracy of the RF classifier in this type of problem has always been far lower than the other three classifiers, so it is not recommended to use the RF classifier as a classifier for gesture stacking related work.

scholarly journals A Hybrid Classification Approach That Combines K-Nearest Neighbor and Helps Vector Machine Will Provide Results That Are Closer to The True Value

2021 ◽  
pp. 572-580
Author(s):  
Rajni Bhalla ◽  
Jyoti
Keyword(s):  
Support Vector Machine ◽  
Classification System ◽  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Classification Model ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Classification Approach ◽  
Knn Classification ◽  
Hybrid Classification

To construct a new text message classifier, this paper combines the K-nearest neighbor (KNN) classification approach with the support vector machine (SVM) training algorithm. The hybrid classification system is built by combining KNN and Support Vector Machine is abbreviated as K-VM. Due to its flexibility and reliability in handling different forms of classification activities, the KNN has been stated as one of the most frequently used classification approaches. The KNN faces a significant challenge in determining the acceptable value for parameter K to ensure good classification efficacy. This is because the value of parameter K has a significant effect on the KNN classifier's accuracy. The KNN is a method of learning that is based on laziness that holds the entire training examples before classification time, in addition to deciding the optimum value of parameter K. As a result, as the value of parameter K increases, the KNN's computational method becomes more intensive. This paper proposes the K-VM hybrid classification system to reduce the impact of parameters on classification accuracy. The Euclidean distance function is used to measure the average distance between the testing data point and each range in SVs in various categories. Experiments on a variety of benchmark datasets show that the K-VM approach outperforms the conventional KNN classification model in classification accuracy.

scholarly journals Evaluation of the Performance for Popular Three Classifiers on Spam Email without using FS methods

2021 ◽  
Vol 16 ◽  
pp. 121-132
Author(s):  
Ghada AL-Rawashdeh ◽  
Rabiei Bin Mamat ◽  
Jawad Hammad Rawashdeh
Keyword(s):  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Feature Selection Method ◽  
Selection Method ◽  
Support Vector ◽  
Svm Classifier ◽  
K Nearest Neighbor ◽  
High Increase ◽  
Simulation Results ◽  
Using Data

Email is one of the most economical and fast communication means in recent years; however, there has been a high increase in the rate of spam emails in recent times due to the increased number of email users. Emails are mainly classified into spam and non-spam categories using data mining classification techniques. This paper provides a description and comparative for the evaluation of effective classifiers using three algorithms - namely k-nearest neighbor, Naive Bayesian, and support vector machine. Seven spam email datasets were used to conducted experiment in the MATLAB environment without using any feature selection method. The simulation results showed SVM classifier to achieve a better classification accuracy compared to the K-NN and NB.

scholarly journals Depression Detection Based on Geometrical Features Extracted from SODP Shape of EEG Signals and Binary PSO

2021 ◽  
Vol 38 (1) ◽  
pp. 13-26
Author(s):  
Hesam Akbari ◽  
Muhammad Tariq Sadiq ◽  
Malih Payan ◽  
Somayeh Saraf Esmaili ◽  
Hourieh Baghri ◽  
...  
Keyword(s):  
Early Diagnosis ◽  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Support Vector ◽  
Binary Particle Swarm Optimization ◽  
K Nearest Neighbor ◽  
Eeg Signals ◽  
Central Tendency Measure ◽  
Time Frequency ◽  
Geometrical Features

Late detection of depression is having detrimental consequences including suicide thus there is a serious need for an accurate computer-aided system for early diagnosis of depression. In this research, we suggested a novel strategy for the diagnosis of depression based on several geometric features derived from the Electroencephalography (EEG) signal shape of the second-order differential plot (SODP). First, various geometrical features of normal and depression EEG signals were derived from SODP including standard descriptors, a summation of the angles between consecutive vectors, a summation of distances to coordinate, a summation of the triangle area using three successive points, a summation of the shortest distance from each point relative to the 45-degree line, a summation of the centroids to centroid distance of successive triangles, central tendency measure and summation of successive vector lengths. Second, Binary Particle Swarm Optimization was utilized for the selection of suitable features. At last, the features were fed to support vector machine and k-nearest neighbor (KNN) classifiers for the identification of normal and depressed signals. The performance of the proposed framework was evaluated by the recorded bipolar EEG signals from 22 normal and 22 depressed subjects. The results provide an average classification accuracy of 98.79% with the KNN classifier using city-block distance in a ten-fold cross-validation strategy. The proposed system is accurate and can be used for the early diagnosis of depression. We showed that the proposed geometrical features are better than extracted features in the time, frequency, time-frequency domains as it helps in visual inspection and provide up to 17.56% improvement in classification accuracy in contrast to those features.

scholarly journals Block based cloud classification with statistical features and distribution of local texture features

2014 ◽  
Vol 7 (11) ◽  
pp. 11771-11798 ◽  
Author(s):  
H.-Y. Cheng ◽  
C.-C. Yu
Keyword(s):  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Texture Features ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Local Texture ◽  
Cloud Classification ◽  
Block Based ◽  
Combined Feature ◽  
Neighbor Classifier

Abstract. This work performs cloud classification on all-sky images. To deal with mixed cloud types in one image, we propose to perform block division and block based classification. In addition to classical statistical texture features, the proposed method incorporates local binary pattern, which extracts local texture features in the feature vector. The combined feature can effectively preserve global information as well as more discriminating local texture features of different cloud types. The experimental results have shown that applying the combined feature results in higher classification accuracy compared to using classical statistical texture features. In our experiments, it is also validated that using block-based classification outperforms classification on the entire images. Moreover, we report the classification accuracy using different classifiers including k-nearest neighbor classifier, Bayesian classifier, and support vector machine in this paper.

A Hybrid Classification Approach Based on Support Vector Machine and K-Nearest Neighbor for Remote Sensing Data

2017 ◽  
Vol 31 (10) ◽  
pp. 1750034 ◽  
Author(s):  
Gulnaz Alimjan ◽  
Tieli Sun ◽  
Hurxida Jumahun ◽  
Yu Guan ◽  
Wanting Zhou ◽  
...  
Keyword(s):  
Remote Sensing ◽  
Classification Accuracy ◽  
Nearest Neighbor ◽  
Remote Sensing Data ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Sensing Data ◽  
Knn Classifier ◽  
Training Samples ◽  
Hybrid Classification

Analysis and classification for remote sensing landscape based on remote sensing imagery is a popular research topic. In this paper, we propose a new remote sensing data classifier by incorporating the support vector machine (SVM) learning information into the K-nearest neighbor (KNN) classifier. The SVM is well known for its extraordinary generalization capability even with limited learning samples, and it is very useful for remote sensing applications as data samples are usually limited. The KNN has been widely used in data classification due to its simplicity and effectiveness. However, the KNN is instance-based and needs to keep all the training samples for classification, which could cause not only high computation complexity but also overfitting problems. Meanwhile, the performance of the KNN classifier is sensitive to the neighborhood size [Formula: see text] and how to select the value of the parameter [Formula: see text] relies heavily on practice and experience. Based on the observations that the SVM can contribute to the KNN on the problems of smaller training samples size as well as the selection of the parameter [Formula: see text], we propose a support vector nearest neighbor (abbreviated as SV-NN) hybrid classification approach which can simplify the parameter selection while maintaining classification accuracy. The proposed approach is consist of two stages. In the first stage, the SVM is performed on the training samples to obtain the reduced support vectors (SVs) for each of the sample categories. In the second stage, a nearest neighbor classifier (NNC) is used to classify a testing sample, i.e. the average Euclidean distance between the testing data point to each set of SVs from different categories is calculated and the NNC identifies the category with minimum distance. To evaluate the effectiveness of the proposed approach, firstly experiments of classification for samples from remote sensing data are evaluated, and then experiments of identifying different land covers regions in the remote sensing images are evaluated. Experimental results show that the SV-NN approach maintains good classification accuracy while reduces the training samples compared with the conventional SVM and KNN classification model.

Optimizing Error Rate in Intrusion Detection System Using Artificial Neural Network Algorithm

2018 ◽  
Vol 6 (9) ◽  
pp. 152
Author(s):  
S. Vijaya Rani ◽  
G. N. K. Suresh Babu
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Intrusion Detection ◽  
Error Rate ◽  
Learning Process ◽  
Nearest Neighbor ◽  
Detection System ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Artificial Neural

The illegal hackers  penetrate the servers and networks of corporate and financial institutions to gain money and extract vital information. The hacking varies from one computing system to many system. They gain access by sending malicious packets in the network through virus, worms, Trojan horses etc. The hackers scan a network through various tools and collect information of network and host. Hence it is very much essential to detect the attacks as they enter into a network. The methods  available for intrusion detection are Naive Bayes, Decision tree, Support Vector Machine, K-Nearest Neighbor, Artificial Neural Networks. A neural network consists of processing units in complex manner and able to store information and make it functional for use. It acts like human brain and takes knowledge from the environment through training and learning process. Many algorithms are available for learning process This work carry out research on analysis of malicious packets and predicting the error rate in detection of injured packets through artificial neural network algorithms.

Sign in / Sign up

Export Citation Format

Share Document