Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA class of regularizations based on nonlinear isotropic diffusion for inverse problems
68
0
0.0
(
0
)
Added by
Richard Schm\\\"ahl
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Building on the well-known total-variation (TV), this paper develops a general regularization technique based on nonlinear isotropic diffusion (NID) for inverse problems with piecewise smooth solutions. The novelty of our approach is to be adaptive (we speak of A-NID) i.e. the regularization varies during the iterates in order to incorporate prior information on the edges, deal with the evolution of the reconstruction and circumvent the limitations due to the non-convexity of the proposed functionals. After a detailed analysis of the convergence and well-posedness of the method, this latter is validated by simulations perfomed on computerized tomography (CT).
rate research
Read More
Data assisted reconstruction algorithms, incorporating trained neural networks, are a novel paradigm for solving inverse problems. One approach is to first apply a classical reconstruction method and then apply a neural network to improve its solution. Empirical evidence shows that such two-step methods provide high-quality reconstructions, but they lack a convergence analysis. In this paper we formalize the use of such two-step approaches with classical regularization theory. We propose data-consistent neural networks that we combine with classical regularization methods. This yields a data-driven regularization method for which we provide a full convergence analysis with respect to noise. Numerical simulations show that compared to standard two-step deep learning methods, our approach provides better stability with respect to structural changes in the test set, while performing similarly on test data similar to the training set. Our method provides a stable solution of inverse problems that exploits both the known nonlinear forward model as well as the desired solution manifold from data.
This paper develops manifold learning techniques for the numerical solution of PDE-constrained Bayesian inverse problems on manifolds with boundaries. We introduce graphical Matern-type Gaussian field priors that enable flexible modeling near the boundaries, representing boundary values by superposition of harmonic functions with appropriate Dirichlet boundary conditions. We also investigate the graph-based approximation of forward models from PDE parameters to observed quantities. In the construction of graph-based prior and forward models, we leverage the ghost point diffusion map algorithm to approximate second-order elliptic operators with classical boundary conditions. Numerical results validate our graph-based approach and demonstrate the need to design prior covariance models that account for boundary conditions.
In the current work we present two generalizations of the Parallel Tempering algorithm, inspired by the so-called continuous-time Infinite Swapping algorithm. Such a method, found its origins in the molecular dynamics community, and can be understood as the limit case of the continuous-time Parallel Tempering algorithm, where the (random) time between swaps of states between two parallel chains goes to zero. Thus, swapping states between chains occurs continuously. In the current work, we extend this idea to the context of time-discrete Markov chains and present two Markov chain Monte Carlo algorithms that follow the same paradigm as the continuous-time infinite swapping procedure. We analyze the convergence properties of such discrete-time algorithms in terms of their spectral gap, and implement them to sample from different target distributions. Numerical results show that the proposed methods significantly improve over more traditional sampling algorithms such as Random Walk Metropolis and (traditional) Parallel Tempering.
In this article, we discuss the numerical solution of diffusion equations on random surfaces within the isogeometric framework. Complex computational geometries, given only by surface triangulations, are recast into the isogeometric context by transforming them into quadrangulations and a subsequent interpolation procedure. Moreover, we describe in detail, how diffusion problems on random surfaces can be modelled and how quantities of interest may be derived. In particular, we propose a low rank approximation algorithm for the high-dimensional space-time correlation of the random solution. Extensive numerical studies are provided to quantify and validate the approach.
In this paper, by employing the asymptotic method, we prove the existence and uniqueness of a smoothing solution for a singularly perturbed Partial Differential Equation (PDE) with a small parameter. As a by-product, we obtain a reduced PDE model with vanished high order derivative terms, which is close to the original PDE model in any order of this small parameter in the whole domain except a negligible transition layer. Based on this reduced forward model, we propose an efficient two step regularization algorithm for solving inverse source problems governed by the original PDE. Convergence rate results are studied for the proposed regularization algorithm, which shows that this simplification will not (asymptotically) decrease the accuracy of the inversion result when the measurement data contains noise. Numerical examples for both forward and inverse problems are given to show the efficiency of the proposed numerical approach.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
