No Arabic abstract
We consider an inverse source problem in the stationary radiating transport through a two dimensional absorbing and scattering medium. Of specific interest, the exiting radiation is measured on an arc. The attenuation and scattering properties of the medium are assumed known. For scattering kernels of finite Fourier content in the angular variable, we show how to quantitatively recover the part of the isotropic sources restricted to the convex hull of the measurement arc. The approach is based on the Cauchy problem with partial data for a Beltrami-like equation associated with $A$-analytic maps in the sense of Bukhgeim, and extends authors previous work to this specific partial data case. The robustness of the method is demonstrated by the results of several numerical experiments.
An electrical potential U on bordered surface X (in Euclidien three-dimensional space) with isotropic conductivity function sigma>0 satisfies equation d(sigma d^cU)=0, where d^c is real operator associated with complex (conforme) structure on X induced by Euclidien metric of three-dimensional space. This paper gives exact reconstruction of conductivity function sigma on X from Dirichlet-to-Neumann mapping (for aforementioned conductivity equation) on the boundary of X. This paper extends to the case of the Riemann surfaces the reconstruction schemes of R.Novikov (1988) and of A.Bukhgeim (2008) given for the case of domains in two-dimensional Euclidien space. The paper extends and corrects the statements of Henkin-Michel (2008), where the inverse boundary value problem on the Riemann surfaces was firstly considered.
The MEG inverse problem refers to the reconstruction of the neural activity of the brain from magnetoencephalography (MEG) measurements. We propose a two-way regularization (TWR) method to solve the MEG inverse problem under the assumptions that only a small number of locations in space are responsible for the measured signals (focality), and each source time course is smooth in time (smoothness). The focality and smoothness of the reconstructed signals are ensured respectively by imposing a sparsity-inducing penalty and a roughness penalty in the data fitting criterion. A two-stage algorithm is developed for fast computation, where a raw estimate of the source time course is obtained in the first stage and then refined in the second stage by the two-way regularization. The proposed method is shown to be effective on both synthetic and real-world examples.
We study the inverse source problem for a class of viscoelastic systems from a single boundary measurement in a general spatial dimension. We give specific reconstruction formula and stability estimate for the source in terms of the boundary measurement. Our approaches rely on the exact boundary controllability of the corresponding viscoelastic systems for which we also provide a new proof based on a modification of the well-known moment method.
In two dimensions, we consider the problem of inversion of the attenuated $X$-ray transform of a compactly supported function from data restricted to lines leaning on a given arc. We provide a method to reconstruct the function on the convex hull of this arc. The attenuation is assumed known. The method of proof uses the Hilbert transform associated with $A$-analytic functions in the sense of Bukhgeim.
We consider a free boundary problem on cones depending on a parameter c and study when the free boundary is allowed to pass through the vertex of the cone. We show that when the cone is three-dimensional and c is large enough, the free boundary avoids the vertex. We also show that when c is small enough but still positive, the free boundary is allowed to pass through the vertex. This establishes 3 as the critical dimension for which the free boundary may pass through the vertex of a right circular cone. In view of the well-known connection between area-minimizing surfaces and the free boundary problem under consideration, our result is analogous to a result of Morgan that classifies when an area-minimizing surface on a cone passes through the vertex.