Article in Journal ART-2020-08

BibliographySubramanian, Shashank; Scheufele, Klaudius; Mehl, Miriam; Biros, George: Where did the tumor start? An inverse solver with sparse localization for tumor growth models.
In: Inverse Problems. Vol. 36(4).
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
english.
IOP Publisher, February 2020.
ISBN: 10.1088/1361-6420/ab649c.
Article in Journal.
CR-SchemaG.1.2 (Numerical Analysis Approximation)
G.1.6 (Numerical Analysis Optimization)
G.1.8 (Partial Differential Equations)
I.4 (Image Processing and Computer Vision)
I.6.8 (Types of Simulation)
J.3 (Life and Medical Sciences)
Abstract

We present a numerical scheme for solving an inverse problem for parameter estimation in tumor growth models for glioblastomas, a form of aggressive primary brain tumor. The growth model is a reaction–diffusion partial differential equation (PDE) for the tumor concentration. We use a PDE-constrained optimization formulation for the inverse problem. The unknown parameters are the reaction coefficient (proliferation), the diffusion coefficient (infiltration), and the initial condition field for the tumor PDE. Segmentation of magnetic resonance imaging (MRI) scans drive the inverse problem where segmented tumor regions serve as partial observations of the tumor concentration. Like most cases in clinical practice, we use data from a single time snapshot. Moreover, the precise time relative to the initiation of the tumor is unknown, which poses an additional difficulty for inversion. We perform a frozen-coefficient spectral analysis and show that the inverse problem is severely ill-posed. We introduce a biophysically motivated regularization on the structure and magnitude of the tumor initial condition. In particular, we assume that the tumor starts at a few locations (enforced with a sparsity constraint on the initial condition of the tumor) and that the initial condition magnitude in the maximum norm is equal to one. We solve the resulting optimization problem using an inexact quasi-Newton method combined with a compressive sampling algorithm for the sparsity constraint. Our implementation uses PETSc and AccFFT libraries. We conduct numerical experiments on synthetic and clinical images to highlight the improved performance of our solver over a previously existing solver that uses standard two-norm regularization for the calibration parameters. The existing solver is unable to localize the initial condition. Our new solver can localize the initial condition and recover infiltration and proliferation. In clinical datasets (for which the ground truth is unknown), our solver results in qualitatively different solutions compared to the two-norm regularized solver.

Full text and
other links
IOP Link
arxiv
Contactmiriam.mehl@ipvs.uni-stuttgart.de
Department(s)University of Stuttgart, Institute of Parallel and Distributed Systems, Simulation of Large Systems
Entry dateJune 19, 2020
   Publ. Institute   Publ. Computer Science