Atrial Fibrillation Detection Using a Feedforward Neural Network

An Arrhythmia classification approach via deep learning using single-lead ECG without QRS wave detection

Arrhythmia, a frequently encountered and life-threatening cardiac disorder, can manifest as a transient or isolated event. Traditional automatic arrhythmia detection methods have predominantly relied on QRS-wave signal detection. Contemporary research has focused on the utilization of wearable devices for continuous monitoring of heart rates and rhythms through single-lead electrocardiogram (ECG), which holds the potential to promptly detect arrhythmias. However, in this study, we employed a convolutional neural network (CNN) to classify distinct arrhythmias without QRS wave detection step. The ECG data utilized in this study were sourced from the publicly accessible PhysioNet databases. Taking into account the impact of the duration of ECG signal on accuracy, this study trained one-dimensional CNN models with 5-s and 10-s segments, respectively, and compared their results. In the results, the CNN model exhibited the capability to differentiate between Normal Sinus Rhythm (NSR) and various arrhythmias, including Atrial Fibrillation (AFIB), Atrial Flutter (AFL), Wolff-Parkinson-White syndrome (WPW), Ventricular Fibrillation (VF), Ventricular Tachycardia (VT), Ventricular Flutter (VFL), Mobitz II AV Block (MII), and Sinus Bradycardia (SB). Both 10-s and 5-s ECG segments exhibited comparable results, with an average classification accuracy of 97.31%. It reveals the feasibility of utilizing even shorter 5-s recordings for detecting arrhythmias in everyday scenarios. Detecting arrhythmias with a single lead aligns well with the practicality of wearable devices for daily use, and shorter detection times also align with their clinical utility in emergency situations.

Advancing Federated Learning through Verifiable Computations and Homomorphic Encryption

Federated learning, as one of the three main technical routes for privacy computing, has been widely studied and applied in both academia and industry. However, malicious nodes may tamper with the algorithm execution process or submit false learning results, which directly affects the performance of federated learning. In addition, learning nodes can easily obtain the global model. In practical applications, we would like to obtain the federated learning results only by the demand side. Unfortunately, no discussion on protecting the privacy of the global model is found in the existing research. As emerging cryptographic tools, the zero-knowledge virtual machine (ZKVM) and homomorphic encryption provide new ideas for the design of federated learning frameworks. We have introduced ZKVM for the first time, creating learning nodes as local computing provers. This provides execution integrity proofs for multi-class machine learning algorithms. Meanwhile, we discuss how to generate verifiable proofs for large-scale machine learning tasks under resource constraints. In addition, we implement the fully homomorphic encryption (FHE) scheme in ZKVM. We encrypt the model weights so that the federated learning nodes always collaborate in the ciphertext space. The real results can be obtained only after the demand side decrypts them using the private key. The innovativeness of this paper is demonstrated in the following aspects: 1. We introduce the ZKVM for the first time, which achieves zero-knowledge proofs (ZKP) for machine learning tasks with multiple classes and arbitrary scales. 2. We encrypt the global model, which protects the model privacy during local computation and transmission. 3. We propose and implement a new federated learning framework. We measure the verification costs under different federated learning rounds on the IRIS dataset. Despite the impact of homomorphic encryption on computational accuracy, the framework proposed in this paper achieves a satisfactory 90% model accuracy. Our framework is highly secure and is expected to further improve the overall efficiency as cryptographic tools continue to evolve.

Ensemble classifier fostered detection of arrhythmia using ECG data

Electrocardiogram (ECG) is a non-invasive medical tool that divulges the rhythm and function of the human heart. This is broadly employed in heart disease detection including arrhythmia. Arrhythmia is a general term for abnormal heart rhythms that can be identified and classified into many categories. Automatic ECG analysis is provided by arrhythmia categorization in cardiac patient monitoring systems. It aids cardiologists to diagnose the ECG signal. In this work, an Ensemble classifier is proposed for accurate arrhythmia detection using ECG Signal. Input data are taken from the MIT-BIH arrhythmia dataset. Then the input data was pre-processed using Python in Jupyter Notebook which run the code in an isolated manner and was able to keep code, formula, comments, and images. Then, Residual Exemplars Local Binary Pattern is applied for extracting statistical features. The extracted features are given to ensemble classifiers, like Support vector machines (SVM), Naive Bayes (NB), and random forest (RF) for classifying the arrhythmia as normal (N), supraventricular ectopic beat (S), ventricular ectopic beat (V), fusion beat (F), and unknown beat (Q). The proposed AD-Ensemble SVM-NB-RF method is implemented in Python. The proposed AD-Ensemble SVM-NB-RF method is 44.57%, 52.41%, and 29.49% higher accuracy; 2.01%, 3.33%, and 3.19% higher area under the curve (AUC); and 21.52%, 23.05%, and 12.68% better F-Measure compared with existing models, like multi-model depending on the ensemble of deep learning for ECG heartbeats arrhythmia categorization (AD-Ensemble CNN-LSTM-RRHOS), ECG signal categorization utilizing VGGNet: a neural network based classification method (AD-Ensemble CNN-LSTM) and higher performance arrhythmic heartbeat categorization utilizing ensemble learning along PSD based feature extraction method (AD-Ensemble MLP-NB-RF).

Electrocardiogram Monitoring Wearable Devices and Artificial-Intelligence-Enabled Diagnostic Capabilities: A Review

Worldwide, population aging and unhealthy lifestyles have increased the incidence of high-risk health conditions such as cardiovascular diseases, sleep apnea, and other conditions. Recently, to facilitate early identification and diagnosis, efforts have been made in the research and development of new wearable devices to make them smaller, more comfortable, more accurate, and increasingly compatible with artificial intelligence technologies. These efforts can pave the way to the longer and continuous health monitoring of different biosignals, including the real-time detection of diseases, thus providing more timely and accurate predictions of health events that can drastically improve the healthcare management of patients. Most recent reviews focus on a specific category of disease, the use of artificial intelligence in 12-lead electrocardiograms, or on wearable technology. However, we present recent advances in the use of electrocardiogram signals acquired with wearable devices or from publicly available databases and the analysis of such signals with artificial intelligence methods to detect and predict diseases. As expected, most of the available research focuses on heart diseases, sleep apnea, and other emerging areas, such as mental stress. From a methodological point of view, although traditional statistical methods and machine learning are still widely used, we observe an increasing use of more advanced deep learning methods, specifically architectures that can handle the complexity of biosignal data. These deep learning methods typically include convolutional and recurrent neural networks. Moreover, when proposing new artificial intelligence methods, we observe that the prevalent choice is to use publicly available databases rather than collecting new data.

A Study of R-R Interval Transition Matrix Features for Machine Learning Algorithms in AFib Detection

Atrial Fibrillation (AFib) is a heart condition that occurs when electrophysiological malformations within heart tissues cause the atria to lose coordination with the ventricles, resulting in "irregularly irregular" heartbeats. Because symptoms are subtle and unpredictable, AFib diagnosis is often difficult or delayed. One possible solution is to build a system which predicts AFib based on the variability of R-R intervals (the distances between two R-peaks). This research aims to incorporate the transition matrix as a novel measure of R-R variability, while combining three segmentation schemes and two feature importance measures to systematically analyze the significance of individual features. The MIT-BIH dataset was first divided into three segmentation schemes, consisting of 5-s, 10-s, and 25-s subsets. In total, 21 various features, including the transition matrix features, were extracted from these subsets and used for the training of 11 machine learning classifiers. Next, permutation importance and tree-based feature importance calculations determined the most predictive features for each model. In summary, with Leave-One-Person-Out Cross Validation, classifiers under the 25-s segmentation scheme produced the best accuracies; specifically, Gradient Boosting (96.08%), Light Gradient Boosting (96.11%), and Extreme Gradient Boosting (96.30%). Among eleven classifiers, the three gradient boosting models and Random Forest exhibited the highest overall performance across all segmentation schemes. Moreover, the permutation and tree-based importance results demonstrated that the transition matrix features were most significant with longer subset lengths.

A novel multi-innovation gradient support vector machine regression method

For the regression problem of support vector machine, the solution processes of the most existing methods use offline datasets, which cannot be realized online. For this problem, this paper presents a new online approach to identify these unknown parameters contained in the support vector machine. A new cost function is constructed by substituting the error term into the standard cost function, which is different from the standard support vector machine, and the gradient descent approach is then used to minimize the newly created loss function, thus proposing a stochastic gradient support vector machine algorithm to estimate the unknown parameters based on the recursive identification methods. Furthermore, to advance the property of the stochastic gradient support vector machine algorithm, a moving data window is used to widen the scalar information into a fixed-length innovation vector, thereby increasing the amount of information used in the parameter estimation based on the multi-innovation identification theory. In addition, the forgetting factor is brought into the proposed algorithms, and the corresponding forgetting factor recursive algorithms are derived. These methods are recursive identification methods, which may be implemented online and are more efficient in terms of computing. Finally, utilizing the MatLab platform, the validity and usefulness of the explored methodologies are proven using several numerical simulation examples.

Two-stage extended recursive gradient algorithm for locally linear RBF-based autoregressive models with colored noises

A novel parameter identification method for locally linear radial basis function-based autoregressive models in presence of colored noises is proposed in this paper. Taking advantage of the global nonlinear and local linear structural characteristics of the models, two dynamical criterion functions are constructed based on the separated parameters to realize the dynamical acquisition and utilization of the entire process data. Two recursive gradient sub-algorithms are derived for estimating the separated parameters by using the nonlinear gradient optimization. To coordinate the associated variables existing in the sub-algorithms and to estimate the unmeasurable noise terms, we combine the sub-algorithms and propose a two-stage extended recursive gradient (2S-ERG) algorithm. In addition, an extended recursive gradient algorithm is given as a comparison. The feasibility of the 2S-ERG algorithm is validated by numerical simulations.