Convexification Method for an Inverse Scattering Problem and Its Performance for Experimental Backscatter Data for Buried Targets

Authors: Michael Victor Klibanov, Aleksandr Kolesov, Nguyen Dinh Liem,

https://doi.org/10.1137/18M1191658

Publisher, magazine: ,

Publication year: 2019

  Lưu        Trích dẫn         Chia sẻ

Abstract

We present in this paper a novel numerical reconstruction method for solving a three-dimensional inverse scattering problem with scattering data generated by a single direction of the incident plane wave. This problem is well known to be a highly nonlinear and ill-posed problem. Therefore, optimization-based reconstruction methods for solving this problem would typically suffer from the local-minima trapping and require strong a priori information of the solution. To avoid these problems, in our numerical method, we aim to construct a cost functional with a globally strictly convex property, whose minimizer can provide a good approximation for the exact solution of the inverse problem. The key ingredients for the construction of such a functional are an integro-differential formulation of the inverse problem and a Carleman weight function. Under a (partial) finite difference approximation, the global strict convexity is proven using the tool of Carleman estimates. The global convergence of the gradient projection method to the exact solution is proven as well. We demonstrate the efficiency of our reconstruction method via a numerical study of experimental backscatter data for buried objects.

Tags: Carleman weight function, Carleman estimates, reconstruction method, convexification, global convergence, inverse scattering problem, experimental data