13,830 research outputs found
Human gesture classification by brute-force machine learning for exergaming in physiotherapy
In this paper, a novel approach for human gesture classification on skeletal data is proposed for the application of exergaming in physiotherapy. Unlike existing methods, we propose to use a general classifier like Random Forests to recognize dynamic gestures. The temporal dimension is handled afterwards by majority voting in a sliding window over the consecutive predictions of the classifier. The gestures can have partially similar postures, such that the classifier will decide on the dissimilar postures. This brute-force classification strategy is permitted, because dynamic human gestures show sufficient dissimilar postures. Online continuous human gesture recognition can classify dynamic gestures in an early stage, which is a crucial advantage when controlling a game by automatic gesture recognition. Also, ground truth can be easily obtained, since all postures in a gesture get the same label, without any discretization into consecutive postures. This way, new gestures can be easily added, which is advantageous in adaptive game development. We evaluate our strategy by a leave-one-subject-out cross-validation on a self-captured stealth game gesture dataset and the publicly available Microsoft Research Cambridge-12 Kinect (MSRC-12) dataset. On the first dataset we achieve an excellent accuracy rate of 96.72%. Furthermore, we show that Random Forests perform better than Support Vector Machines. On the second dataset we achieve an accuracy rate of 98.37%, which is on average 3.57% better then existing methods
Multi-Person Brain Activity Recognition via Comprehensive EEG Signal Analysis
An electroencephalography (EEG) based brain activity recognition is a
fundamental field of study for a number of significant applications such as
intention prediction, appliance control, and neurological disease diagnosis in
smart home and smart healthcare domains. Existing techniques mostly focus on
binary brain activity recognition for a single person, which limits their
deployment in wider and complex practical scenarios. Therefore, multi-person
and multi-class brain activity recognition has obtained popularity recently.
Another challenge faced by brain activity recognition is the low recognition
accuracy due to the massive noises and the low signal-to-noise ratio in EEG
signals. Moreover, the feature engineering in EEG processing is time-consuming
and highly re- lies on the expert experience. In this paper, we attempt to
solve the above challenges by proposing an approach which has better EEG
interpretation ability via raw Electroencephalography (EEG) signal analysis for
multi-person and multi-class brain activity recognition. Specifically, we
analyze inter-class and inter-person EEG signal characteristics, based on which
to capture the discrepancy of inter-class EEG data. Then, we adopt an
Autoencoder layer to automatically refine the raw EEG signals by eliminating
various artifacts. We evaluate our approach on both a public and a local EEG
datasets and conduct extensive experiments to explore the effect of several
factors (such as normalization methods, training data size, and Autoencoder
hidden neuron size) on the recognition results. The experimental results show
that our approach achieves a high accuracy comparing to competitive
state-of-the-art methods, indicating its potential in promoting future research
on multi-person EEG recognition.Comment: 10 page
Computer-aided diagnosis of lung nodule using gradient tree boosting and Bayesian optimization
We aimed to evaluate computer-aided diagnosis (CADx) system for lung nodule
classification focusing on (i) usefulness of gradient tree boosting (XGBoost)
and (ii) effectiveness of parameter optimization using Bayesian optimization
(Tree Parzen Estimator, TPE) and random search. 99 lung nodules (62 lung
cancers and 37 benign lung nodules) were included from public databases of CT
images. A variant of local binary pattern was used for calculating feature
vectors. Support vector machine (SVM) or XGBoost was trained using the feature
vectors and their labels. TPE or random search was used for parameter
optimization of SVM and XGBoost. Leave-one-out cross-validation was used for
optimizing and evaluating the performance of our CADx system. Performance was
evaluated using area under the curve (AUC) of receiver operating characteristic
analysis. AUC was calculated 10 times, and its average was obtained. The best
averaged AUC of SVM and XGBoost were 0.850 and 0.896, respectively; both were
obtained using TPE. XGBoost was generally superior to SVM. Optimal parameters
for achieving high AUC were obtained with fewer numbers of trials when using
TPE, compared with random search. In conclusion, XGBoost was better than SVM
for classifying lung nodules. TPE was more efficient than random search for
parameter optimization.Comment: 29 pages, 4 figure
The pharmacophore kernel for virtual screening with support vector machines
We introduce a family of positive definite kernels specifically optimized for
the manipulation of 3D structures of molecules with kernel methods. The kernels
are based on the comparison of the three-points pharmacophores present in the
3D structures of molecul es, a set of molecular features known to be
particularly relevant for virtual screening applications. We present a
computationally demanding exact implementation of these kernels, as well as
fast approximations related to the classical fingerprint-based approa ches.
Experimental results suggest that this new approach outperforms
state-of-the-art algorithms based on the 2D structure of mol ecules for the
detection of inhibitors of several drug targets
Parsing Argumentation Structures in Persuasive Essays
In this article, we present a novel approach for parsing argumentation
structures. We identify argument components using sequence labeling at the
token level and apply a new joint model for detecting argumentation structures.
The proposed model globally optimizes argument component types and
argumentative relations using integer linear programming. We show that our
model considerably improves the performance of base classifiers and
significantly outperforms challenging heuristic baselines. Moreover, we
introduce a novel corpus of persuasive essays annotated with argumentation
structures. We show that our annotation scheme and annotation guidelines
successfully guide human annotators to substantial agreement. This corpus and
the annotation guidelines are freely available for ensuring reproducibility and
to encourage future research in computational argumentation.Comment: Under review in Computational Linguistics. First submission: 26
October 2015. Revised submission: 15 July 201
- …