Rigorous performance assessment of the algorithms for resolving motor unit action potential superpositions
It is necessary to decompose the intra-muscular EMG signal to extract motor unit action potential (MUAP) waveforms and firing times. Some algorithms were proposed in the literature to resolve superimposed MUAPs, including Peel-Off (PO), branch and bound (BB), genetic algorithm (GA), and particle swa...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2021 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/390031 |
| Acesso em linha: | https://hdl.handle.net/2117/390031 https://dx.doi.org/10.1016/j.jelekin.2020.102510 |
| Access Level: | acceso abierto |
| Palavra-chave: | Electromyography Resolving superposition EMG decomposition Motor unit action potentials Electromiografia Àrees temàtiques de la UPC::Enginyeria biomèdica Àrees temàtiques de la UPC::Informàtica::Automàtica i control |
| Resumo: | It is necessary to decompose the intra-muscular EMG signal to extract motor unit action potential (MUAP) waveforms and firing times. Some algorithms were proposed in the literature to resolve superimposed MUAPs, including Peel-Off (PO), branch and bound (BB), genetic algorithm (GA), and particle swarm optimization (PSO). This study aimed to compare these algorithms in terms of overall accuracy and running time. Two sets of two-to-five MUAP templates (set1: a wide range of energies, and set2: a high degree of similarity) were used. Such templates were time-shifted, and white Gaussian noise was added. A total of 1000 superpositions were simulated for each template and were resolved using PO (also, POI: interpolated PO), BB, GA, and PSO algorithms. The generalized estimating equation was used to identify which method significantly outperformed, while the overall rank product was used for overall ranking. The rankings were PSO, BB, GA, PO, and POI in the first, and BB, PSO, GA, PO, POI in the second set. The overall ranking was BB, PSO, GA, PO, and POI in the entire dataset. Although the BB algorithm is generally fast, there are cases where the BB algorithm is too slow and it is thus not suitable for real-time applications. |
|---|