An algorithm for pattern recognition in needle-electromyograms - Description and clinical usefulness

被引:3
|
作者
Schulte-Mattler, WJ [1 ]
Jakob, M [1 ]
机构
[1] Univ Halle Wittenberg, Neurol Klin & Poliklin, D-06097 Halle, Germany
关键词
diagnosis; computer-assisted; electromyography/methods; pattern recognition; decomposition;
D O I
10.1055/s-2008-1060084
中图分类号
R74 [神经病学与精神病学];
学科分类号
摘要
Buchthal described electromyography with concentric needle electrodes, selection and classification of motor unit potentials (MUPs), and he provided normative data. Subsequently, his method was the de facto standard of quantitative electromyography. Its disadvantages are: it is time consuming, small muscles cannot be studied, and it is uncomfortable for patients. To lessen the disadvantages, computer algorithms were developed. The clinical value of these algorithms is not fully established. Methods: An own computer algorithm for selection and classification of MUPs is described. To assess its efficacy, the results of selection and classification done by the computer algorithm, by an experienced electromyographer, and by a neurology resident were compared. Subject to analysis were 75 electromyograms which were chosen at random from 10 normal subjects, from 2 patients with myopathy, and from 3 patients with a neurogenic disorder. Results: By the computer algorithm 1475, by the electromyographer 1688, and by the resident 1836 MUPs were selected. They were classified as generated by 169, 167, 195 motor units, respectively. For each motor unit, amplitude and duration of the averaged MUPs and median value of inter MUP intervals were measured automatically. The results of the computer algorithm better matched the results of the electromyographer than the results of the resident did, but differences were small and not significant. All results were similar but not equal to the values found by Buchthal. Discussion: The computer algorithm presented here helps quantitative analysis of electromyograms.
引用
收藏
页码:39 / 43
页数:5
相关论文
共 50 条
  • [31] ESP3 - LANGUAGE FOR PATTERN DESCRIPTION AND A SYSTEM FOR PATTERN-RECOGNITION
    SHAPIRO, LG
    BARON, RJ
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1977, 3 (02) : 169 - 183
  • [32] EEG signal recognition algorithm with sample entropy and pattern recognition
    Tan, Jinsong
    Ran, Zhuguo
    Wan, Chunjiang
    JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING, 2023, 23 (04) : 2059 - 2068
  • [33] Clinical usefulness of a treatment algorithm for pancreatic pseudocysts
    Barthet, Marc
    Lamblin, Gatien
    Gasmi, Mohamed
    Vitton, Veronique
    Desjeux, Ariadnc
    Grimaud, Jean-Charles
    GASTROINTESTINAL ENDOSCOPY, 2008, 67 (02) : 245 - 252
  • [34] Clinical usefulness of a treatment algorithm for pancreatic pseudocysts
    Bhasin, Deepak K.
    Rana, Surinder S.
    Singh, Kartar
    GASTROINTESTINAL ENDOSCOPY, 2008, 68 (03) : 612 - 612
  • [35] A pattern recognition algorithm for assessing trajectory completeness
    Sharma, Anshuman
    Zheng, Zuduo
    Bhaskar, Ashish
    TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2018, 96 : 432 - 457
  • [36] An algorithm for fast pattern recognition with random spikes
    Ernst, UA
    Rotermund, D
    Pawelzik, KR
    PATTERN RECOGNITION, 2004, 3175 : 399 - 406
  • [37] Applying novel QuickLearn algorithm for pattern recognition
    Akhbardeh, Alireza
    Varri, Alpo
    2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 851 - +
  • [38] An Elliptic Curve Algorithm for Iris Pattern Recognition
    Vishnubhatla, Sasank Venkata
    2015 ANNUAL GLOBAL ONLINE CONFERENCE ON INFORMATION AND COMPUTER TECHNOLOGY (GOCICT), 2016, : 51 - 59
  • [39] Boosting Learning Algorithm for Pattern Recognition and Beyond
    Komori, Osamu
    Eguchi, Shinto
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (10) : 1863 - 1869
  • [40] Concurrent application of genetic algorithm in pattern recognition
    Köppen, M
    Dimitriadou, E
    DESIGN AND APPLICATION OF HYBRID INTELLIGENT SYSTEMS, 2003, 104 : 868 - 877