Subject Envelope based Multitype Reconstruction Algorithm of Speech
Samples of Parkinson's Disease
- URL: http://arxiv.org/abs/2108.09922v1
- Date: Mon, 23 Aug 2021 04:20:51 GMT
- Title: Subject Envelope based Multitype Reconstruction Algorithm of Speech
Samples of Parkinson's Disease
- Authors: Yongming Li, Chengyu Liu, Pin Wang, Hehua Zhang, Anhai Wei
- Abstract summary: The risk of Parkinson's disease (PD) is extremely serious, and PD speech recognition is an effective method of diagnosis nowadays.
Due to the influence of the disease stage, corpus, and other factors on data collection, the ability of every samples within one subject to reflect the status of PD vary.
This paper proposes a PD speech sample transformation algorithm based on multitype reconstruction operators.
- Score: 9.201534250475934
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: The risk of Parkinson's disease (PD) is extremely serious, and PD speech
recognition is an effective method of diagnosis nowadays. However, due to the
influence of the disease stage, corpus, and other factors on data collection,
the ability of every samples within one subject to reflect the status of PD
vary. No samples are useless totally, and not samples are 100% perfect. This
characteristic means that it is not suitable just to remove some samples or
keep some samples. It is necessary to consider the sample transformation for
obtaining high quality new samples. Unfortunately, existing PD speech
recognition methods focus mainly on feature learning and classifier design
rather than sample learning, and few methods consider the sample
transformation. To solve the problem above, a PD speech sample transformation
algorithm based on multitype reconstruction operators is proposed in this
paper. The algorithm is divided into four major steps. Three types of
reconstruction operators are designed in the algorithm: types A, B and C.
Concerning the type A operator, the original dataset is directly reconstructed
by designing a linear transformation to obtain the first dataset. The type B
operator is designed for clustering and linear transformation of the dataset to
obtain the second new dataset. The third operator, namely, the type C operator,
reconstructs the dataset by clustering and convolution to obtain the third
dataset. Finally, the base classifier is trained based on the three new
datasets, and then the classification results are fused by decision weighting.
In the experimental section, two representative PD speech datasets are used for
verification. The results show that the proposed algorithm is effective.
Compared with other algorithms, the proposed algorithm achieves apparent
improvements in terms of classification accuracy.
Related papers
- Comparative study of subset selection methods for rapid prototyping of
3D object detection algorithms [0.0]
prototyping object detection algorithms is time-consuming and costly in terms of energy and environmental impact.
We present a comparison of three algorithms for selecting such a subset - random sampling, random per class sampling, and our proposed MONSPeC.
We provide empirical evidence for the superior effectiveness of random per class sampling and MONSPeC over basic random sampling.
arXiv Detail & Related papers (2023-06-30T11:09:20Z) - Towards Automated Imbalanced Learning with Deep Hierarchical
Reinforcement Learning [57.163525407022966]
Imbalanced learning is a fundamental challenge in data mining, where there is a disproportionate ratio of training samples in each class.
Over-sampling is an effective technique to tackle imbalanced learning through generating synthetic samples for the minority class.
We propose AutoSMOTE, an automated over-sampling algorithm that can jointly optimize different levels of decisions.
arXiv Detail & Related papers (2022-08-26T04:28:01Z) - Cross-Site Severity Assessment of COVID-19 from CT Images via Domain
Adaptation [64.59521853145368]
Early and accurate severity assessment of Coronavirus disease 2019 (COVID-19) based on computed tomography (CT) images offers a great help to the estimation of intensive care unit event.
To augment the labeled data and improve the generalization ability of the classification model, it is necessary to aggregate data from multiple sites.
This task faces several challenges including class imbalance between mild and severe infections, domain distribution discrepancy between sites, and presence of heterogeneous features.
arXiv Detail & Related papers (2021-09-08T07:56:51Z) - 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) - Few-shot Open-set Recognition by Transformation Consistency [30.757030359718048]
We propose a novel unknown class sample detector, named SnaTCHer, that does not require pseudo-unseen samples.
Based on the transformation consistency, our method measures the difference between the transformed prototypes and a modified prototype set.
Our method alters the unseen class distribution estimation problem to a relative feature transformation problem, independent of pseudo-unseen class samples.
arXiv Detail & Related papers (2021-03-02T07:37:17Z) - Sparse PCA via $l_{2,p}$-Norm Regularization for Unsupervised Feature
Selection [138.97647716793333]
We propose a simple and efficient unsupervised feature selection method, by combining reconstruction error with $l_2,p$-norm regularization.
We present an efficient optimization algorithm to solve the proposed unsupervised model, and analyse the convergence and computational complexity of the algorithm theoretically.
arXiv Detail & Related papers (2020-12-29T04:08:38Z) - A Method for Handling Multi-class Imbalanced Data by Geometry based
Information Sampling and Class Prioritized Synthetic Data Generation (GICaPS) [15.433936272310952]
This paper looks into the problem of handling imbalanced data in a multi-label classification problem.
Two novel methods are proposed that exploit the geometric relationship between the feature vectors.
The efficacy of the proposed methods is analyzed by solving a generic multi-class recognition problem.
arXiv Detail & Related papers (2020-10-11T04:04:26Z) - A Systematic Characterization of Sampling Algorithms for Open-ended
Language Generation [71.31905141672529]
We study the widely adopted ancestral sampling algorithms for auto-regressive language models.
We identify three key properties that are shared among them: entropy reduction, order preservation, and slope preservation.
We find that the set of sampling algorithms that satisfies these properties performs on par with the existing sampling algorithms.
arXiv Detail & Related papers (2020-09-15T17:28:42Z) - Ensemble Wrapper Subsampling for Deep Modulation Classification [70.91089216571035]
Subsampling of received wireless signals is important for relaxing hardware requirements as well as the computational cost of signal processing algorithms.
We propose a subsampling technique to facilitate the use of deep learning for automatic modulation classification in wireless communication systems.
arXiv Detail & Related papers (2020-05-10T06:11:13Z) - Classification Algorithm of Speech Data of Parkinsons Disease Based on
Convolution Sparse Kernel Transfer Learning with Optimal Kernel and Parallel
Sample Feature Selection [14.1270098940551]
A novel PD classification algorithm based on sparse kernel transfer learning is proposed.
Sparse transfer learning is used to extract structural information of PD speech features from public datasets.
The proposed algorithm achieves obvious improvements in classification accuracy.
arXiv Detail & Related papers (2020-02-10T13:20:21Z)
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.