Division of Biomedical Physics, Office of Science and Engineering Laboratories, Center for Devices and Radiological Health, US Food and Drug Administration, Silver Spring, MD, USA.
Division of Biomedical Physics, Office of Science and Engineering Laboratories, Center for Devices and Radiological Health, US Food and Drug Administration, Silver Spring, MD, USA.
Comput Methods Programs Biomed. 2024 Dec;257:108456. doi: 10.1016/j.cmpb.2024.108456. Epub 2024 Oct 24.
Numerical simulations are valuable tools for studying cardiac arrhythmias. Not only do they complement experimental studies, but there is also an increasing expectation for their use in clinical applications to guide patient-specific procedures. However, numerical studies that solve the reaction-diffusion equations describing cardiac electrical activity remain challenging to set up, are time-consuming, and in many cases, are prohibitively computationally expensive for long studies. The computational cost of cardiac simulations of complex models on anatomically accurate structures necessitates parallel computing. Graphics processing units (GPUs), which have thousands of cores, have been introduced as a viable technology for carrying out fast cardiac simulations, sometimes including real-time interactivity. Our main objective is to increase the performance and accuracy of such GPU implementations while conserving computational resources.
In this work, we present a compression algorithm that can be used to conserve GPU memory and improve efficiency by managing the sparsity that is inherent in using Cartesian grids to represent cardiac structures directly obtained from high-resolution MRI and mCT scans. Furthermore, we present a discretization scheme that includes the cross-diagonal terms in the computational cell to increase numerical accuracy, which is especially important for simulating thin tissue sections without the need for costly mesh refinement.
Interactive WebGL simulations of atrial/ventricular structures (on PCs, laptops, tablets, and phones) demonstrate the algorithm's ability to reduce memory demand by an order of magnitude and achieve calculations up to 20x faster. We further showcase its superiority in slender tissues and validate results against experiments performed in live explanted human hearts.
In this work, we present a compression algorithm that accelerates electrical activity simulations on realistic anatomies by an order of magnitude (up to 20x), thereby allowing the use of finer grid resolutions while conserving GPU memory. Additionally, improved accuracy is achieved through cross-diagonal terms, which are essential for thin tissues, often found in heart structures such as pectinate muscles and trabeculae, as well as Purkinje fibers. Our method enables interactive simulations with even interactive domain boundary manipulation (unlike finite element/volume methods). Finally, agreement with experiments and ease of mesh import into WebGL paves the way for virtual cohorts and digital twins, aiding arrhythmia analysis and personalized therapies.
数值模拟是研究心脏心律失常的有价值的工具。它们不仅补充了实验研究,而且越来越期望将其用于临床应用以指导针对患者的程序。然而,解决描述心脏电活动的反应扩散方程的数值研究仍然具有挑战性,既耗时,而且在许多情况下,对于长期研究来说,计算成本过高。对复杂模型在解剖上准确结构的心脏模拟的计算成本需要并行计算。具有数千个内核的图形处理单元 (GPU) 已被引入作为执行快速心脏模拟的可行技术,有时包括实时交互性。我们的主要目标是在节省计算资源的同时提高此类 GPU 实现的性能和准确性。
在这项工作中,我们提出了一种压缩算法,该算法可用于通过管理直接从高分辨率 MRI 和 mCT 扫描获得的心脏结构使用笛卡尔网格表示所固有的稀疏性来节省 GPU 内存并提高效率。此外,我们提出了一种离散化方案,该方案包括计算单元中的交叉对角线项,以提高数值准确性,这对于模拟没有昂贵的网格细化的薄组织部分特别重要。
心房/心室结构的交互式 WebGL 模拟(在 PC、笔记本电脑、平板电脑和手机上)证明了该算法能够将内存需求减少一个数量级,并将计算速度提高 20 倍。我们进一步展示了它在细长组织中的优越性,并将结果与在活的人体心脏中进行的实验进行了验证。
在这项工作中,我们提出了一种压缩算法,该算法通过数量级(高达 20 倍)加速了对真实解剖结构的电活动模拟,从而允许使用更精细的网格分辨率,同时节省 GPU 内存。此外,通过交叉对角线项提高了准确性,这对于薄组织至关重要,薄组织通常存在于心结构中,例如梳状肌和小梁以及浦肯野纤维。我们的方法允许进行交互式模拟,甚至可以进行交互式域边界操作(与有限元/体积方法不同)。最后,与实验的一致性以及将网格轻松导入 WebGL 为虚拟队列和数字双胞胎铺平了道路,有助于心律失常分析和个性化治疗。