Abstract
Atrial fibrillation (AF) is thought to be maintained by reentrant and focal driver regions that may have some spatial-temporal stability. Recently, several cardiac mapping systems have implemented algorithms for automatic detection of these arrhythmogenic conduction patterns (CPs) during AF. Many of these algorithms divide the atrium into overlapping patches, sequentially analyzing each patch with the driver identification algorithms. Patch-based analyses may misrepresent local CPs as the number and trajectory of wavefronts entering and leaving the analyzed patch are uncertain. However, when a holistic view of chamber-wide activation is used, machine learning algorithms can ubiquitously identify arrhythmogenic CPs. Develop and evaluate a machine learning approach that can automatically identify and locate arrhythmogenic CPs. Propagation maps of clinical AF from nine patients were transformed into a 2D image space using conformal mapping, and these images were used to train and evaluate a UNet architecture model. Rotational and focal CPs were identified by the AcQTrack algorithm (Acutus Medical) and manually confirmed. The clinical dataset was supplemented with eikonal simulations of focally (n=400) and rotationally driven (n=200) AF, where the time and location of the rotational and focal drivers were randomized and known. The UNet architecture was trained using five of the clinical AF cases (n=7,880 frames) and simulated AF (200 focal and 100 rotational simulations, n=14,380 frames). A test set, consisting of five clinical AF cases (n=6,172 frames) and simulated AF (200 focal and 100 rotational simulations, n=14382 frames), were independently used to evaluate the model performance. The UNet model accurately detected the time and location of arrhythmogenic CPs in the atrium - Clinical AF DICE 0.91 and Simulated AF DICE 0.98. The presented machine learning approach can accurately identify and locate arrhythmogenic targets. It has potential to overcome limited view problem in detecting arrhythmogenic targets that is inherent problem of patch-based heuristic algorithms.View Large Image Figure ViewerDownload Hi-res image Download (PPT)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have