A Scalable Algorithm for Inverse Medium Problems with Multiple Sources

By Keith Kelly

The University of Texas at Austin

Published on


We consider the problem of acoustic scattering as described by the free-space, time-harmonic scalar wave equation given by

$%5Cdisplaystyle %5CDelta v(%5Cmathbf{r}) + k^2(%5Cmathbf{r})v(%5Cmathbf{r}) = -s(%5Cmathbf{r}),$
along with radiation boundary conditions. Here, $ r$ is a point in $ %5Cmathbb{R}^3$, $ s$ is the source term, and $ k$ is the wavenumber. Our formulation is based on potential theory. First we write $ k$ as $ k_0 + k(r) + %5Ceta(r)$, where $ k_0$ is a constant value, $ k(r)$ is a known function of space, and $ %5Ceta$ is the unknown medium perturbation. Then, given the sources $ s(%5Cmathbf{r})$ and detectors outside the perturbation $ %5Ceta$ we solve an inverse problem based on (1) for $ %5Ceta$. We observe the total field only at some (finite dimensional set of) sensor positions. We use multiple events, where we consider independent activations or different sources at different times. This problem is common in many areas of science and engineering such as seismic imaging, subsurface imaging, impedance tomography, non-destructive evaluation, and diffuse optical tomography.
We describe an algorithm for efficiently solving the inverse scattering problem for the low-frequency time-harmonic scalar wave equation with multi-point illumination. The following approach is based on the FaIMS algorithm described by Chaillat and Biros in [1]. First, we compress the number of incident fields (computed by solving the variable coefficient Helmholtz equation with point sources) using a randomized QR factorization to compute a low rank approximation. By compressing the incident fields, we greatly reduce the problem size and by using a randomized QR factorization we can compute an approximation to within a specified tolerance, ensuring that there is not significant information loss. After compressing the incident fields, we can compute the medium perturbation $ %5Ceta$ by solving $ %5CDelta %5Cphi(%5Cmathbf{r}) + k_0^2%5Cphi(%5Cmathbf{r}) = -%5Ceta(%5Cpmb{r})v(%5Cpmb{r})$, where the scattered field $ %5Cphi$ is measured as the difference between the incident field and the measured total field. We transform the Helmholtz equation above into a linear integral equation to obtain
$%5Cdisplaystyle %5Cphi(%5Cpmb{r}') = %5Cint_{%5Cmathbb{R}^3} G(%5Cpmb{r},%5Cpmb{r}')%5Ceta(%5Cpmb{r})(%5Cphi(%5Cpmb{r}) + u(%5Cpmb{r})) d%5Cpmb{r},$
where $ G$ is the Green's function for the Helmholtz operator with wavenumber $ k_0$. Using the Born approximation we can eliminate the dependence of the right hand side of the Lippmann-Schwinger equation on the scattered field. In order to solve for $ %5Ceta$ we use the conjugate gradient method on the normal equations with a randomized QR factorization based preconditioner. To improve the accuracy of the computed solution for slightly larger perturbations of the background medium, we use an iterated Born approximation scheme.
We have extended the results of [1] in a few different ways. In the original paper the background medium was assumed to have a constant wavenumber except for the perturbation, i.e. $ k(r)$ was zero, but here we allow for variable background medium. We expand the types of scatterers allowed; the original paper allowed only point scatterers while we allow for multiple continuous scattering objects. We also make use use of the iterated Born approximation in our solver. Finally, we achieve superior scalability to the approached referenced in the FaIMS paper. We rapidly evaluate the integral for the forward scatterer using a fast multipole method for volume potentials in parallel. Furthermore, we use PETSc for in our implementation for its fast iterative solvers.

Cite this work

Researchers should cite this work as follows:

  • Keith Kelly (2016), "A Scalable Algorithm for Inverse Medium Problems with Multiple Sources," https://nanohub.org/resources/23498.

    BibTex | EndNote


NanoBio Node, Aly Taha

University of Illinois at Urbana-Champaign