An efficient algorithm for cardiac arrhythmia classification using ensemble of depthwise Separable convolutional neural networks

• Main Authors: Ihsanto, Eko, Ramli, Kalamullah, Sudiana, Dodi, Gunawan, Teddy Surya
• Format: Article
• Language: English
• Published: MDPI 2020
• Subjects: TK7885 Computer engineering
• Online Access: http://irep.iium.edu.my/78347/1/78347_An%20Efficient%20Algorithm%20for%20Cardiac%20Arrhythmia.pdf; http://irep.iium.edu.my/78347/; https://www.mdpi.com/2076-3417/10/2/483/htm; https://doi.org/10.3390/app10020483

Many algorithms have been developed for automated electrocardiogram (ECG) classification. Due to the non-stationary nature of the ECG signal, it is rather challenging to use traditional handcraft methods, such as time-based analysis of feature extraction and classification, to pave the way for machine learning implementation. This paper proposed a novel method, i.e., the ensemble of depthwise separable convolutional (DSC) neural networks for the classification of cardiac arrhythmia ECG beats. Using our proposed method, the four stages of ECG classification, i.e., QRS detection, preprocessing, feature extraction, and classification, were reduced to two steps only, i.e., QRS detection and classification. No preprocessing method was required while feature extraction was combined with classification. Moreover, to reduce the computational cost while maintaining its accuracy, several techniques were implemented, including All Convolutional Network (ACN), Batch Normalization (BN), and ensemble convolutional neural networks. The performance of the proposed ensemble CNNs were evaluated using the MIT-BIH arrythmia database. In the training phase, around 22% of the 110,057 beats data extracted from 48 records were utilized. Using only these 22% labeled training data, our proposed algorithm was able to classify the remaining 78% of the database into 16 classes. Furthermore, the sensitivity ( Sn ), specificity ( Sp ), and positive predictivity ( Pp ), and accuracy ( Acc ) are 99.03%, 99.94%, 99.03%, and 99.88%, respectively. The proposed algorithm required around 180 μs, which is suitable for real time application. These results showed that our proposed method outperformed other state of the art methods.