Show simple item record

dc.contributor.authorWang, Xen_US
dc.contributor.authorHuang, Jen_US
dc.contributor.authorChatzakou, Men_US
dc.contributor.authorMedijainen, Ken_US
dc.contributor.authorToomela, Aen_US
dc.contributor.authorNõmm, Sen_US
dc.contributor.authorRuzhansky, Men_US
dc.date.accessioned2024-02-27T08:14:55Z
dc.date.available2024-02-08en_US
dc.date.issued2024-04en_US
dc.identifier.urihttps://qmro.qmul.ac.uk/xmlui/handle/123456789/94918
dc.description.abstractBACKGROUND AND OBJECTIVES: Dynamic handwriting analysis, due to its noninvasive and readily accessible nature, has emerged as a vital adjunctive method for the early diagnosis of Parkinson's disease (PD). An essential step involves analysing subtle variations in signals to quantify PD dysgraphia. Although previous studies have explored extracting features from the overall signal, they may ignore the potential importance of local signal segments. In this study, we propose a lightweight network architecture to analyse dynamic handwriting signal segments of patients and present visual diagnostic results, providing an efficient diagnostic method. METHODS: To analyse subtle variations in handwriting, we investigate time-dependent patterns in local representation of handwriting signals. Specifically, we segment the handwriting signal into fixed-length sequential segments and design a compact one-dimensional (1D) hybrid network to extract discriminative temporal features for classifying each local segment. Finally, the category of the handwriting signal is fully diagnosed through a majority voting scheme. RESULTS: The proposed method achieves impressive diagnostic performance on the new DraWritePD dataset (with an accuracy of 96.2%, sensitivity of 94.5% and specificity of 97.3%) and the well-established PaHaW dataset (with an accuracy of 90.7%, sensitivity of 94.3% and specificity of 87.5%). Moreover, the network architecture stands out for its excellent lightweight design, occupying a mere 0.084M parameters, with only 0.59M floating-point operations. It also exhibits nearly real-time CPU inference performance, with the inference time for a single handwriting signal ranging from 0.106 to 0.220 s. CONCLUSIONS: We present a series of experiments with extensive analysis, which systematically demonstrate the effectiveness and efficiency of the proposed method in quantifying dysgraphia for a precise diagnosis of PD.en_US
dc.format.extent108066 - ?en_US
dc.languageengen_US
dc.relation.ispartofComput Methods Programs Biomeden_US
dc.rights© 2024. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectConvolutional neural networken_US
dc.subjectDynamic handwriting analysisen_US
dc.subjectLong short-term memoryen_US
dc.subjectParkinson's diseaseen_US
dc.subjectReal-time diagnosisen_US
dc.subjectHumansen_US
dc.subjectParkinson Diseaseen_US
dc.subjectAgraphiaen_US
dc.subjectHandwritingen_US
dc.titleLSTM-CNN: An efficient diagnostic network for Parkinson's disease utilizing dynamic handwriting analysis.en_US
dc.typeArticle
dc.identifier.doi10.1016/j.cmpb.2024.108066en_US
pubs.author-urlhttps://www.ncbi.nlm.nih.gov/pubmed/38364361en_US
pubs.notesNot knownen_US
pubs.publication-statusPublisheden_US
pubs.volume247en_US
dcterms.dateAccepted2024-02-07en_US
rioxxterms.funderDefault funderen_US
rioxxterms.identifier.projectDefault projecten_US
qmul.funderRegularity in affiliated von Neumann algebras and applications to partial differential equations::Engineering and Physical Sciences Research Councilen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record