Abstract

Abstract There are many different types of batting motions in table tennis, and the accurate identification of these motion patterns is of great importance for the analysis of batting motions. In this paper, firstly, we explore the efficient representation of the batting motion in the time domain by reasonably placing the sensors and processing the collected data with respect to the characteristics of the batting motion. Secondly, based on the SVM algorithm, in real-world applications, the issue of creating complicated hypersurfaces is resolved using the kernel function technique., so that the simple hypersurfaces in the original space can achieve satisfactory classification results. Finally, a table tennis batting action recognition algorithm based on the SVM algorithm is calculated. The algorithm can efficiently extract the features of batting actions in temporal order and finally accomplishes an average recognition correctness of 93.58%, which is 4.155% more accurate than decision trees, 5.255% more accurate than random forests, and 3.305% more accurate than integrated classifiers. The best performance among the four classifiers indicates that the model has the best performance. This study demonstrates that the SVM algorithm model can quickly and effectively classify and identify action signals for the batting action during table tennis training.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call