Search results

The application of statistical inversion theory provides a powerful approach for solving estimation problems including the ability for uncertainty quantification (UQ) by means of Markov chain Monte Carlo (MCMC) methods and Monte Carlo integration. This paper aims to analyze the application of a state reduction technique within different MCMC techniques to improve the computational efficiency and the tuning process of these algorithms.

A reduced state representation is constructed from a general prior distribution. For sampling the Metropolis Hastings (MH) Algorithm and the Gibbs sampler are used. Efficient proposal generation techniques and techniques for conditional sampling are proposed and evaluated for an exemplary inverse problem.

For the MH-algorithm, high acceptance rates can be obtained with a simple proposal kernel. For the Gibbs sampler, an efficient technique for conditional sampling was found. The state reduction scheme stabilizes the ill-posed inverse problem, allowing a solution without a dedicated prior distribution. The state reduction is suitable to represent general material distributions.

The state reduction scheme and the MCMC techniques can be applied in different imaging problems. The stabilizing nature of the state reduction improves the solution of ill-posed problems. The tuning of the MCMC methods is simplified.

The paper presents a method to improve the solution process of inverse problems within the Bayesian framework. The stabilization of the inverse problem due to the state reduction improves the solution. The approach simplifies the tuning of MCMC methods.

Inverse problems are often marked by highly dimensional state vectors. The high dimension affects the quality of the estimation result as well as the computational complexity of the estimation problem. This paper aims to present a state reduction technique based on prior knowledge.

Ill-posed inverse problems require prior knowledge to find a stable solution. The prior distribution is constructed for the high-dimensional data space. The authors use the prior distribution to construct a reduced state description based on a lower-dimensional basis, which they derive from the prior distribution. The approach is tested for the inverse problem of electrical capacitance tomography.

Based on a singular value decomposition of a sample-based prior distribution, a reduced state model can be constructed, which is based on principal components of the prior distribution. The approximation error of the reduced basis is evaluated, showing good behavior with respect to the achievable data reduction. Owing to the structure, the reduced state representation can be applied within existing algorithms.

The full state description is a linear function of the reduced state description. The reduced basis can be used within any existing reconstruction algorithm. Increased noise robustness has been found for the application of the reduced state description in a back projection-type reconstruction algorithm.

The paper presents the construction of a prior-based state reduction technique. Several applications of the reduced state description are discussed, reaching from the use in deterministic reconstruction methods up to proposal generation for computational Bayesian inference, e.g. Markov chain Monte Carlo techniques.

Nonlinear solution approaches for inverse problems require fast simulation techniques for the underlying sensing problem. In this work, the authors investigate finite element (FE) based sensor simulations for the inverse problem of electrical capacitance tomography. Two known computational bottlenecks are the assembly of the FE equation system as well as the computation of the Jacobian. Here, existing computation techniques like adjoint field approaches require additional simulations. This paper aims to present fast numerical techniques for the sensor simulation and computations with the Jacobian matrix.

For the FE equation system, a solution strategy based on Green’s functions is derived. Its relation to the solution of a standard FE formulation is discussed. A fast stiffness matrix assembly based on an eigenvector decomposition is shown. Based on the properties of the Green’s functions, Jacobian operations are derived, which allow the computation of matrix vector products with the Jacobian for free, i.e. no additional solves are required. This is demonstrated by a Broyden–Fletcher–Goldfarb–Shanno-based image reconstruction algorithm.

MATLAB-based time measurements of the new methods show a significant acceleration for all calculation steps compared to reference implementations with standard methods. E.g. for the Jacobian operations, improvement factors of well over 100 could be found.

The paper shows new methods for solving known computational tasks for solving inverse problems. A particular advantage is the coherent derivation and elaboration of the results. The approaches can also be applicable to other inverse problems.