Cargando…

Patient-Specific Cardiac Parametrization from Eikonal Simulations

Simulations in cardiac electrophysiology use the bidomain equations to describe the electrical potential in the heart. If only the electrical activation sequence in the heart is needed, then the full bidomain equations can be substituted by the Eikonal equation which allows much faster responses w.r...

Descripción completa

Detalles Bibliográficos
Autores principales: Ganellari, Daniel, Haase, Gundolf, Zumbusch, Gerhard, Lotz, Johannes, Peltzer, Patrick, Leppkes, Klaus, Naumann, Uwe
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7302314/
http://dx.doi.org/10.1007/978-3-030-50371-0_21
Descripción
Sumario:Simulations in cardiac electrophysiology use the bidomain equations to describe the electrical potential in the heart. If only the electrical activation sequence in the heart is needed, then the full bidomain equations can be substituted by the Eikonal equation which allows much faster responses w.r.t. the changed material parameters in the equation. We use our Eikonal solver optimized for memory usage and parallelization. Patient-specific simulations in cardiac electrophysiology require patient-specific conductivity parameters which are not accurately available in vivo. One chance to improve the given conductivity parameters consists in comparing the computed activation sequence on the heart surface with the measured ECG on the torso mapped onto this surface. By minimizing the squared distance between the measured solution and the Eikonal computed solution we are able to determine the material parameters more accurately. To reduce the number of optimization parameters in this process, we group the material parameters and introduce a specific scaling parameter [Formula: see text] for each group. The minimization takes place w.r.t. the scaling [Formula: see text]. We solve the minimization problem by the BFGS method and adaptive step size control. The required gradient [Formula: see text] is computed either via finite differences or algorithmic differentiation using [Image: see text] in tangent as well as in adjoint mode. We present convergence behavior as well as runtime and scaling results.