Pith. sign in

Assessment of Parkinson's Disease Medication State through Automatic Speech Analysis

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Parkinson's disease (PD) is a progressive degenerative disorder of the central nervous system characterized by motor and non-motor symptoms. As the disease progresses, patients alternate periods in which motor symptoms are mitigated due to medication intake (ON state) and periods with motor complications (OFF state). The time that patients spend in the OFF condition is currently the main parameter employed to assess pharmacological interventions and to evaluate the efficacy of different active principles. In this work, we present a system that combines automatic speech processing and deep learning techniques to classify the medication state of PD patients by leveraging personal speech-based bio-markers. We devise a speaker-dependent approach and investigate the relevance of different acoustic-prosodic feature sets. Results show an accuracy of 90.54% in a test task with mixed speech and an accuracy of 95.27% in a semi-spontaneous speech task. Overall, the experimental assessment shows the potentials of this approach towards the development of reliable, remote daily monitoring and scheduling of medication intake of PD patients.

citation-role summary

background 1

citation-polarity summary

fields

cs.DM 1

years

2024 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

background 1

representative citing papers

Summa Summarum: Moessner's Theorem without Dynamic Programming

cs.DM · 2024-12-04 · conditional · novelty 6.0

Moessner's process for generating powers by addition is equivalent to a nested summation with index-dependent upper bounds, and this form generalizes to factorials, binomials, Catalan and polygonal numbers.

citing papers explorer

Showing 1 of 1 citing paper.

  • Summa Summarum: Moessner's Theorem without Dynamic Programming cs.DM · 2024-12-04 · conditional · none · ref 55 · internal anchor

    Moessner's process for generating powers by addition is equivalent to a nested summation with index-dependent upper bounds, and this form generalizes to factorials, binomials, Catalan and polygonal numbers.