Log In Sign Up

On the identification of piecewise constant coefficients in optical diffusion tomography by level set

by   J. P. Agnelli, et al.

In this paper, we propose a level set regularization approach combined with a split strategy for the simultaneous identification of piecewise constant diffusion and absorption coefficients from a finite set of optical tomography data (Neumann-to-Dirichlet data). This problem is a high nonlinear inverse problem combining together the exponential and mildly ill-posedness of diffusion and absorption coefficients, respectively. We prove that the parameter-to-measurement map satisfies sufficient conditions (continuity in the L^1 topology) to guarantee regularization properties of the proposed level set approach. On the other hand, numerical tests considering different configurations bring new ideas on how to propose a convergent split strategy for the simultaneous identification of the coefficients. The behavior and performance of the proposed numerical strategy is illustrated with some numerical examples.


page 1

page 2

page 3

page 4


On inverse doping profile problems for the stationary voltage-current map

We consider the problem of identifying possibly discontinuous doping pro...

A class of regularizations based on nonlinear isotropic diffusion for inverse problems

Building on the well-known total-variation (TV), this paper develops a g...

A Learned SVD approach for Inverse Problem Regularization in Diffuse Optical Tomography

Diffuse Optical Tomography (DOT) is an emerging technology in medical im...

Parametric Level-sets Enhanced To Improve Reconstruction (PaLEnTIR)

In this paper, we consider the restoration and reconstruction of piecewi...

Multiple coefficient identification in electrical impedance tomography with energy functional method

In this paper we investigate the problem of simultaneously identifying t...

Convergence of the Deep BSDE method for FBSDEs with non-Lipschitz coefficients

This paper is dedicated to solve high-dimensional coupled FBSDEs with no...