SearcharxivSearch

arXiv subjects

Anne Wald

Publications and source records attributed to Anne Wald.

14 recordsLinked to original sources

Transformer Causality Regularization for Dynamic Inverse Problems

We study the concept of including the causality principle as regularizer into the solution of linear time-dependent inverse problems. This is achieved by combining transformer-based predictions with classical variational regularization, resulting in what we call transformer causality regularization (TCR). The causality principle states that an object at time $t'$ depends only on its previous states at $t < t'$ and is independent of future states at $t > t'$. Since the transformer architecture represents sequence-to-sequence functions and can be equipped with a causal attention mask, transformers are the natural choice for a learned causality function that predicts the state of an object at time $t'$ given the previous states at $t < t'$. We combine this with the inductive bias of convolutional neural networks (CNNs) for imaging tasks to treat the spatial variable. The output of the spatial-temporal transformer is then used as a prior for variational regularization, such that classical results on regularization and convergence for solution methods directly transfer to our case. Using the example of dynamic computerized tomography, we compare TCR to a static and dynamic version of the earlier introduced unrolled adversarial regularizer for simulated and measured data. The results show that using TCR within a variational framework improves reconstruction results and data-consistency.

math.NA

Determination of active forces in actomyosin systems as inverse source problems for the Stokes equation

The identification of forces and stresses is a central task in biophysics research: Knowledge on forces is key to understanding dynamic processes in active biological systems that are able to self-organize and display emergent properties by converting energy into mechanical work. The aim of this paper is to identify forces generated by a filament-motor network of F-actin and myosin -- actomyosin -- and exerted on the surrounding fluid, therefore causing a fluid flow. In particular, we evaluate optical microscopy data stemming from two different physical settings, confined and non-confined active gels. As a theoretical model, we use the Stokes equation together with an incompressibility condition and suitable boundary conditions reflecting the physical settings. The problem of determining the forces from knowledge on the fluid flow is formulated as an inverse source problem. Due to experimental limitations, only incomplete data are available. We provide a rigorous analysis of the forward problems and the impact of missing data, derive the adjoints of the forward operators needed for regularization, and demonstrate our methods on both synthetic and experimentally measured data.

physics.flu-dyn

Regularization for time-dependent inverse problems: Geometry of Lebesgue-Bochner spaces and algorithms

We consider time-dependent inverse problems in a mathematical setting using Lebesgue-Bochner spaces. Such problems arise when one aims to recover a function from given observations where the function or the data depend on time. Lebesgue-Bochner spaces allow to easily incorporate the different nature of time and space. In this manuscript, we present two different regularization methods in Lebesgue Bochner spaces: 1. classical Tikhonov regularization in Banach spaces 2. temporal variational regularization by penalizing the time-derivative In the first case, we additionally investigate geometrical properties of Lebesgue Bochner spaces. In particular, we compute the duality mapping and show that these spaces are smooth of power type. With this we can implement Tikhononv regularization in Lebesgue-Bochner spaces using different regularities for time and space. We test both methods using the example of dynamic computerized tomography.

math.NA

Traction force microscopy for linear and nonlinear elastic materials as a parameter identification inverse problem

Traction force microscopy is a method widely used in biophysics and cell biology to determine forces that biological cells apply to their environment. In the experiment, the cells adhere to a soft elastic substrate, which is then deformed in response to cellular traction forces. The inverse problem consists in computing the traction stress applied by the cell from microscopy measurements of the substrate deformations. In this work, we consider a linear model, in which 3D forces are applied at a 2D interface, called 2.5D traction force microscopy, and a nonlinear pure 2D model, from which we directly obtain a linear pure 2D model. All models lead to a linear resp. nonlinear parameter identification problem for a boundary value problem of elasticity. We analyze the respective forward operators and conclude with some numerical experiments for simulated and experimental data.

math.NA

Dynamic computerized tomography using inexact models and motion estimation

Reconstructing a dynamic object with affine motion in computerized tomography (CT) leads to motion artifacts if the motion is not taken into account. In most cases, the actual motion is neither known nor can be determined easily. As a consequence, the respective model that describes CT is incomplete. The iterative RESESOP-Kaczmarz method can - under certain conditions and by exploiting the modeling error - reconstruct dynamic objects at different time points even if the exact motion is unknown. However, the method is very time-consuming. To speed the reconstruction process up and obtain better results, we combine the following three steps: 1. RESESOP-Kacmarz with only a few iterations is implemented to reconstruct the object at different time points. 2. The motion is estimated via landmark detection, e.g. using deep learning. 3. The estimated motion is integrated into the reconstruction process, allowing the use of dynamic filtered backprojection. We give a short review of all methods involved and present numerical results as a proof of principle.

math.NA

Ill-posedness of time-dependent inverse problems in Lebesgue-Bochner spaces

We consider time-dependent inverse problems in a mathematical setting using Lebesgue-Bochner spaces. Such problems arise when one aims to recover parameters from given observations where the parameters or the data depend on time. There are various important applications being subject of current research that belong to this class of problems. Typically inverse problems are ill-posed in the sense that already small noise in the data causes tremendous errors in the solution. In this article we present two different concepts of ill-posedness: temporally (pointwise) ill-posedness and uniform ill-posedness with respect to the Lebesgue-Bochner setting. We investigate the two concepts by means of a typical setting consisting of a time-depending observation operator composed by a compact operator. Furthermore we develop regularization methods that are adapted to the respective class of ill-posedness.

math.OC

Learning-based approaches for reconstructions with inexact operators in nanoCT applications

Imaging problems such as the one in nanoCT require the solution of an inverse problem, where it is often taken for granted that the forward operator, i.e., the underlying physical model, is properly known. In the present work we address the problem where the forward model is inexact due to stochastic or deterministic deviations during the measurement process. We particularly investigate the performance of non-learned iterative reconstruction methods dealing with inexactness and learned reconstruction schemes, which are based on U-Nets and conditional invertible neural networks. The latter also provide the opportunity for uncertainty quantification. A synthetic large data set in line with a typical nanoCT setting is provided and extensive numerical experiments are conducted evaluating the proposed methods.

math.NA

On numerical aspects of parameter identification for the Landau-Lifshitz-Gilbert equation in Magnetic Particle Imaging

The Landau-Lifshitz-Gilbert equation yields a mathematical model to describe the evolution of the magnetization of a magnetic material, particularly in response to an external applied magnetic field. It allows one to take into account various physical effects, such as the exchange within the magnetic material itself. In particular, the Landau-Lifshitz-Gilbert equation encodes relaxation effects, i.e., it describes the time-delayed alignment of the magnetization field with an external magnetic field. These relaxation effects are an important aspect in magnetic particle imaging, particularly in the calibration process. In this article, we address the data-driven modeling of the system function in magnetic particle imaging, where the Landau-Lifshitz-Gilbert equation serves as the basic tool to include relaxation effects in the model. We formulate the respective parameter identification problem both in the all-at-once and the reduced setting, present reconstruction algorithms that yield a regularized solution and discuss numerical experiments. Apart from that, we propose a practical numerical solver to the nonlinear Landau-Lifshitz-Gilbert equation, not via the classical finite element method, but through solving only linear PDEs in an inverse problem framework.

math.NA

A method for determining the parameters in a rheological model for viscoelastic materials by minimizing Tikhonov functionals

Mathematical models describing the behavior of viscoelastic materials are often based on evolution equations that measure the change in stress depending on its material parameters such as stiffness, viscosity or relaxation time. In this article, we introduce a Maxwell-based rheological model, define the associated forward operator and the inverse problem in order to determine the number of Maxwell elements and the material parameters of the underlying viscoelastic material. We perform a relaxation experiment by applying a strain to the material and measure the generated stress. Since the measured data varies with the number of Maxwell elements, the forward operator of the underlying inverse problem depends on parts of the solution. By introducing assumptions on the relaxation times, we propose a clustering algorithm to resolve this problem. We provide the calculations that are necessary for the minimization process and conclude with numerical results by investigating unperturbed as well as noisy data. We present different reconstruction approaches based on minimizing a least squares functional. Furthermore, we look at individual stress components to analyze different displacement rates. Finally, we study reconstructions with shortened data sets to obtain assertions on how long experiments have to be performed to identify conclusive material parameters.

math.NA

On parameter identification problems for elliptic boundary value problems in divergence form, Part I: An abstract framework

Parameter identification problems for partial differential equations are an important subclass of inverse problems. The parameter-to-state map, which maps the parameter of interest to the respective solution of the PDE or state of the system, plays the central role in the (usually nonlinear) forward operator. Consequently, one is interested in well-definedness and further analytic properties such as continuity and differentiability of this operator w.r.t. the parameter in order to make sure that techniques from inverse problems theory may be successfully applied to solve the inverse problem. In this work, we present a general functional analytic framework suited for the study of a huge class of parameter identification problems including a variety of elliptic boundary value problems (in divergence form) with Dirichlet, Neumann, Robin or mixed boundary conditions. In particular, we show that the corresponding parameter-to-state operators fulfil, under suitable conditions, the tangential cone condition, which is often postulated for numerical solution techniques. This framework particularly covers the inverse medium problem and an inverse problem that arises in terahertz tomography.

math.NA

Sequential subspace optimization for recovering stored energy functions in hyperelastic materials from time-dependent data

Monitoring structures of elastic materials for defect detection by means of ultrasound waves (Structural Health Monitoring, SHM) demands for an efficient computation of parameters which characterize their mechanical behavior. Hyperelasticity describes a nonlinear elastic behavior where the second Piola-Kirchhoff stress tensor is given as a derivative of a scalar function representing the stored (strain) energy. Since the stored energy encodes all mechanical properties of the underlying material, the inverse problem of computing this energy from measurements of the displacement field is very important regarding SHM. The mathematical model is represented by a high-dimensional parameter identification problem for a nonlinear, hyperbolic system with given initial and boundary values. Iterative methods for solving this problem, such as the Landweber iteration, are very time-consuming. The reason is the fact that such methods demand for several numerical solutions of the hyperbolic system in each iteration step. In this contribution we present an iterative method based on sequential subspace optimization (SESOP) which in general uses more than only one search direction per iteration and explicitly determines the step size. This leads to a significant acceleration compared to the Landweber method, even with only one search direction and an optimized step size. This is demonstrated by means of several numerical tests.

math.NA

Parameter identification for the Landau-Lifshitz-Gilbert equation in Magnetic Particle Imaging

Magnetic particle imaging (MPI) is a tracer-based technique for medical imaging where the tracer consists of ironoxide nanoparticles. The key idea is to measure the particle response to a temporally changing external magnetic field to compute the spatial concentration of the tracer inside the object. A decent mathematical model demands for a data-driven computation of the system function which does not only describe the measurement geometry but also encodes the interaction of the particles with the external magnetic field. The physical model of this interaction is given by the Landau-Lifshitz-Gilbert (LLG) equation. The determination of the system function can be seen as an inverse problem of its own which can be interpreted as a calibration problem for MPI. In this contribution the calibration problem is formulated as an inverse parameter identification problem for the LLG equation. We give a detailed analysis of the direct as well as the inverse problem in an all-at-once as well as in a reduced setting. The analytical results yield a deeper understanding of inverse problems connected to the LLG equation and provide a starting point for the development of robust numerical solution methods in MPI.

math.AP

A fast subspace optimization method for nonlinear inverse problems in Banach spaces with an application in parameter identification

We introduce and analyze a fast iterative method based on sequential Bregman projections for nonlinear inverse problems in Banach spaces. The key idea, in contrast to the standard Landweber method, is to use multiple search directions per iteration in combination with a regulation of the step width in order to reduce the total number of iterations. This method is suitable for both exact and noisy data. In the latter case, we obtain a regularization method. An algorithm with two search directions is used for the numerical identification of a parameter in an elliptic boundary value problem.

math.NA

Sequential subspace optimization for nonlinear inverse problems

In this work we discuss a method to adapt sequential subspace optimization (SESOP), which has so far been developed for linear inverse problems in Hilbert and Banach spaces, to the case of nonlinear inverse problems. We start by revising the well-known technique for Hilbert spaces. In a next step, we introduce a method using multiple search directions that are especially designed to fit the nonlinearity of the forward operator. To this end, we iteratively project the initial value onto stripes whose shape is determined by the search direction, the nonlinearity of the operator and the noise level. We additionally propose a fast algorithm that uses two search directions. Finally we will show convergence and regularization properties for the presented method.

math.NA