Evaluating Classifier Confidence for Surface EMG Pattern Recognition
- URL: http://arxiv.org/abs/2304.05898v1
- Date: Wed, 12 Apr 2023 15:05:25 GMT
- Title: Evaluating Classifier Confidence for Surface EMG Pattern Recognition
- Authors: Akira Furui
- Abstract summary: Surface electromyogram (EMG) can be employed as an interface signal for various devices and software via pattern recognition.
The aim of this paper is to identify the types of classifiers that provide higher accuracy and better confidence in EMG pattern recognition.
- Score: 4.56877715768796
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Surface electromyogram (EMG) can be employed as an interface signal for
various devices and software via pattern recognition. In EMG-based pattern
recognition, the classifier should not only be accurate, but also output an
appropriate confidence (i.e., probability of correctness) for its prediction.
If the confidence accurately reflects the likelihood of true correctness, then
it will be useful in various application tasks, such as motion rejection and
online adaptation. The aim of this paper is to identify the types of
classifiers that provide higher accuracy and better confidence in EMG pattern
recognition. We evaluate the performance of various discriminative and
generative classifiers on four EMG datasets, both visually and quantitatively.
The analysis results show that while a discriminative classifier based on a
deep neural network exhibits high accuracy, it outputs a confidence that
differs from true probabilities. By contrast, a scale mixture model-based
classifier, which is a generative classifier that can account for uncertainty
in EMG variance, exhibits superior performance in terms of both accuracy and
confidence.
Related papers
- Towards Robust and Interpretable EMG-based Hand Gesture Recognition using Deep Metric Meta Learning [37.21211404608413]
We propose a shift to deep metric-based meta-learning in EMG PR to supervise the creation of meaningful and interpretable representations.
We derive a robust class proximity-based confidence estimator that leads to a better rejection of incorrect decisions.
arXiv Detail & Related papers (2024-04-17T23:37:50Z) - Training a HyperDimensional Computing Classifier using a Threshold on
its Confidence [0.0]
This article proposes to extend the training procedure in HDC by taking into account not only wrongly classified samples, but also samples that are correctly classified by the HDC model but with low confidence.
The proposed training procedure is tested on UCIHAR, CTG, ISOLET and HAND dataset for which the performance consistently improves compared to the baseline.
arXiv Detail & Related papers (2023-05-30T13:03:54Z) - Explaining Cross-Domain Recognition with Interpretable Deep Classifier [100.63114424262234]
Interpretable Deep (IDC) learns the nearest source samples of a target sample as evidence upon which the classifier makes the decision.
Our IDC leads to a more explainable model with almost no accuracy degradation and effectively calibrates classification for optimum reject options.
arXiv Detail & Related papers (2022-11-15T15:58:56Z) - Word-level confidence estimation for RNN transducers [7.12355127219356]
We present a lightweight neural confidence model tailored for Automatic Speech Recognition (ASR) system with Recurrent Network Transducers (RNN-T)
Compared to other existing approaches, our model utilizes: (a) the time information associated with recognized words, which reduces the computational complexity, and (b) a simple and elegant trick for mapping between sub-word and word sequences.
arXiv Detail & Related papers (2021-09-28T18:38:00Z) - EMG Signal Classification Using Reflection Coefficients and Extreme
Value Machine [2.169919643934826]
We propose to utilize Extreme Value Machine as a high-performance algorithm for the classification of EMG signals.
We employ reflection coefficients obtained from an Autoregressive (AR) model to train a set of classifiers.
arXiv Detail & Related papers (2021-06-19T19:12:59Z) - Visualizing Classifier Adjacency Relations: A Case Study in Speaker
Verification and Voice Anti-Spoofing [72.4445825335561]
We propose a simple method to derive 2D representation from detection scores produced by an arbitrary set of binary classifiers.
Based upon rank correlations, our method facilitates a visual comparison of classifiers with arbitrary scores.
While the approach is fully versatile and can be applied to any detection task, we demonstrate the method using scores produced by automatic speaker verification and voice anti-spoofing systems.
arXiv Detail & Related papers (2021-06-11T13:03:33Z) - Autoencoding Variational Autoencoder [56.05008520271406]
We study the implications of this behaviour on the learned representations and also the consequences of fixing it by introducing a notion of self consistency.
We show that encoders trained with our self-consistency approach lead to representations that are robust (insensitive) to perturbations in the input introduced by adversarial attacks.
arXiv Detail & Related papers (2020-12-07T14:16:14Z) - Certifying Confidence via Randomized Smoothing [151.67113334248464]
Randomized smoothing has been shown to provide good certified-robustness guarantees for high-dimensional classification problems.
Most smoothing methods do not give us any information about the confidence with which the underlying classifier makes a prediction.
We propose a method to generate certified radii for the prediction confidence of the smoothed classifier.
arXiv Detail & Related papers (2020-09-17T04:37:26Z) - Open Set Recognition with Conditional Probabilistic Generative Models [51.40872765917125]
We propose Conditional Probabilistic Generative Models (CPGM) for open set recognition.
CPGM can detect unknown samples but also classify known classes by forcing different latent features to approximate conditional Gaussian distributions.
Experiment results on multiple benchmark datasets reveal that the proposed method significantly outperforms the baselines.
arXiv Detail & Related papers (2020-08-12T06:23:49Z) - Meta-Learned Confidence for Few-shot Learning [60.6086305523402]
A popular transductive inference technique for few-shot metric-based approaches, is to update the prototype of each class with the mean of the most confident query examples.
We propose to meta-learn the confidence for each query sample, to assign optimal weights to unlabeled queries.
We validate our few-shot learning model with meta-learned confidence on four benchmark datasets.
arXiv Detail & Related papers (2020-02-27T10:22:17Z) - Variational Encoder-based Reliable Classification [5.161531917413708]
We propose an Epistemic (EC) that can provide justification of its belief using support from the training dataset as well as quality of reconstruction.
Our approach is based on modified variational autoencoders that can identify a semantically meaningful low-dimensional space.
Our results demonstrate improved reliability of predictions and robust identification of samples with adversarial attacks.
arXiv Detail & Related papers (2020-02-19T17:05:32Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.