Abstract
This report extends our recent progress in tackling a challenging 3D inverse scattering problem governed by the Helmholtz equation. Our target application is to reconstruct dielectric constants, electric conductivities and shapes of front surfaces of objects buried very closely under the ground. These objects mimic explosives, like, e.g. antipersonnel land mines and improvised explosive devices. We solve a coefficient inverse problem with the backscattering data generated by a moving source at a fixed frequency. This scenario has been studied so far by our newly developed convexification method that consists in a new derivation of a boundary value problem for a coupled quasilinear elliptic system. However, in our previous work only the unknown dielectric constants of objects and shapes of their front surfaces were calculated. Unlike this, in the current work performance of our numerical convexification algorithm is verified for the case when the dielectric constants, the electric conductivities and those shapes of objects are unknown. By running several tests with experimentally collected backscattering data, we find that we can accurately image both the dielectric constants and shapes of targets of interests including a challenging case of targets with voids. The computed electrical conductivity serves for reliably distinguishing conductive and non-conductive objects. The global convergence of our numerical procedure is shortly revisited.
1. Introduction
In this paper, we present an extension of our previous numerical studies of the performance on both computationally simulated [Citation1] and experimental data [Citation2] of our newly developed globally convergent convexification numerical method for a Coefficient Inverse Problem (CIP) for the Helmholtz equation in the 3D case. This new approach has been established so far to solve a 3D CIP with a fixed frequency and the point source moving along an interval of a straight line. Our target application is in the reconstruction of physical properties of explosive-like objects buried closely under the ground, such as antipersonnel land mines and improvised explosive devices (IEDs). There are four (4) important properties of such targets that we are currently interested in:
Dielectric constants
Locations
Shapes of front surfaces
Electrical conductivities.
The previous work [Citation3] was concerned with the first two properties for a different set of experimental data and for a different version of the convexification method. In [Citation3], the point source was fixed and the frequency was varied. However, shapes of targets of interests or, at the very least, their front surfaces were not accurately imaged in that scenario. This reveals an advantage of the context considered both in [Citation1,Citation2] and in this paper, compared with the previous studies of the research group of the third author.
As we have seen, the dielectric constants and shapes of front surfaces of the targets with different types of materials and geometries can be recovered via the convexification from our experimentally collected data [Citation2]. Thus this paper is about the recovery of the fourth property, the electrical conductivity, simultaneously with the three above ones. We refer to publications of the research group of Novikov for a variety of CIPs with the data at a single frequency [Citation4–8]. Both statements of those CIPs and methods of their treatments are different from ours. Also, we refer to [Citation9] for a different numerical method for a similar CIP.
A conventional way to solve a CIP is numerically via the minimization of a conventional least squares cost functional; see, e.g. [Citation10–12]. The major problem with this approach, however, is that such a functional is nonconvex and typically suffers from the phenomenon of multiple local minima and ravines. Since any gradient-like method stops at any point of a local minimum, then any convergence result for this method would be valid only if the starting point of iterations would be located in a small neighbourhood of the correct solution. However, it is unclear how to a priori find such a point. In other words, conventional numerical methods for CIPs are locally convergent ones.
Definition 1.1
We call a numerical method for a CIP globally convergent if there is a theorem, which claims that this method delivers at least one point in a sufficiently small neighbourhood of the correct solution without any advanced knowledge of this neighbourhood.
The convexification is a globally convergent numerical method. It works with the most challenging case of data collection: our data are both backscattering and non-overdetermined ones. Given a CIP, we call the data for it non-overdetermined if the number m of free variables in the data equals the number n of free variables in the unknown coefficient, i.e. m = n. If m>n, then the data are overdetermined. In this paper, m = n = 3. The authors are unaware about such numerical methods for the CIPs with the non-overdetermined data at , which would be based on the minimization of a conventional least squares cost functional and, at the same time, would be globally convergent in terms of the above definition.
The latter is the reason why the third author and his collaborators have been working on the convexification for a number of years; see, e.g. [Citation13–16] for some first publications in this direction. After a certain change of variables, the convexification constructs a weighted cost functional , where is a parameter. The main element of is the presence of the Carleman Weight Function (CWF) in it. This is the function, which participates as a weight in the Carleman estimate for the corresponding partial differential operator. The main theorem then is that, given a convex bounded set of an arbitrary diameter d in an appropriate Hilbert space H, one can choose such a set of parameters λ that the functional is strictly convex on This guarantees, of course, the absence of local minima and ravines on Using that theorem, the global convergence to the correct solution of the gradient projection method on is established.
The above cited first works on the convexification lacked some theorems justifying the latter global convergence property and, therefore, numerical results in them were not present, except of some first ones in [Citation16]. Fortunately, however, the paper [Citation17] has cleared that global convergence issue, which has resulted in a number of recent publications, where the theory of the convexification is complemented by numerical studies, see, e.g. [Citation1,Citation18–20]. In particular, experimental data are treated by the convexification in [Citation2,Citation3,Citation21]. In [Citation22,Citation23], the second version of the convexification is developed for CIPs for hyperbolic PDEs. Ideas of [Citation22,Citation23] are explored further in [Citation24,Citation25].
In both versions of the convexification, the ideas of the Bukhgeim–Klibanov method play the foundational role. This method is based on Carleman estimates. Initially it was proposed in 1981 only for proofs of uniqueness theorems for multidimensional CIPs; see [Citation26] for the first publication, and a survey of this method can be found in [Citation27].
This paper is organized as follows. In Section 2, we state our CIP. In Section 3, we construct our functional and formulate main theoretical results about it, which we took from our recent work [Citation2]. Finally, in Section 4 we present our numerical results.
2. Statement of the inverse problem
Even though the propagation of electromagnetic waves is governed by the Maxwell's equations, we use only the Helmholtz equation in this paper. Indeed, it was demonstrated numerically in the appendix of the paper [Citation28] that this equation describes the propagation of one component of the electric field equally well with the Maxwell's equations. Another confirmation comes from our successful work with experimental data, both in [Citation2,Citation3] and in this paper.
Let . Prior to the statement of the inverse problem, we first consider the following time-harmonic Helmholtz wave equation with conductivity: (1) (1) Cf. [Citation29, Section 3.3], the function in (Equation1(1) (1) ) can be physically understood as a component of the electric field , which corresponds to a single nonzero component of the incident field. In our case, this component is (voltage) which is being incident upon the medium. The backscattering signal of the same component was measured in our experiments. In (Equation1(1) (1) ), ω is the angular frequency (), represent respectively the permeability (), permittivity () and (effective) conductivity () of the medium. Furthermore, is the point source which will be defined below.
Suppose that we only consider non-magnetic targets. Then their relative permeability has to be unity. With being the vacuum permittivity and vacuum permeability, respectively, and , (Equation1(1) (1) ) becomes (2) (2) In (Equation2(2) (2) ), the fraction is essentially close to the so-called characteristic impedance of free space , which is approximately 377 (). Denote as the dielectric constant. We therefore rewrite the Helmholtz equation (Equation2(2) (2) ) and impose the Sommerfeld radiation condition: (3) (3) (4) (4)
We now pose the inverse problem. Consider a rectangular prism in for numbers R, b>0. This prism is our computational domain of interest. Let and be the spatially distributed dielectric constant and electrical conductivity of the medium, respectively. We assume that these functions are smooth and satisfy the following conditions: (5) (5) The second line of (Equation5(5) (5) ) means that we are assuming to have vacuum outside of the domain of interest Ω. Let the number d>b and let . We consider the line of sources, (6) (6) This line is parallel to the x-axis and is located outside of the closed domain . The distance between and the xy-plane is d, and the length of the line of sources is . Using this setting, we arrange for each the point source located on the straight line . We also define the near-field measurement site as the lower side of the prism Ω, To this end, we use either α or to indicate the dependence of a function/parameter/number on those point sources. We denote by u, and the total wave, incident wave and scattered wave, respectively. Also, we note that .
Forward problem
Given the wavenumber k>0 and the functions the forward problem is to seek the function such that the function is the solution of problem (Equation3(3) (3) )–(Equation4(4) (4) ).
Here, the incident wave is (7) (7) Moreover, we can deduce that the scattered wave is (8) (8) since functions c−1 and σ are compactly supported in Ω; see (Equation5(5) (5) ). We then combine (Equation7(7) (7) ) and (Equation8(8) (8) ) to obtain the Lippmann–Schwinger equation [Citation30]: In fact, we generate our data via solving this equation.
Coefficient Inverse Problem (CIP)
Given k>0, the CIP is to reconstruct the two smooth functions: the dielectric constant and the conductivity for satisfying conditions (Equation5(5) (5) ) from the boundary measurement of the near-field data, (9) (9) where is the total wave associated with the incident wave of (Equation7(7) (7) ).
Remark 2.1
Although the far-field data are collected in our experimental setup, our CIP is posed for the case of the near-field data. Experimentally measured backscattering far-field data are not convenient to work with since they do not provide a good indication of the location of the target of interest. This is clear from, e.g. Figure (left). The same observation took place in [Citation2] and [Citation31]. Besides, if using the far-field data in the inversion procedure described below, then the computational domain would be very large. The latter would lead to a significant increase of the computational time and would put unnecessary demands on computer's memory. These considerations led the authors of [Citation2,Citation31] to the so-called ‘data propagation procedure’. By getting rid of high spatial frequencies, this procedure essentially delivers a good approximation for both the near-field data in (Equation9(9) (9) ) (i.e. data at the assigned boundary Γ) and the z-derivative of the function on Γ, (10) (10) In our experience, the function is much more informative than the raw far-field: compare, e.g. left and right figures (Figure ).
Table 1. Chosen wavenumbers, frequencies and wavelength for Examples 1–5.
Table 2. True , computed dielectric constants and computed conductivity of Examples 1–5 of experimental data. True values of dielectric constants were taken from: (a) Examples 1, 4, 5: formula (7.2) of [Citation40], (b) Example 2 (clear water) [Citation38], (c) Example 3 [Citation41].
Remark 2.2
In our experimental setup (cf. Section 4), the inclusions are buried in a sandbox. The sand in this box is our background medium. We know a priori that the dielectric constant and electric conductivity of this sand are and respectively. Although we do not use this information in our numerical method described below, still inclusions in our resulting images are characterized by such values of the parameters and that c>4 and Naturally, a postprocessing procedure is applied to get reasonable values of these parameters inside the inclusions, see Step 3 of section 4.1. The functions and in our mathematical statements involve the information of both sand and inclusion. To resolve this issue, in our configuration we measure the raw data twice: when the sandbox is without and with the buried target, respectively. Heuristically, subtraction of these data should be helpful in filtering the information of sand. Our resulting ‘actual’ data (after subtraction) can be applied to the mathematical setting under consideration.
3. A globally convergent numerical method
3.1. A system of coupled quasilinear elliptic PDEs
Since our line of sources is located outside of , we deduce this system from the homogeneous version of Equation (Equation3(3) (3) ) and for each (11) (11) We set which then leads to (12) (12) It was established in [Citation32] that, under certain conditions, the function is nowhere nonzero at every point in Ω for sufficiently large values of k, at least in the case when This, in turn, has allowed in [Citation1] to uniquely define the function for those values of k. Thus we assume below that we can uniquely define the function as in [Citation1]. We note, however, that the condition is more important for our derivations below than just defining . This is because only derivatives and are involved below and these derivatives are defined uniquely of course.
Denote . We define the function as Hence, one computes that (13) (13) Note that is the fundamental solution of Equation (Equation11(11) (11) ) when and . We have (14) (14) Thus it follows from (Equation11(11) (11) ) and (Equation14(14) (14) ) that Therefore, combining (Equation11(11) (11) )–(Equation13(13) (13) ) we derive the equation for v, (15) (15) We now differentiate (Equation15(15) (15) ) with respect to α and use (Equation12(12) (12) ) to obtain the following third-order PDE: (16) (16) where, for
Remark 3.1
It is obvious that if the function is known, then we can immediately find the target coefficients and by taking the real and imaginary parts of the left-hand side of (Equation15(15) (15) ). In order to get rid of the presence of those unknowns in (Equation15(15) (15) ), we take advantage of the moving point source via the differentiation with respect to α. This leads to solving the nonlinear third order PDE (Equation16(16) (16) ), which is not an easy task. To overcome this, we apply the Fourier series approach using a special orthonormal basis with respect to α.
For , let be the special orthonormal basis in , which was first proposed in [Citation33]. Herewith, the construction of this basis is shortly revisited. For each , let for . The set is linearly independent and complete in . Using the Gram–Schmidt orthonormalization procedure, we can obtain the orthonormal basis in , which possesses the following special properties:
for all ;
Let , where denotes the scalar product in . Then the square matrix for is invertible with if m = n and if n<m.
We note that in the cases of both classical orthonormal polynomials and the basis of trigonometric functions, the first term is a constant, which implies and This means that the matrix is not invertible for neither of these cases. Meanwhile, our matrix is an upper diagonal matrix with . On the other hand, the special second property allows us to reduce the third-order PDE (Equation16(16) (16) ) to a system of coupled elliptic PDEs.
Given , we consider the following truncated Fourier series for v: (17) (17) As in [Citation1,Citation2], we substitute (Equation17(17) (17) ) into (Equation16(16) (16) ), multiplying both sides of the resulting equation by for and then taking the integration with respect to α, we obtain the following system of coupled elliptic equations: (18) (18) (19) (19) (20) (20) where is the outward looking normal vector on Here, is the unknown vector function given by (21) (21) Boundary conditions (Equation20(20) (20) ) are Cauchy data and are overdetermined ones. A Lipschitz stability estimate for problem (Equation18(18) (18) )–(Equation20(20) (20) ) is obtained in [Citation1] using a Carleman estimate with the same CWF as we work with below.
In PDE (Equation18(18) (18) ), we denote , where is quadratic with respect to the first derivative of components of , (22) (22)
Remark 3.2
In (Equation20(20) (20) ), the boundary value at Γ is a direct application of the expansion (Equation17(17) (17) ) to the near field data (Equation9(9) (9) ). As mentioned in Remark 2.1, using the data propagation technique will result in an approximation of the z -derivative of the function u at Γ, see (Equation10(10) (10) ). The function generates the Neumann boundary condition in (Equation20(20) (20) ) at Γ. It is shown in [Citation2] that the zero Neumann boundary condition (Equation19(19) (19) ) at follows from an approximation of the radiation condition (Equation4(4) (4) ).
Remark 3.3
From now on we work only within the framework of an approximate mathematical model. This means that we fix the number N of Fourier harmonics in the truncated Fourier series (Equation17(17) (17) ) and ignore the residual in (Equation18(18) (18) ). Furthermore, we cannot prove convergence of our method at since such a proof is an extremely challenging problem. We refer to [Citation1] for a detailed discussion of this issue. We also note that similar approximate mathematical models without proofs of convergence at are actually used quite often in the field of inverse problems. In this regard, we refer to [Citation4–8,Citation34,Citation35].
3.2. Weighted cost functional in partial finite differences
We set (23) (23) Let the numbers and . We define our CWF as (24) (24) The choice is based on the fact that the gradient of the CWF should not vanish in the closed domain . Our CWF is decreasing for and Therefore, the CWF (Equation24(24) (24) ) attains its maximal value on the site Γ, and it attains its minimal value on the opposite side. By this way, it ‘maximizes’ the influence of the measured boundary data at z = −b. Furthermore, the notion behind this use of the CWF is to ‘convexify’ the cost functional globally and, especially, to control the nonlinear term in (Equation18(18) (18) ).
3.2.1. Abstract setting and notation
While the convergence analysis in [Citation1] was done for the case when derivatives in (Equation18(18) (18) )–(Equation20(20) (20) ), (Equation23(23) (23) )) are considered in their regular continuous setting, in [Citation2], so as in the current paper, we consider the convergence analysis for the case when (Equation18(18) (18) )–(Equation20(20) (20) ), (Equation23(23) (23) ) are written via ‘partial finite differences’. This means that we use finite differences with respect the variables x, y and keep the standard derivatives with respect to z. It was pointed out in [Citation2] that an important reason of doing so is that partial finite differences allow us not to use the penalty regularization term in our weighted cost functional, which is convenient for computations. When doing so, we use the same grid step size h in x and y directions and do not allow h to tend to zero. Note that it is impractical to use too small grid step sizes in computations. Consider two partitions of the interval Then, for any N-dimensional vector function , we denote by the corresponding semi-discrete function defined at grid points . Thus the interior grid points are . Denote Henceforth, the corresponding Laplace operator in partial finite differences is given by , where, for interior points of , we use and similarly for . We define for interior points . Here, . Hence, the differential operator (Equation23(23) (23) ) has the following form in the partial finite differences: (25) (25) To simplify the presentation, we consider any N–D complex valued function i as the –D vector function with real valued components .
Denote the vector function where Next, we consider D vector functions (26) (26) where and In notations of spaces below, the subscript ‘’ means that this space consists of such vector functions. As in [Citation2], we consider the Hilbert spaces and of semi-discrete real valued functions: Denote the scalar product in the space . The subspace is defined as Let be a fixed positive number. We assume below that (27) (27) For an arbitrary M>0 let the sets and be (28) (28) (29) (29)
3.2.2. Minimization problem and convergence results
Under the partial finite differences setting, we seek an approximate solution of system (Equation18(18) (18) )–(Equation20(20) (20) ) using the minimization of the following weighted Tikhonov-type functional. We define the cost functional as follows: (30) (30) In (Equation30(30) (30) ), we have denoted see (Equation21(21) (21) ) and (Equation26(26) (26) ). Also, the CWF is defined in (Equation24(24) (24) ), and the operator is as in (Equation25(25) (25) ). The minimization problem is formulated as:
Minimize the cost functional on the set , where the set is defined in (Equation28(28) (28) ).
We now formulate theorems of our convergence analysis. Those theoretical results were proven in [Citation2]. It is worth mentioning that our results below are valid only under condition (Equation27(27) (27) ). Restricting from below our grid step size h by a constant is well-suited to our numerical context. In fact, it is impractical to use too fine discretization. We begin with the Carleman estimate for the Laplace operator in partial finite differences.
Theorem 3.1
Carleman estimate in partial finite differences
There exist a sufficient large constant and a number depending only on numbers such that for all and for all vector functions the following Carleman estimate holds: (31) (31)
The next theorem is about the global strict convexity of the cost functional .
Theorem 3.2
Global strict convexity: the central theorem
For any the functional defined in (Equation30(30) (30) ) has its Fréchet derivative at any point . Let be the number of Theorem 3.1. There exist numbers and depending only on listed parameters such that for all the functional is strictly convex on the set . More precisely, the following estimate holds: (32) (32)
Below denotes different numbers depending only on listed parameters. We now formulate a theorem about the Lipschitz continuity of the Fréchet derivative on the set . We omit the proof of this result because it is similar to the proof of Theorem 3.1 in [Citation17].
Theorem 3.3
The Lipschitz continuity on the set holds for the Fréchet derivative Namely, there exists a number depending only on numbers such that for any pair the following estimate is valid:
The following theorem establishes the existence and uniqueness of the minimizer of the functional on the set This theorem follows from a combination of Theorems 3.2 and 3.3 with Lemma 2.1 and Theorem 2.1 of [Citation17].
Theorem 3.4
Let be the number of Theorem 3.2. For any there exists a unique minimizer of the functional on the set . In addition, (33) (33)
In the regularization theory, minimizers of the functional for different levels of the noise in the data are called ‘regularized solutions’ [Citation36,Citation37]. We now establish the accuracy estimate of our regularized solutions depending on the noise level in the data. Using (Equation25(25) (25) ), we obtain the following analog of problem (Equation18(18) (18) )–(Equation20(20) (20) ) in partial finite differences: (34) (34) (35) (35) (36) (36) Following the Tikhonov regularization concept [Citation36,Citation37], we assume that there exists an exact solution of problem (Equation34(34) (34) )–(Equation36(36) (36) ) with the noiseless data and . The subscript ‘ * ’ is used only for the exact solution. Note that the data are always noisy and we denote the noise level by . Besides, we assume that (37) (37) We assume that there exist two vector functions such that (38) (38) (39) (39) (40) (40) (41) (41) (42) (42)
The following theorem provides the accuracy estimate of the minimizer .
Theorem 3.5
Accuracy estimate of regularized solutions
Assume that conditions (Equation37(37) (37) )–(Equation42(42) (42) ) are valid. Let be the number of Theorem 3.3. Let be the minimizer of the functional (Equation30(30) (30) ), which is found in Theorem 3.4. Then the following accuracy estimate holds for all (43) (43)
For each consider the vector function Then (Equation41(41) (41) ) implies that (44) (44) (45) (45) see (Equation29(29) (29) ) for Consider the functional defined as (46) (46) Theorem 3.6 follows immediately from Theorems 3.3–3.5 and (Equation44(44) (44) )–(Equation46(46) (46) ).
Theorem 3.6
For any the functional has its Fréchet derivative at any point and this derivative is Lipschitz continuous on Let and be the numbers of Theorem 3.2. Denote and . Then for any the functional is strictly convex on the ball i.e. the following analog of estimate (Equation32(32) (32) ) holds for all Furthermore, there exists a unique minimizer of the functional on the closed ball and the following inequality holds: Finally, let Then the direct analog of (Equation43(43) (43) ) holds where is replaced with and remains.
We now construct the gradient projection method of the minimization of the functional on the closed ball . Let be the orthogonal projection operator of the space on . Let be an arbitrary point of this ball. Let be a number which we chose in Theorem 3.7. The sequence of the gradient projection method is: (47) (47) By Theorem 3.6, it holds that . Since , then all three terms in (Equation47(47) (47) ) belong to .
Theorem 3.7
Global convergence of the gradient projection method
Assume that conditions of Theorem 3.6 hold and let . Then there exists a number depending only on listed parameters such that for every there exists a number depending on γ such that for these values of γ the sequence (Equation47(47) (47) ) converges to and the following convergence rate holds: (48) (48) In addition, (49) (49)
Remark 3.4
Since the radius of the ball is , where M is an arbitrary number and since the starting point of iterations of the sequence (Equation47(47) (47) ) is an arbitrary point of then Theorem 3.7 actually claims the global convergence of the sequence (Equation47(47) (47) ) to the exact solution, as long as the level of the noise in the data δ tends to zero; see Introduction for the definition of the global convergence.
To close this section, let the function be the one obtained after the substitution of the components of the vector function in the real part of Equation (Equation15(15) (15) ). Similarly, let be obtained after the substitution of the components of the vector function . In the same vein, considering the imaginary part of Equation (Equation15(15) (15) ) we obtain the functions and , respectively. Then, the following convergence estimates follow from Theorem 3.7:
4. Experimental study
4.1. Measured data
Our raw data were experimentally collected at the microwave facility of The University of North Carolina at Charlotte (UNCC). For brevity, we skip the experimental setup and data acquisition because they were detailed in [Citation2]. However, we recall that these are far field backscattering data being collected for objects buried in a sandbox. As mentioned in Remark 2.1, we need to apply the data propagation technique which approximates the near field data for our CIP. This technique was derived in [Citation31] and was revisited in [Citation2].
We introduce dimensionless spatial variables as . This means that the dimensions we use below are 10 times less than the real ones in centimetres. Cf. Figure , we briefly describe our experiment with relatively small targets. Typically the sizes of antipersonnel land mines and improvised explosive devices are between 0.5 and 1.5 (i.e. between 5 cm and 15 cm), see, e.g. [Citation31]. We have used a wooden-like framed box filled with the dry sand and covered by bending styrofoam layers from the front and back. The experimental objects were buried in that sand. The dielectric constant and the electrical conductivity of that sand, i.e. these parameters of the background were and Note that in the styrofoam c = 1 and Therefore, the styrofoam should not affect neither the incident nor the scattered electric waves. As to the line of sources defined in (Equation6(6) (6) ), we have d = 9, and with 0.1 mesh-width.
For each source position, we have collected two sets of complex valued data u. The first set is the reference data, i.e. the data for the case when only the sand was present in that box, and a target of interest was not present. The second set of the data was for the case when that unknown target, which we want to image, was buried in that sandbox. We do not know yet whether or not we can work with the scenario when the reference data are not measured. We point out, however, that in previous works of this group on experimental data for buried targets, the data for the reference medium were also collected [Citation3,Citation31, Citation38].
For each position of the source, the raw data consist of multi-frequency backscatter data associated with 300 frequency points uniformly distributed between 1 GHz to 10 GHz. However, for each selected target, only a single frequency for each target was used in our computations, i.e. our data are non-overdetermined ones with see Introduction of the definition of non-overdetermined data. The backscattering data were measured on a square, which was a part of a plane. The dimensions of this square were in dimensionless units. These measurements were done by a detector which was moving in both vertical and horizontal direction with the moving step size 0.2. Thus total positions of the detector on that measurement plane were used for each position of the source. It is worth noting that not all propagated data have a good quality. Therefore, we need to choose proper data among those frequency-dependent data sets for each target of interest. We tabulate in Table the chosen wavenumber k as well as the corresponding frequency for each test, using the standard dimensionless formulation . We now briefly summarize the crucial steps of the data preprocessing to obtain fine near-field data for our CIP from the raw backscattering ones. Comparison of the raw and propagated data in Figures (a,b), (a,b), (a,b), (a,b), (a,b) justifies this data preprocessing procedure.
Step 1. Subtract the reference data from the far-field measured data for every frequency and for each source position. The reference data mean the ones measured when the sandbox is without a target. This subtraction helps to extract the pure signals, which always contain unwanted noises, from buried objects from the whole signal. In our computations, we treat the resulting data as the ones for the background values as in vacuum, i.e. and The latter is our heuristic assumption, which, nevertheless, works quite well for our reconstructions.
Step 2. For each position of the source, apply the data propagation procedure to approximate the near field data. We propagated the data up to the sand surface, i.e. after getting through the styrofoam layer. As a result, good estimates of x, y coordinates of buried objects were obtained, see Figures (a,b), (a,b), (a,b), (a,b), (a,b). Besides, this procedure reduces the size of the computational domain in the z -direction.
Step 3. Truncate the obtained near field data to get rid of random oscillations that appear randomly during the data propagation. Suppose the function represents those near field data. We truncate this function in two steps A and B:
A. Replace with the function defined as (50) (50) Here, represents the truncation number and we take based upon the trial and error procedure. This means that we only preserve those propagated near field data whose absolute values are at least 40% of their global maximum value.
B. Smooth the function using the Gaussian filter. However, we have observed that the maximal absolute value of the smoothed function is less than that value of the original function This, however, results in lesser values of the computed dielectric constants of targets we image. Thus we preserve those maximal absolute values. More precisely, we replace the function with the function . We call the ‘retrieval number’. This number is defined as , where is the maximal absolute value of .
The distance between the measurement plane and the sandbox with the styrofoam layer is about 11.05. Meanwhile, the length in the z direction of the sandbox without the styrofoam is 4.4. Since the thickness of the bending front styrofoam layer is 0.5, then the domain of interests Ω should be which implies that R = 5 and b = 2. The near-field measurement site is then . Given that by Table our average frequency was 4.28 GHz, we remark that our average wavelength was about 7 cm (cf. [Citation39]), which is 0.7 in our dimensionless units. Therefore, it is clear that the dimensions in x and y of the prism are about 14 times larger than the dimension of the wavelength. Besides, in the z direction, it is over 5 wavelengths. Also, we report that the distance between the far field measurement site and the zero point of our coordinate system was 14. Thus the distance between the measurement site and the zero point of our coordinate system was about 20 wavelengths, which is a far field zone.
4.2. Reconstruction results
Five (5) examples for our reconstructions of buried objects are presented here. They are basically in-store items that one can purchase easily. Nevertheless, they really mimic some well-known metallic and non-metallic antipersonnel land mines met during the World War eras. More precisely, this is true for images presented on Figure (c) that follows the NO-MZ 2B mine and in Figure (c) that imitate the Glassmine 43 of the Germans; see [Citation2, Section 4.2]. For brevity, photos and descriptions of these five experimental objects are presented in Figures (c), (c), (c), (c), (c) and Table , where the reader can find their distinctive levels of geometry and materials.
Cf. those cited in [Citation2], the sizes of such military antipersonnel land mines are only between 0.5 and 1.5. We focus on finding them in a sub-domain of Ω with only 2 in depth in the z-direction. Denote this sub-domain by . This results in the following choice of our starting point of iterations in the minimization of the functional . Denote that starting point by the vector with (51) (51) Recall that and are the Fourier coefficients of the propagated data in (Equation36(36) (36) ). Here, is the smooth function given by This function attains the maximal value 1 at z = −b exactly where the near-field data are given. Then, it holds that , . Moreover, χ tends to 0 as leading to Hence, our starting point (Equation51(51) (51) ) satisfies the boundary conditions (Equation36(36) (36) ).
Even though our analysis in Section 3 is applicable to the semi-discrete form of the functional defined in (Equation30(30) (30) ), to perform computations, we naturally write it in the fully discrete form. In this form, we take the uniform mesh in x, y, z directions, , where the mesh sizes in x, y, z directions are the same. For brevity, we do not bring in here this fully discrete form of After obtaining the global minimum of the functional , we compute the unknown coefficients and as follows: aided by (Equation15(15) (15) ); see also Remark 3.1. Here mean denotes the average value with respect to the positions of the source α. The number 0.1 presented in the computed conductivity is due to its physical unit in this dimensionless regime. Since the number of point sources is very limited, we use the Gauss–Legendre quadrature method to compute the measured near-field data in the Fourier series.
Here, we use the gradient descent method for the minimization of the target functional of (Equation30(30) (30) ) due to its easy implementation. Even though Theorem 3.7 claims the global convergence of the gradient projection method, our success in working with the gradient descent method is similar with those in all previous publications that study the convexification [Citation1,Citation3,Citation18–21]. As to the value of the parameter λ in even though the above theorems require large values of λ, our numerical experience tells us that we can choose a moderate value , which was in the range chosen in all above cited publications on the convexification.
Concerning the step size γ of the gradient descent method, we start from . On each step of iterations , the next step size if the value of the functional on the step m exceeds its value of the previous step. Otherwise, we set . The minimization process is stopped when either or . As to the gradient of the discrete functional , we apply the technique of Kronecker deltas (cf. e.g. [Citation42] ) to derive its explicit formula. For brevity, we do not provide this formula here.
After the minimization procedure is stopped, we obtain the discrete coefficient of . We apply to the truncation procedure described in the above Step 3 and in (Equation50(50) (50) ). But now we use instead of which was used for the data preprocessing. Denote the resulting function by . Our reconstructed solution, denoted by , is obtained after we smooth by the standard filtering via the smooth3 built-in function in MATLAB. We find by using where the number is found the same way as the number in the above Step 3. As to the coefficient , we follow the same vein with the same truncation parameter.
4.3. Comments
In this work, we do not report the sizes of computed inclusions because this was done in our work [Citation2]. Instead, we apply the following criterion to distinguish between conductive and non-conductive materials: the imaged target is conductive if and it is non-conductive otherwise. However, cf. [Citation29, Section 2.5], this criterion cannot distinguish the intrinsic semiconductors and the insulators, whose conductivities are all less than the unity. At this moment, our Table shows that the algorithm can detect well the conductors, which are usually metallic. Therefore, our algorithm might potentially be helpful to decrease the number of false alarms.
We use the isosurface built-in function in MATLAB to depict 3D images of computed inclusions. The associated isovalue is 10% of the maximal value of the inclusions.
We now briefly comment on shapes of imaged inclusions. Figure shows that we can image even a tiny part of that bottle: its cap, at least when we image the dielectric constant. Images of Figures – show that we can image non-convex targets and even voids inside of them. Obviously such features are tough to image, given only limited backscattering and non-overdetermined data.
Finally, it is worth mentioning that there should be a limited frequency range that allows us to simultaneously determine the dielectric constant and conductivity in the experimental tests. Experimentally, this range is based upon our observation of the performance of the near-field data propagated from the raw ones. For objects, which are either convex or rather close to convex ones, the propagated data perform well when the frequency is between 2.98 and 4.15 GHz. For those convex but non-metallic targets, the range should be smaller with interval [2.98, 3.43] (GHz). Meanwhile, non-convex targets require higher values of frequency [4.06, 5.50] (GHz). These should be additional information of frequencies tabulated in Table .
Acknowledgments
The first author acknowledges Prof. Dr. Dinh-Liem Nguyen (Kansas, USA) for the fruitful discussions on the experimental setup.
Disclosure statement
No potential conflict of interest was reported by the authors.
Additional information
Funding
References
- Khoa VA, Klibanov MV, Nguyen LH. Convexification for a three-dimensional inverse scattering problem with the moving point source. SIAM J Imaging Sci. 2020;13:871–904.
- Khoa VA, Bidney GW, Klibanov MV, et al. Convexification and experimental data for a 3D inverse scattering problem with the moving point source. Inverse Probl. 2020. doi:10.1088/1361-6420/ab95aa.
- Klibanov MV, Kolesov AE, Nguyen D-L. Convexification method for an inverse scattering problem and its performance for experimental backscatter data for buried targets. SIAM J Imaging Sci. 2019;12(1):576–603.
- Agaltsov AD, Hohage T, Novikov RG. An iterative approach to monochromatic phaseless inverse scattering. Inverse Probl. 2019;35:24001.
- Alekseenko NV, Burov VA, Rumyantseva OD. Solution of the three-dimensional acoustical inverse scattering problem. The modified Novikov algorithm. Acoust Phys. 2008;54:407–419.
- Novikov RG. Multidimensional inverse spectral problem for the equation – Δψ+(v(x)−Eu(x))ψ=0. Functional Anal Appl. 1988;22(4):263–272.
- Novikov RG. The ∂¯-bar approach to approximate inverse scattering at fixed energy in three dimensions. Int Math Res Papers. 2005;2005(6):287–349.
- Novikov RG. An iterative approach to non-overdetermined inverse scattering at fixed energy. Sbornik: Math. 2015;206:120–134.
- Bakushinsky AB, Leonov AS. To the numerical solution of the inverse multi-frequency scalar acoustics problem (2019), preprint at arXiv:1911.10487v1.
- Chavent G. Nonlinear least squares for inverse problems –foundations and step-by-Step guide for applications. New York: Springer; 2009.
- Goncharsky AV, Romanov SY. A method of solving the coefficient inverse problems of wave tomography. Comput Math Appl. 2019;77:967–980.
- Goncharsky AV, Romanov SY, Seryozhnikov SY. Low-frequency ultrasonic tomography: mathematical methods and experimental results. Moscow University Phys Bullet. 2019;74(1):43–51.
- Beilina L, Klibanov MV. Globally strongly convex cost functional for a coefficient inverse problem. Nonlinear Anal Real World Appl. 2015;22:272–288.
- Klibanov MV, Ioussoupova O. Uniform strict convexity of a cost functional for three-dimensional inverse scattering problem. SIAM J Appl Math. 1995;26:147–179.
- Klibanov MV. Global convexity in a three-dimensional inverse acoustic problem. SIAM J Math Anal. 1997;28:1371–1388.
- Klibanov MV, Timonov A. Carleman estimates for coefficient inverse problems and numerical applications. VSP; Utrecht: 2004. 2nd ed. de Gruyter; 2012.
- Bakushinskii AB, Klibanov MV, Koshev NA. Carleman weight functions for a globally convergent numerical method for ill-posed Cauchy problems for some quasilinear PDEs. Nonlinear Anal Real World Appl. 2017;34:201–224.
- Klibanov MV, Kolesov AE. Convexification of a 3-D coefficient inverse scattering problem. Comput Math Appl. 2019;77(6):1681–1702.
- Klibanov MV, Li J, Zhang W. Convexification of electrical impedance tomography with restricted Dirichlet-to-Neumann map data. Inverse Probl. 2019;35(3):035005.
- Klibanov MV, Li J, Zhang W. Convexification for the inversion of a time dependent wave front in a heterogeneous medium. SIAM J Appl Math. 2019;79:1722–1747.
- Klibanov MV, Kolesov AE, Nguyen L, et al. A new version of the convexification method for a 1D coefficient inverse problem with experimental data. Inverse Probl. 2018;34:35005.
- Baudouin L, de Buhan M, Ervedoza S. Convergent algorithm based on Carleman estimates for the recovery of a potential in the wave equation. SIAM J Numer Anal. 2017;55:1578–1613.
- Baudouin L, de Buhan M, Ervedoza S, et al. Carleman-based reconstruction algorithm for the waves, (2020), preprint at https://hal.archives-ouvertes.fr/hal-02458787.
- Boulakia M, de Buhan M, Schwindt EL. Numerical reconstruction based on Carleman estimates of a source term in a reaction–diffusion equation, (2019), preprint at https://hal.archives-ouvertes.fr/hal-02185889SEP.
- Le TT, Nguyen LH. A convergent numerical method to recover the initial condition of nonlinear parabolic equations from lateral Cauchy data. J Inverse Ill-posed Probl. (2020), preprint at arXiv:n1910.05584.
- Bukhgeim AL, Klibanov MV. Global uniqueness of a class of multidimensional inverse problems. Dokl Akad Nauk SSSR. 1981;260(2):269–272. English translation: Soviet Mathematics Doklady. 1981;24(2):244–247.
- Klibanov MV. Carleman estimates for global uniqueness, stability and numerical methods for coefficient inverse problems. J Inverse Ill-posed Probl. 2013;21(4):00–00.
- Klibanov MV, -L. Nguyen D, Nguyen LH. A coefficient inverse problem with a single measurement of phaseless scattering data. SIAM J Appl Math. 2019;79:1–47.
- Balanis CA. Advanced engineering electromagnetics. 2nd ed. New York: Wiley; 2012.
- Colton D, Kress R. Inverse acoustic and electromagnetic scattering theory. USA: Springer; 2013.
- Nguyen D-L, Klibanov MV, Nguyen LH, et al. Imaging of buried objects from multi-frequency experimental data using a globally convergent inversion method. J Inverse Ill-posed Probl. 2018;26(4):501–522.
- Klibanov MV, Romanov VG. Reconstruction procedures for two inverse scattering problems without the phase information. SIAM J Appl Math. 2016;76:198–196.
- Klibanov MV. Convexification of restricted Dirichlet-to-Neumann map. J Inverse Ill-posed Probl. 2017;25:669–685.
- Kabanikhin SI, Sabelfeld KK, Novikov NS, et al. Numerical solution of the multidimensional Gelfand–Levitan equation. J Inverse Ill-Posed Probl. 2015;23:439–450.
- Kabanikhin SI, Novikov NS, Osedelets IV, et al. Fast Toeplitz linear system inversion for solving two-dimensional acoustic inverse problem. J Inverse Ill-Posed Probl. 2015;23:687–700.
- Beilina L, Klibanov MV. Approximate global convergence and adaptivity for coefficient inverse problems. USA: Springer; 2012.
- Tikhonov AN, Goncharsky AV, Stepanov VV, et al. Numerical Methods for the Solution of Ill-Posed Problems. Netherlands: Springer; 1995.
- Thành NT, Beilina L, Klibanov MV, et al. Imaging of buried objects from experimental backscattering time-dependent measurements using a globally convergent inverse algorithm. SIAM J Imaging Sci. 2015;8(1):757–786.
- https://www.translatorscafe.com/unit-converter/en-US/frequency-wavelength/5-29/gigahertz-wavelength%20in%20centimetres/.
- Kuzhuget AV, Beilina L, Klibanov MV, et al. Blind backscattering experimental data collected in the field and an approximately globally convergent inverse algorithm. Inverse Probl. 2012;28:095007.
- Clipper Controls Inc. (n.d.) Dielectric constants of various materials. http://www.clippercontrols.com/pages/Dielectric-Constant-Values.html#W.
- Kuzhuget AV, Klibanov MV. Global convergence for a 1-D inverse problem with application to imaging of land mines. Appl Anal. 2010;89:125–157.