We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The aim of this paper is to provide and numerically test in the presence of measurement noise a procedure for target classification in wave imaging based on comparing frequency-dependent distribution descriptors with precomputed ones in a dictionary of learned distributions. Distribution descriptors for inhomogeneous objects are obtained from the scattering coefficients. First, we extract the scattering coefficients of the (inhomogeneous) target from the perturbation of the reflected waves. Then, for a collection of inhomogeneous targets, we build a frequency-dependent dictionary of distribution descriptors and use a matching algorithm in order to identify a target from the dictionary up to some translation, rotation and scaling.
We study the numerical identification of an unknown portion of the boundary on which either the Dirichlet or the Neumann condition is provided from the knowledge of Cauchy data on the remaining, accessible and known part of the boundary of a two-dimensional domain, for problems governed by Helmholtz-type equations. This inverse geometric problem is solved using the plane waves method (PWM) in conjunction with the Tikhonov regularization method. The value for the regularization parameter is chosen according to Hansen's L-curve criterion. The stability, convergence, accuracy and efficiency of the proposed method are investigated by considering several examples.
An optimal control problem is considered to find a stable surface traction, which minimizes the discrepancy between a given displacement field and its estimation. Firstly, the inverse elastic problem is constructed by variational inequalities, and a stable approximation of surface traction is obtained with Tikhonov regularization. Then a finite element discretization of the inverse elastic problem is analyzed. Moreover, the error estimation of the numerical solutions is deduced. Finally, a numerical algorithm is detailed and three examples in two-dimensional case illustrate the efficiency of the algorithm.
In this paper, we introduce and study a new method for solving inverse source problems, through a working model that arises in bioluminescence tomography (BLT). In the BLT problem, one constructs quantitatively the bioluminescence source distribution inside a small animal from optical signals detected on the animal's body surface. The BLT problem possesses strong ill-posedness and often the Tikhonov regularization is used to obtain stable approximate solutions. In conventional Tikhonov regularization, it is crucial to choose a proper regularization parameter for trade off between the accuracy and stability of approximate solutions. The new method is based on a combination of the boundary condition and the boundary measurement in a parameter-dependent single complex Robin boundary condition, followed by the Tikhonov regularization. By properly adjusting the parameter in the Robin boundary condition, we achieve two important properties for our new method: first, the regularized solutions are uniformly stable with respect to the regularization parameter so that the regularization parameter can be chosen based solely on the consideration of the solution accuracy; second, the convergence order of the regularized solutions reaches one with respect to the noise level. Then, the finite element method is used to compute numerical solutions and a new finite element error estimate is derived for discrete solutions. These results improve related results found in the existing literature. Several numerical examples are provided to illustrate the theoretical results.
In this paper, an inverse source problem for the time-fractional diffusion equation is investigated. The observational data is on the final time and the source term is assumed to be temporally independent and with a sparse structure. Here the sparsity is understood with respect to the pixel basis, i.e., the source has a small support. By an elastic-net regularization method, this inverse source problem is formulated into an optimization problem and a semismooth Newton (SSN) algorithm is developed to solve it. A discretization strategy is applied in the numerical realization. Several one and two dimensional numerical examples illustrate the efficiency of the proposed method.
The inverse problem of identifying the time-independent source term and initial value simultaneously for a time-fractional diffusion equation is investigated. This inverse problem is reformulated into an operator equation based on the Fourier method. Under a certain smoothness assumption, conditional stability is established. A standard Tikhonov regularisation method is proposed to solve the inverse problem. Furthermore, the convergence rate is given for an a priori and a posteriori regularisation parameter choice rule, respectively. Several numerical examples, including one-dimensional and two-dimensional cases, show the efficiency of our proposed method.
A novel method is developed for solving the inverse problem of reconstructing the shape of an interior cavity. The boundary of the cavity is assumed to be a small and smooth perturbation of a circle. The incident field is generated by a point source inside the cavity. The scattering data is taken on a circle centered at the source. The method requires only a single incident wave at one frequency. Using a transformed field expansion, the original boundary value problem is reduced to a successive sequence of two-point boundary value problems and is solved in a closed form. By dropping higher order terms in the power series expansion, the inverse problem is linearized and an explicit relation is established between the Fourier coefficients of the cavity surface function and the total field. A nonlinear correction algorithm is devised to improve the accuracy of the reconstruction. Numerical results are presented to show the effectiveness of the method and its ability to obtain subwavelength resolution.
In this paper, we study to use nonlocal bounded variation (NLBV) techniques to decompose an image intensity into the illumination and reflectance components. By considering spatial smoothness of the illumination component and nonlocal total variation (NLTV) of the reflectance component in the decomposition framework, an energy functional is constructed. We establish the theoretical results of the space of NLBV functions such as lower semicontinuity, approximation and compactness. These essential properties of NLBV functions are important tools to show the existence of solution of the proposed energy functional. Experimental results on both grey-level and color images are shown to illustrate the usefulness of the nonlocal total variation image decomposition model, and demonstrate the performance of the proposed method is better than the other testing methods.
We consider a Robin inverse problem associated with the Laplace equation, which is a severely ill-posed and nonlinear. We formulate the problem as a boundary integral equation, and introduce a functional of the Robin coefficient as a regularisation term. A conjugate gradient method is proposed for solving the consequent regularised nonlinear least squares problem. Numerical examples are presented to illustrate the effectiveness of the proposed method.
This paper studies convergence analysis of an adaptive finite element algorithm for numerical estimation of some unknown distributed flux in a stationary heat conduction system, namely recovering the unknown Neumann data on interior inaccessible boundary using Dirichlet measurement data on outer accessible boundary. Besides global upper and lower bounds established in [23], a posteriori local upper bounds and quasi-orthogonality results concerning the discretization errors of the state and adjoint variables are derived. Convergence and quasi-optimality of the proposed adaptive algorithm are rigorously proved. Numerical results are presented to illustrate the quasi-optimality of the proposed adaptive method.
We propose a new moving pseudo-boundary method of fundamental solutions (MFS) for the determination of the boundary of a three-dimensional void (rigid inclusion or cavity) within a conducting homogeneous host medium from overdetermined Cauchy data on the accessible exterior boundary. The algorithm for imaging the interior of the medium also makes use of radial spherical parametrization of the unknown star-shaped void and its centre in three dimensions. We also include the contraction and dilation factors in selecting the fictitious surfaces where the MFS sources are to be positioned in the set of unknowns in the resulting regularized nonlinear least-squares minimization. The feasibility of this new method is illustrated in several numerical examples.
In this paper, a fast algorithm for Euler’s elastica functional is proposed, in which the Euler’s elastica functional is reformulated as a constrained minimization problem. Combining the augmented Lagrangian method and operator splitting techniques, the resulting saddle-point problem is solved by a serial of subproblems. To tackle the nonlinear constraints arising in the model, a novel fixed-point-based approach is proposed so that all the subproblems either is a linear problem or has a closed-form solution. We show the good performance of our approach in terms of speed and reliability using numerous numerical examples on synthetic, real-world and medical images for image denoising, image inpainting and image zooming problems.
In this paper, we propose a generalized penalization technique and a convex constraint minimization approach for the p-harmonic flow problem following the ideas in [Kang & March, IEEE T. Image Process., 16 (2007), 2251-2261]. We use fast algorithms to solve the subproblems, such as the dual projection methods, primal-dual methods and augmented Lagrangian methods. With a special penalization term, some special algorithms are presented. Numerical experiments are given to demonstrate the performance of the proposed methods. We successfully show that our algorithms are effective and efficient due to two reasons: the solver for subproblem is fast in essence and there is no need to solve the subproblem accurately (even 2 inner iterations of the subproblem are enough). It is also observed that better PSNR values are produced using the new algorithms.
An inverse geometric problem for two-dimensional Helmholtz-type equations arising in corrosion detection is considered. This problem involves determining an unknown corroded portion of the boundary of a two-dimensional domain and possibly its surface heat transfer (impedance) Robin coefficient from one or two pairs of boundary Cauchy data (boundary temperature and heat flux), and is solved numerically using the meshless method of fundamental solutions. A nonlinear unconstrained minimisation of the objective function is regularised when noise is added into the input boundary data. The stability of the numerical results is investigated for several test examples, with respect to noise in the input data and various values of the regularisation parameters.
In this paper, we give a general proof on convergence estimates for some regularization methods to solve a Cauchy problem for the Laplace equation in a rectangular domain. The regularization methods we considered are: a non-local boundary value problem method, a boundary Tikhonov regularization method and a generalized method. Based on the conditional stability estimates, the convergence estimates for various regularization methods are easily obtained under the simple verifications of some conditions. Numerical results for one example show that the proposed numerical methods are effective and stable.
Durbin (1992) derived a convergent series for the density of the first passage time of a Weiner process to a curved boundary. We show that the successive partial sums of this series can be expressed as the iterates of the standard substitution method for solving an integral equation. The calculation is thus simpler than it first appears. We also show that, under a certain condition, the series converges uniformly. This strengthens Durbin's result of pointwise convergence. Finally, we present a modified procedure, based on scaling, which sometimes works better. These approaches cover some cases that Durbin did not.
Detecting corrosion by electrical field can be modeled by a Cauchy problem of Laplace equation in annulus domain under the assumption that the thickness of the pipe is relatively small compared with the radius of the pipe. The interior surface of the pipe is inaccessible and the nondestructive detection is solely based on measurements from the outer layer. The Cauchy problem for an elliptic equation is a typical ill-posed problem whose solution does not depend continuously on the boundary data. In this work, we assume that the measurements are available on the whole outer boundary on an annulus domain. By imposing reasonable assumptions, the theoretical goal here is to derive the stabilities of the Cauchy solutions and an energy regularization method. Relationship between the proposed energy regularization method and the Tikhonov regularization with Morozov principle is also given. A novel numerical algorithm is proposed and numerical examples are given.
We propose an approximation for the inverse first passage time problem. It is similar in spirit and method to the tangent approximation for the original first passage time problem. We provide evidence that the technique is quite accurate in many cases. We also identify some cases where the approximation performs poorly.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.