# Direct and Inverse Scattering Problems for Domains with Multiple Corners

Authors: Songming Hou; Yihong Jiang; Yuan Cheng
Journal: International Journal of Partial Differential Equations
 (2015)

---

## Abstract

We proposed numerical methods for solving the direct and inverse
scattering problems for domains with multiple corners. Both the near
field and far field cases are considered. For the forward problem, the
challenges of logarithmic singularity from Green’s functions and corner
singularity are both taken care of. For the inverse problem, an efficient
and robust direct imaging method is proposed. Multiple frequency data
are combined to capture details while not losing robustness.


---

## Body

## 1. Introduction

Direct and inverse scattering problems have important applications in radar, sonar, and geophysical exploration, in medical imaging, and in nondestructive testing [1]. However, many theoretical and numerical challenges are associated with these problems, especially when the boundary has multiple corners. For direct scattering problem, the singularity of the Green’s function for the Helmholtz equation and the corner singularity of the boundary both require special treatment. For inverse scattering problem, the nonlinearity and ill-posedness challenge the design of an accurate, efficient, and robust numerical algorithm. There are two types of methods for solving the problem. The direct methods [2–6] are efficient but less accurate; the iterative methods [7–15] are accurate but more expensive. Typically the forward and adjoint problems have to be solved in each iteration. For the direct and inverse scattering problems, the near field and far field cases should be treated differently, although the main procedure remains to be the same.For the direct scattering problem, we extended the work in [1] from the case with one corner to dealing with domain with multiple corners. We managed to make the system well conditioned. For the inverse scattering problem, we used a method similar to the MUSIC algorithm in [3, 4]. However, unlike the MUSIC algorithm which is a projection, we keep the phase information so that multiple frequency data can be combined to obtain both accurate and robust result. Efficiency is also obtained since it is a direct imaging algorithm with no iteration needed. We study both the near field and far field cases.The organization of the paper is as follows. In Section2, we will discuss the forward scattering problem for domains with multiple corners. In Section 3, a direct imaging algorithm is presented to solve the inverse problem using response matrix data. In Section 4, numerical examples are presented to demonstrate the efficiency, robustness, and accuracy of our methods. We will conclude in Section 5.


## 2. The Forward Problem

Consider a time-harmonic plane wave,u
i
=
e
i
k
x
·
d, incident on a scatterer Ω
∈
R
2 with multiple corners, where k is the wavenumber and d
∈
S
1 is the incident direction. Let Γ
=
∂
Ω be the boundary of the scatterer. set Ω
e
:
=
R
2
∖
Ω
¯. We consider the obstacle scattering problem. The total field u satisfies the Helmholtz equation:
(1)
Δ
u
+
k
2
u
=
0
in
Ω
e
,
u
=
0
on
⁡
Γ
.
The total field consists of the incident field u
i and the scattered field u
s:
(2)
u
=
u
i
+
u
s
.
The incident field satisfies the homogeneous equation:
(3)
Δ
u
i
+
k
2
u
i
=
0
.
It follows from (1), (2), and (3) that the scattered field satisfies
(4)
Δ
u
s
+
k
2
u
s
=
0
in
Ω
e
,
u
s
=
-
u
i
on
⁡
Γ
.
In addition, the scattered field is required to satisfy the following Sommerfeld radiation condition:
(5)
lim
⁡
r
→
∞
r
∂
u
s
∂
r
-
i
k
u
s
=
0
r
=
x
,
uniformly in x
/
x. The uniqueness of the solution to the obstacle scattering problem is discussed in [1].We use the combined single and double layer potential approach [16] so that the integral equation is uniquely solvable. For simplicity of notation, we first assume there is one corner at x
0; then
(6)
u
x
=
∫
∂
D
‍
∂
Φ
(
x
,
y
)
∂
ν
(
y
)
-
i
η
Φ
(
x
,
y
)
φ
(
y
)
s
s
s
s
s
s
-
∂
Φ
0
x
,
y
∂
ν
y
φ
x
0
d
s
(
y
)
.
Φ
0
(
x
,
y
)
∶
=
1
2
π
ln
⁡
1
|
x
-
y
|
,
x
≠
y
,
Φ
x
,
y
∶
=
i
4
H
0
1
k
x
-
y
,
x
≠
y
By using the jump relation [1], we have the integral equation
(7)
φ
(
x
)
-
φ
(
x
0
)
+
2
∫
∂
D
‍
∂
Φ
(
x
,
y
)
∂
ν
(
y
)
-
i
η
Φ
(
x
,
y
)
φ
(
y
)
d
s
(
y
)
-
2
∫
∂
D
‍
∂
Φ
0
x
,
y
∂
ν
y
φ
x
0
d
s
y
=
2
f
x
,
x
∈
∂
D
.We use change of variable and trapezoidal rule as follows [1]. Roughly speaking, about half of the points are equally distributed while the other half are accumulated near the corner. Consider
(8)
∫
0
2
π
‍
f
t
d
t
=
∫
0
2
π
‍
w
′
s
f
w
s
d
s
,
∫
0
2
π
‍
f
t
d
t
≈
π
n
∑
j
=
0
2
n
-
1
‍
a
j
f
s
j
,
a
j
=
w
′
j
π
n
,
s
j
=
w
j
π
n
,
j
=
1
,
…
,
2
n
-
1
,
w
s
=
2
π
v
s
p
v
s
p
+
v
2
π
-
s
p
,
0
≤
s
≤
2
π
,
v
s
=
1
p
-
1
2
π
-
s
π
3
+
1
p
s
-
π
π
+
1
2
.These lead to a linear system:(9)
ψ
i
(
n
)
-
ψ
0
(
n
)
-
∑
j
=
1
2
n
-
1
‍
R
|
i
-
j
|
(
n
)
K
~
1
(
s
i
,
s
j
)
+
π
n
K
~
2
(
s
i
,
s
j
)
a
j
ψ
j
(
n
)
-
∑
j
=
1
2
n
-
1
‍
π
n
H
(
s
i
,
s
j
)
a
j
ψ
0
(
n
)
=
g
(
s
i
)
,
i
=
0
,
…
,
2
n
-
1
,
where R
j
(
n
), K
~
1, K
~
2, H, a
j are given in [1].In [1], the algorithm using graded mesh for solving direct scattering problem for sound-soft obstacle with one corner is presented. However, if we follow the same steps to treat the problem with multiple corners, large condition number for the linear system is observed; see Section 4. We propose a method to reduce the condition number. In [1], a notationally advantageous modification is made to the integral equation by inserting terms involving the fundamental solution to the Laplace equation. We observed that if this particular modification is not made, then the condition number is reduced significantly. In other words, although the notationally advantageous modification in [1] is helpful in theoretical discussion, in practice for domain with one corner it works well; however, for domain with multiple corners, it would lead to a linear system with large condition number. In this case we get around by removing this modification. See Section 4 for numerical comparison.By solving the integral equation, we could compute both the near field and far field data. There are four cases:(1)
plane incident wave, far field data,
(2)
plane incident wave, near field data,
(3)
point source, far field data,
(4)
point source, near field data.The formula for far field data is(10)
u
∞
x
^
=
-
e
i
π
/
4
8
π
k
∫
∂
Ω
‍
k
ν
y
·
x
^
+
η
e
-
i
k
x
^
·
y
φ
(
y
)
d
s
(
y
)
,
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
x
^
=
1
.The formula for near field data is(11)
u
x
=
∫
∂
D
‍
∂
Φ
x
,
y
∂
ν
y
-
i
η
Φ
x
,
y
φ
y
d
s
y
,
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
x
∈
R
2
∖
∂
D
.The following formulas are implementation details for near field:(12)
H
0
1
k
r
~
=
H
0
1
k
r
cos
⁡
θ
-
x
1
2
+
r
sin
θ
-
x
2
2
,
∂
∂
x
1
H
0
1
k
r
~
=
-
H
1
1
k
r
cos
⁡
θ
-
x
1
2
+
r
sin
θ
-
x
2
2
×
k
x
1
-
r
cos
⁡
θ
r
cos
⁡
θ
-
x
1
2
+
r
sin
θ
-
x
2
2
,
∂
∂
r
H
0
1
k
r
~
=
r
1
x
1
-
r
cos
⁡
θ
+
r
2
x
2
-
r
sin
θ
×
-
k
H
1
1
k
r
cos
⁡
θ
-
x
1
2
+
r
sin
θ
-
x
2
2
r
cos
⁡
θ
-
x
1
2
+
r
sin
θ
-
x
2
2
.
Another issue is that for point source incident instead of plan wave we replace e
i
k
x
·
d with (
i
/
4
)
H
0
(
1
)
(
k
r
~
) where
(13)
r
~
=
r
cos
⁡
θ
-
x
1
2
+
r
sin
θ
-
x
2
2
.
We have the following response matrix relations:
(14)
p
1
=
e
i
k
∥
x
∥
x
(
d
-
1
)
/
2
p
2
+
O
1
x
,
p
3
=
e
i
k
∥
x
∥
x
(
d
-
1
)
/
2
p
4
+
O
1
x
,
p
2
=
β
p
3
T
.
For 3
D
:
β
=
1
/
4
π. For 2
D
:
β
=
e
i
π
/
4
/
8
π
k.The corresponding singular values have the relations(15)
σ
i
,
1
≈
1
r
σ
i
,
2
,
σ
i
,
2
=
1
8
π
k
σ
i
,
3
,
σ
i
,
3
≈
1
r
σ
i
,
4
.We will verify these relations numerically in Section4.


## 3. The Inverse Problem

Shape reconstruction has important applications in radar, sonar, and geophysical exploration, in medical imaging, and in nondestructive testing [1]. The nonlinearity and ill-posedness make it a challenging problem. There are two types of methods for solving the problem. The direct methods [2–6] are efficient but less accurate; the iterative methods [7–15] are accurate but more expensive. Typically the forward and adjoint problems have to be solved in each iteration.Figure1 shows a typical configuration for such a problem. The background medium is assumed to be homogeneous.Figure 1
Setup for inverse problems.The response matrix is a collection of the scattered field data received at thejth transducer which originated at the ith transducer. There are two ways to obtain data for the response matrix. One is to do physical measurements. The other is to solve the forward problem given the target shapes. One way to solve for the scattered field is to truncate the unbounded domain to a bounded domain using the perfectly matched layer (PML) technique [17, 18]. This layer is shown in Figure 1. In this paper, we use our forward solver in Section 2 using a boundary integral formulation. As we discussed earlier, we expect our forward solver to have slower than exponential convergence, but accurate enough to use as input data for inverse problems.We next review some properties of the singular value decomposition of the response matrix [3, 4].Depending on the target size compared with the array resolution, the singular value decomposition of the response matrix can have the following three patterns.For point targets with sizes much smaller than the array resolution, the number of significant singular values equals the number of targets. In this case, the response matrix only contains location information. It is unrealistic to expect to recover shape information.For small targets whose sizes are smaller than, but comparable to, the array resolution, the pattern of singular values becomes more complicated [19]. The response matrix contains location and some size information.For extended targets whose sizes are larger than the array resolution, the response matrix contains both location and geometry information of the target. It is no longer clear in the singular value plot how many singular values correspond to one target. In [3] a direct imaging algorithm is developed for extended target. The key idea in the imaging algorithm is to determine the illumination vector based on a physical factorization of the scattered field and the signal space as well as its dimension using resolution analysis.In this paper, we consider both near field and far field data. Therefore the illumination vector should take the form in [3, 4]. Here we outline the procedure for far field data. For near field it is similar; we consider sound-soft targets. For simplicity we assume here that the outgoing directions we measure are the same as the incoming directions, θ
^
1
,
…
,
θ
^
n. The scattered far field is then [1]
(16)
u
∞
(
x
^
)
=
-
e
i
π
/
4
8
π
|
k
|
∫
∂
Ω
‍
∂
u
∂
ν
(
y
)
e
-
i
k
x
^
·
y
d
s
(
y
)
,
where ∂
Ω is the boundary of the targets, x
^ is a unit vector that defines the far field direction, u is the total field, and ν is the outer normal direction on the boundary of the targets. In our setup, the element of the response matrix P
i
j corresponds to the far field pattern of the scattered field in the jth direction due an incident wave coming from the ith direction:
(17)
P
i
j
=
u
∞
(
θ
j
^
;
θ
i
^
)
=
-
e
i
π
/
4
8
π
|
k
|
∫
∂
Ω
‍
∂
u
∂
ν
(
y
;
θ
^
i
)
e
-
i
k
θ
^
j
·
y
d
s
(
y
)
,
where the total field is due to incident plane wave coming from the direction θ
i
^. In matrix form
(18)
P
=
-
e
i
π
/
4
8
π
k
∫
∂
Ω
‍
∂
u
→
∂
ν
g
^
H
(
y
)
d
s
(
y
)
,
where
(19)
g
^
(
y
)
=
e
i
k
θ
^
1
·
y
,
…
,
e
i
k
θ
^
n
·
y
T
,
and u
→ is the vector of total fields corresponding to the incident plane waves from θ
^
1
,
…
,
θ
^
n. Equation (18) gives a physical factorization of the scattered field into known and unknown parts. The far field pattern is a superposition of the far field patterns of point sources located on the boundary of the target; however, we do not know the weight function which depends on the total field. In other words, the scattering at the target boundary acts as sources for the scattered field. In this far field setup, it is natural to use g
^
(
y
) as the illumination vector. The signal space of the response matrix should be well approximated by the span of the illumination vectors g
^
(
y
) with y on the well-illuminated part of the boundary of the targets.The next step is to determine the signal space, which is spanned by appropriate singular vectors of the response matrix. It has been shown in [3] (for near field data) and [4] (for far field data) that, by using a resolution analysis based thresholding, we could determine a threshold r and use the first r singular vectors to image the shape of the targets.In this paper, we propose to use the singular values as the natural weight to get around the above thresholding procedure.One major drawback of the MUSIC-type algorithms [3, 4] is that such algorithms are projection algorithms that remove the phase information. It is not meaningful to combine multiple frequency projection results. For full aperture data, the MUSIC-type algorithms work so well that the drawback is disguised. However, for synthetic aperture data, which is more realistic in some applications, the results from the MUSIC algorithms degenerate. It is crucial to take advantage of phase coherence to overcome the challenge of lack of data [5]. We keep the phase information and use singular values as natural weight. Thus multiple frequency data can be combined. We will show in Section 4 that numerical results using low frequency data are more robust but less accurate; numerical results using high frequency data are more accurate but less robust. By combining multiple frequency results while keeping phase information, we could generate accurate and robust results. Further, efficiency is guaranteed since there is no need for iteration. The evaluation at different grid points is also independent, making it easy to be parallelized.


## 4. Numerical Experiments

In this section, we present some numerical examples to demonstrate the effectiveness of our method.We first present results for a smooth target, reproducing the work from [1]. Figure 2 shows the geometry of a kite with grid points on its boundary. Table 1 shows the error of max
⁡
(
max
⁡
(
p
n
-
p
128
)
) where n
=
16,32,64. Exponential convergence is exhibited since the number of correct digits doubles when n doubles. Note that for the fine grid n
=
64 compared with n
=
128, the error reaches machine precision.Table 1
Kite.
n
=
16
n
=
32
n
=
64
2.1299
e
-
05
9.3405
e
-
11
1.8595
e
-
14Figure 2
Kite.Next, we present an example with three corners. In [1], an example with one corner was presented. However, if we follow the procedure to treat three corners, large condition number is observed. By using the method in Section 2, we reduced the condition number. Figure 3 shows the geometry of three corners with grid points on its boundary. Note that we used graded mesh. About half of the grid points are near the corners. Table 2 shows the error of max
⁡
(
max
⁡
(
p
n
-
p
128
)
) for n
=
16,32,64. Due to the corner singularities, we no longer have exponential convergence. Still, high order convergence is exhibited.Table 2
Three corners.
n
=
16
n
=
32
n
=
64
9.9706
e
-
04
2.2081
e
-
05
3.5171
e
-
07Figure 3
Corners with graded mesh.Next, we presented a more complicated example with the geometry of a butterfly with many corners. The equations for each arc of the butterfly are(20)
y
=
-
1
2
x
-
1
2
+
1
,
x
=
-
1
2
y
-
1
2
+
1
,
x
=
-
3
8
y
+
2
3
2
+
2
3
,
y
=
3
4
x
-
2
3
2
-
2
3
,
y
=
3
4
x
+
2
3
2
-
2
3
,
x
=
3
8
y
+
2
3
2
-
2
3
,
x
=
1
2
y
-
1
2
-
1
,
y
=
-
1
2
x
+
1
2
+
1
.
We first denote n to be the number of points on the shortest arc. By using the ratio between arc lengths, we could assign the number of points on each arc. Then we have an equal partition for a parameter that ranges between [
0,2
π
]. Finally, we map the points to the graded mesh in Section 2. Figure 4 shows the butterfly geometry with graded mesh. Table 3 shows the error of max
⁡
(
max
⁡
(
p
n
-
p
64
)
) for n
=
16,32, where n is the number of points on the shortest arc. Again, high order convergence is exhibited.Table 3
Butterfly.
n
=
16
n
=
32
0.002293395029047
1.059930658725753
e
-
04Figure 4
Butterfly with graded mesh.Now we demonstrate the relation among the response matrices for near field and far field data. We compare the following four cases:(1)
plane incident wave, far field data,
(2)
plane incident wave, near field data withr
=
5,
(3)
point source withr
=
5, far field data,
(4)
point source withr
=
5, near field data with r
=
5.In Section2, we derived the relation among the above matrices. Now we use a numerical example to verify the results. We choose the butterfly shape as the obstacle. Figure 5 is the plots for the singular values of the four response matrices. They clearly share the same pattern. Next we justify the relations (14)–(15) numerically. We use the butterfly shape. We find σ
1,1
=
0.0656, (
1
/
r
)
σ
1,2
=
0.0653, σ
1,3
=
2.7387
,
(
1
/
r
)
σ
1,4
=
2.7250, σ
1,2
=
0.1460
,
(
1
/
8
π
k
)
σ
1,3
=
0.1460, and max
⁡
(
max
⁡
(
p
2
-
β
p
3
T
)
)
=
7.0647
×
1
0
-
5. Note that σ
1,1
>
(
1
/
r
)
σ
1,2 and σ
i
,
3
>
(
1
/
r
)
σ
1,4. The reason is that, with a perturbation of matrix elements without bias, the singular values are more likely to get larger.Figure 5
Singular value plots for near and far field response matrices.Now we present numerical results to justify our claim in Section2 for condition number. For the shape with three corners with n
=
32, the condition numbers for the two methods are 14 and 47135. For the butterfly shape, with n
=
32, they are 90 and 6353. Clearly, by modifying the method in [1], the condition number is significantly reduced. This justifies our claim that the method in [1] for one corner needs to be slightly modified for the case with multiple corners.We now use some numerical examples to demonstrate the accuracy efficiency and robustness of our method in Section3 for solving the inverse obstacle problem.Our first example is the butterfly shape. The response matrix is generated by the forward solver in Section2.Figure6(a) shows the result of our imaging function for low frequency data. The result is robust but not accurate. Figure 6(b) shows the result of our imaging function for high frequency data. It is accurate but not robust. By combining multiple frequency data, Figure 6(c) shows the improved result that is both accurate and robust. Efficiency is also guaranteed since no forward solver is repeatedly needed for iteration.(a) Low frequency, (b) high frequency, and (c) multiple frequency.
(a)
(b)
(c)Next we demonstrate robustness of our method with respect to noisy data. We perturb the response matrix as follows: both the real and imaginary parts of the response matrix are perturbed by 100% with a uniform distribution. Figure7 shows that our shape reconstruction for the butterfly is still good. The reason behind this is the robustness of the first few singular values with respect to large perturbation.(a) Low frequency with noise, (b) high frequency with noise, and (c) multiple frequency with noise.
(a)
(b)
(c)We next present an example with multiple targets. Figure8(a) shows the result using low frequency data. It allows us to localize the 5 shapes, but with no details. Figure 8(b) shows the high frequency result with details, but less robustness. With the help from low frequency result, we would zoom the 5 regions one by one. For example, Figure 8(c) shows the zoomed result for the butterfly shape in the middle using high frequency data.Multiple targets (a) low frequency, (b) high frequency, and (c) butterfly shape zoomed using high frequency.
(a)
(b)
(c)


## 5. Conclusion

We proposed numerical methods for solving the direct and inverse scattering problems for domains with multiple corners. For the forward problem, we extended the method in [1]. The resulting method is well conditioned. For the inverse problem, we proposed a method similar to the MUSIC algorithm in [3, 4] but we keep the phase information so that multiple frequency data can be combined. Numerical results showed that our method is efficient, accurate, and robust.



---

*Source: 968529-2015-01-26.xml*