Compressed spike-triggered averaging in iterative decomposition of surface EMG

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Sökning: L773:0169 2607 > Compressed spike-tr...

Lundsberg, JonathanLund University,Lunds universitet,Avdelningen för Biomedicinsk teknik,Institutionen för biomedicinsk teknik,Institutioner vid LTH,Lunds Tekniska Högskola,LTH profilområde: Teknik för hälsa,LTH profilområden,Department of Biomedical Engineering,Departments at LTH,Faculty of Engineering, LTH,LTH Profile Area: Engineering Health,LTH Profile areas,Faculty of Engineering, LTH (författare)

Compressed spike-triggered averaging in iterative decomposition of surface EMG

Artikel/kapitelEngelska2023

Förlag, utgivningsår, omfång ...

Elsevier BV,2023

Nummerbeteckningar

LIBRIS-ID:oai:gup.ub.gu.se/322640
https://gup.ub.gu.se/publication/322640URI
https://doi.org/10.1016/j.cmpb.2022.107250DOI
https://lup.lub.lu.se/record/e9e39183-eb00-4983-b2aa-1d4c4d3d7a3eURI

Kompletterande språkuppgifter

Språk:engelska

Ingår i deldatabas

SwePubSwePub

Klassifikation

Ämneskategori:ref swepub-contenttype
Ämneskategori:art swepub-publicationtype

Anmärkningar

Background and Objective: Analysis of motor unit activity is important for assessing and treating diseases or injuries affecting natural movement. State-of-the-art decomposition translates high-density surface electromyography (HDsEMG) into motor unit activity. However, current decomposition methods offer far from complete separation of all motor units. Methods: This paper proposes a peel-offapproach to automatic decomposition of HDsEMG into motor unit action potential (MUAP) trains, based on the Fast Independent Component Analysis algorithm (FastICA). The novel steps include utilizing compression by means of Principal Component Analysis and spike-triggered averaging, to estimate surface MUAP distributions with less noise, which are iteratively subtracted from the HDsEMG dataset. Furthermore, motor unit spike trains are estimated by highdimensional density-based clustering of peaks in the FastICA source output. And finally, a new reliability measure is used to discard poor motor unit estimates by comparing the variance of the FastICA source output before and after the peel-offstep. The method was validated using reconstructed synthetic data at three different signal-to-noise levels and was compared to an established deflationary FastICA approach. Results: Both algorithms had very high recall and precision, over 90%, for spikes from matching motor units, referred to as matched performance. However, the peel-offalgorithm correctly identified more motor units for all noise levels. When accounting for unidentified motor units, total recall was up to 33 percentage points higher; and when accounting for duplicate estimates, total precision was up to 24 percentage points higher, compared to the state-of-the-art reference. In addition, a comparison was done using experimental data where the proposed algorithm had a matched recall of 97% and precision of 85% with respect to the reference algorithm. Conclusion: These results show a substantial performance increase for decomposition of simulated HDsEMG data and serve to validate the proposed approach. This performance increase is an important step towards complete decomposition and extraction of information of motor unit activity. (C) 2022TheAuthor(s). PublishedbyElsevierB.V.

Ämnesord och genrebeteckningar

NATURVETENSKAP Data- och informationsvetenskap hsv//swe
NATURAL SCIENCES Computer and Information Sciences hsv//eng
TEKNIK OCH TEKNOLOGIER Elektroteknik och elektronik Signalbehandling hsv//swe
ENGINEERING AND TECHNOLOGY Electrical Engineering, Electronic Engineering, Information Engineering Signal Processing hsv//eng
Electromyography
decomposition
motor unit
FastICA
density-based
clustering
PCA-compression
fastica peel-off
signal decomposition
validation
algorithms
farina
Computer Science
Engineering
Medical Informatics
density-based clustering

Biuppslag (personer, institutioner, konferenser, titlar ...)

Björkman, AndersUniversity of Gothenburg,Gothenburg University,Göteborgs universitet,Institutionen för kliniska vetenskaper, Avdelningen för kirurgi,Institute of Clinical Sciences, Department of Surgery,Sahlgrenska University Hospital(Swepub:gu)xbandp (författare)
Malesevic, NebojsaLund University,Lunds universitet,Avdelningen för Biomedicinsk teknik,Institutionen för biomedicinsk teknik,Institutioner vid LTH,Lunds Tekniska Högskola,LTH profilområde: Teknik för hälsa,LTH profilområden,Department of Biomedical Engineering,Departments at LTH,Faculty of Engineering, LTH,LTH Profile Area: Engineering Health,LTH Profile areas,Faculty of Engineering, LTH(Swepub:lu)ne1743ma (författare)
Antfolk, ChristianLund University,Lunds universitet,Avdelningen för Biomedicinsk teknik,Institutionen för biomedicinsk teknik,Institutioner vid LTH,Lunds Tekniska Högskola,LTH profilområde: Teknik för hälsa,LTH profilområden,Department of Biomedical Engineering,Departments at LTH,Faculty of Engineering, LTH,LTH Profile Area: Engineering Health,LTH Profile areas,Faculty of Engineering, LTH(Swepub:lu)elma-cal (författare)
Avdelningen för Biomedicinsk teknikInstitutionen för biomedicinsk teknik (creator_code:org_t)

Sammanhörande titlar

Ingår i:Computer Methods and Programs in Biomedicine: Elsevier BV2280169-2607

Internetlänk

Hitta via bibliotek

Computer Methods and Programs in Biomedicine (Sök värdpublikationen i LIBRIS)

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...: Lundsberg, Jonat ...; Björkman, Anders; Malesevic, Neboj ...; Antfolk, Christi ...

Om ämnet

NATURVETENSKAP: NATURVETENSKAP; och Data och informa ...

TEKNIK OCH TEKNOLOGIER: TEKNIK OCH TEKNO ...; och Elektroteknik oc ...; och Signalbehandling

Artiklar i publikationen: Computer Methods ...

Av lärosätet: Göteborgs universitet; Lunds universitet

Sök utanför SwePub

Sök vidare i:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se