Characterizing the Location and Extent of Myocardial Infarctions With Inverse ECG Modeling and Spatiotemporal Regularization

Automated identification of atrial fibrillation from single-lead ECGs using multi-branching ResNet

Introduction: Atrial fibrillation (AF) is the most common cardiac arrhythmia, which is clinically identified with irregular and rapid heartbeat rhythm. AF puts a patient at risk of forming blood clots, which can eventually lead to heart failure, stroke, or even sudden death. Electrocardiography (ECG), which involves acquiring bioelectrical signals from the body surface to reflect heart activity, is a standard procedure for detecting AF. However, the occurrence of AF is often intermittent, costing a significant amount of time and effort from medical doctors to identify AF episodes. Moreover, human error is inevitable, as even experienced medical professionals can overlook or misinterpret subtle signs of AF. As such, it is of critical importance to develop an advanced analytical model that can automatically interpret ECG signals and provide decision support for AF diagnostics. Methods: In this paper, we propose an innovative deep-learning method for automated AF identification using single-lead ECGs. We first extract time-frequency features from ECG signals using continuous wavelet transform (CWT). Second, the convolutional neural networks enhanced with residual learning (ReNet) are employed as the functional approximator to interpret the time-frequency features extracted by CWT. Third, we propose to incorporate a multi-branching structure into the ResNet to address the issue of class imbalance, where normal ECGs significantly outnumber instances of AF in ECG datasets. Results and Discussion: We evaluate the proposed Multi-branching Resnet with CWT (CWT-MB-Resnet) with two ECG datasets, i.e., PhysioNet/CinC challenge 2017 and ECGs obtained from the University of Oklahoma Health Sciences Center (OUHSC). The proposed CWT-MB-Resnet demonstrates robust prediction performance, achieving an F1 score of 0.8865 for the PhysioNet dataset and 0.7369 for the OUHSC dataset. The experimental results signify the model's superior capability in balancing precision and recall, which is a desired attribute for ensuring reliable medical diagnoses.

Hierarchical deep learning with Generative Adversarial Network for automatic cardiac diagnosis from ECG signals

Cardiac disease is the leading cause of death in the US. Accurate heart disease detection is critical to timely medical treatment to save patients' lives. Routine use of the electrocardiogram (ECG) is the most common method for physicians to assess the cardiac electrical activities and detect possible abnormal conditions. Fully utilizing the ECG data for reliable heart disease detection depends on developing effective analytical models. In this paper, we propose a two-level hierarchical deep learning framework with Generative Adversarial Network (GAN) for ECG signal analysis. The first-level model is composed of a Memory-Augmented Deep AutoEncoder with GAN (MadeGAN), which aims to differentiate abnormal signals from normal ECGs for anomaly detection. The second-level learning aims at robust multi-class classification for different arrhythmia identification, which is achieved by integrating the transfer learning technique to transfer knowledge from the first-level learning with the multi-branching architecture to handle the data-lacking and imbalanced data issues. We evaluate the performance of the proposed framework using real-world ECG data from the MIT-BIH arrhythmia database. Experimental results show that our proposed model outperforms existing methods that are commonly used in current practice.

Gradient Boosted Trees for Spatial Data and Its Application to Medical Imaging Data

Boosting Trees are one of the most successful statistical learning approaches that involve sequentially growing an ensemble of simple regression trees ("weak learners"). This paper proposes a gradient Boosted Trees algorithm for Spatial Data (Boost-S) with covariate information. Boost-S integrates the spatial correlation into the classical framework of eXtreme Gradient Boosting. Each tree is constructed by solving a regularized optimization problem, where the objective function takes into account the underlying spatial correlation and involves two penalty terms on tree complexity. A computationally-efficient greedy heuristic algorithm is proposed to obtain an ensemble of trees. The proposed Boost-S is applied to the spatially-correlated FDG-PET (fluorodeoxyglucose-positron emission tomography) imaging data collected from clinical trials of cancer chemoradiotherapy. Our numerical investigations successfully demonstrate the advantages of the proposed Boost-S over existing approaches for this particular application.

Multi-Branching Temporal Convolutional Network for Sepsis Prediction

Sepsis is among the leading causes of morbidity and mortality in modern intensive care units. Accurate sepsis prediction is of critical importance to save lives and reduce medical costs. The rapid advancements in sensing and information technology facilitate the effective monitoring of patients health conditions, generating a wealth of medical data, and provide an unprecedented opportunity for data-driven diagnosis of sepsis. However, real-world medical data are often complexly structured with a high level of uncertainty (e.g., missing values, imbalanced data). Realizing the full data potential depends on developing effective analytical models. In this paper, we propose a novel predictive framework with Multi-Branching Temporal Convolutional Network (MB-TCN) to model the complexly structured medical data for robust prediction of sepsis. The MB-TCN framework not only efficiently handles the missing value and imbalanced data issues but also effectively captures the temporal pattern and heterogeneous variable interactions. We evaluate the performance of the proposed MB-TCN in predicting sepsis using real-world medical data from PhysioNet/Computing in Cardiology Challenge 2019. Experimental results show that MB-TCN outperforms existing methods that are commonly used in current practice.

A new approach to the intracardiac inverse problem using Laplacian distance kernel

Background

The inverse problem in electrophysiology consists of the accurate estimation of the intracardiac electrical sources from a reduced set of electrodes at short distances and from outside the heart. This estimation can provide an image with relevant knowledge on arrhythmia mechanisms for the clinical practice. Methods based on truncated singular value decomposition (TSVD) and regularized least squares require a matrix inversion, which limits their resolution due to the unavoidable low-pass filter effect of the Tikhonov regularization techniques.

Methods

We propose to use, for the first time, a Mercer’s kernel given by the Laplacian of the distance in the quasielectrostatic field equations, hence providing a Support Vector Regression (SVR) formulation by following the principles of the Dual Signal Model (DSM) principles for creating kernel algorithms.

Results

Simulations in one- and two-dimensional models show the performance of our Laplacian distance kernel technique versus several conventional methods. Firstly, the one-dimensional model is adjusted for yielding recorded electrograms, similar to the ones that are usually observed in electrophysiological studies, and suitable strategy is designed for the free-parameter search. Secondly, simulations both in one- and two-dimensional models show larger noise sensitivity in the estimated transfer matrix than in the observation measurements, and DSM−SVR is shown to be more robust to noisy transfer matrix than TSVD.

Conclusion

These results suggest that our proposed DSM−SVR with Laplacian distance kernel can be an efficient alternative to improve the resolution in current and emerging intracardiac imaging systems.