Abstract
We consider the inverse source problem of thermo- and photoacoustic tomography, with data registered on an open surface partially surrounding the source of acoustic waves. Under the assumption of constant speed of sound we develop an explicit non-iterative reconstruction procedure that recovers the Radon transform of the sought source, up to an infinitely smooth additive error term. The source then can be found by inverting the Radon transform. Our analysis is microlocal in nature and does not provide a norm estimate on the error in the so obtained image. However, numerical simulations show that this error is quite small in practical terms. We also present an asymptotically fast implementation of this procedure for the case when the data are given on a circular arc in 2D.
Export citation and abstract BibTeX RIS
1. Introduction
We consider the inverse source problem for the free-space wave equation, with measurements made on an open bounded surface. Such problems arise in the thermo- and photoacoustic tomography (TAT/PAT) [1–3] and in several other coupled-physics modalities (see, for example, [4–6]). The forward problem can be modeled by the Cauchy problem for the standard wave equation in :
with the initial condition
where, in the case of TAT/PAT, u(t, x) represents the acoustic pressure in the tissues, c(x) is the speed of sound, and the initial pressure f(x) results from the thermoelastic effect. Function f is assumed to be compactly supported within a bounded region Ω0 that itself is a subset of a larger bounded region Ω ⊃ Ω0. Ideally, one would take the measurements g(t, z) defined as
where ∂Ω is the boundary Ω. However, here we consider the practically important case of measurements restricted to a subset Γ of ∂Ω; we will denote this data greduced(t, z):
The two inverse source problems of interest to us consist of finding f(x) from known c(x) and either g(t, z) or greduced(t, z).
The inverse source problem with complete data g(t, z) is very well understood by now. In particular, the so-called time-reversal procedure (applicable under the non-trapping condition) is based on solving backwards in time the mixed initial/boundary value problem for the wave equation in the domain (0, ∞) × Ω, with uniform initial conditions at the limit t → ∞ and the boundary values g(t, z) [7–10]. Many other techniques have been developed for the inverse source problem with complete data, including a variety of explicit inversion formulas applicable if c(x) is constant (we will not attempt to overview these results here).
However, in practical situations one can measure data only on a subset Γ of ∂Ω, and has to work with greduced. For such data very few reconstruction technique are presently known, most of them iterative in nature. In the present paper under the assumption of the constant speed of sound, we develop an explicit non-iterative image reconstruction procedure that recovers f(x) up to an infinitely smooth error term. Our numerical experiments show that this error is also quite small from the practical standpoint, although we are able to prove only the smoothness of it.
We make the following assumptions about the data acquisition scheme. The region Ω containing Ω0 is convex and has a smooth boundary ∂Ω. Without further loss of generality we assume that Ω is contained inside the unit sphere centered at the origin (see figure 1), and that the constant speed of sound c is equal to 1. The support Ω0 of f lies within Ω and above the plane xd = 0. The measurement surface Γ is a subset of ∂Ω containing all points lying above the plain xd = −2δ, where δ is a fixed positive number:
Our goal is to solve
Problem 1 (Inverse source problem with reduced data). Find f(x) given data greduced(t, z) defined by equations (1), (2) and (4) .
However, it will be helpful for us to start the discussion with
Problem 2 (Inverse source problem with complete data). Find f(x) given data g(t, z) defined by equations (1)–(3).
The solvability and stability of the inverse problem with reduced data have been thoroughly studied under various assumptions on the speed of sound c(x) (see [7, 8, 10]). Importantly, the stability of the reconstruction is guaranteed under the so-called visibility condition [11], which for the case of constant speed of sound can be formulated as follows
Visibility condition. For every point x ∈ Ω0, every straight line passing through x intersects Γ at least once.
Our data acquisition scheme satisfies this condition.
The most straightforward constructive approach to the problem with the reduced data is to apply the standard time-reversal technique to greduced to obtain an approximation to f. It is shown in [10, 12] that, under the visibility condition, such approximation is equivalent to applying a pseudo-differential operator (ψDO) of order zero to f. A Neumann series approach was used in [13] to invert such an operator; however, convergence of this approach is not well understood theoretically. Instead of the time reversal one can apply the operator adjoint to the operator defining the direct map of to greduced [14]. This still leads to expensive iterations, although they are guaranteed to converge eventually.
Non-iterative approaches to this problem include [15–18]. The numerical algorithm [17] produces good results in 2D; however, it requires further theoretical investigation and it might become expensive for 3D computations. The method presented in [18] yields a theoretically exact reconstruction of f, but only under a certain sub-optimal geometrical condition: the support of f must be significantly smaller than the region that otherwise satisfies the visibility condition. Finally, in [15, 16] the source term f is reconstructed up to an error term given by a ψDO of order −1 applied to f.
In the preset paper we first develop a novel explicit procedure that yields theoretically exact reconstruction of the Radon projections of f if the complete data g are given. When applied to reduced data, this algorithm produces the Radon projections accurate up to an infinitely smooth term. This allows for an explicit reconstruction of f up to a smooth error. In sections 3 and 4 we formulate and prove the main theorems defining our method. An asymptotically fast algorithm for the particular case of the circular arc acquisition curve in 2D is presented in section 5. In the last section we demonstrate the performance of this approach in numerical simulations.
2. Explicit reconstruction procedure
2.1. Theoretically exact reconstruction from complete data
Let us first introduce an explicit reconstruction procedure that is theoretically exact in the case of complete data. In other words, in this section we are solving problem 2.
2.1.1. Exterior problem
Unlike the classical approach that consists in solving backwards in time the wave equation in a domain (0, ∞) × Ω, we first solve an exterior Dirichlet problem for the wave equation in the domain . In order words, we find solution u(t, x) of the initial/boundary value problem
Notice that the solution of this problem coincides on Qext with the solution of the problem (1) and (2), which allows us to use the same notation u(t, x) for both functions.
2.1.2. Radon transform
The Radon transform is the main tool we use. To make this paper self-contained we collect in this section some basic facts about it. Consider a continuous function q(x) compactly supported within some bounded region (within the ball Bd(0, r) of radius r centered at the origin) and extended by zero to the rest of . For a direction , and , the values h(ω, p) of the Radon transform are given by the formula
where δ(⋅) is the Dirac's delta function ([19]). The Radon transform is thus defined on the cylinder . The obvious but important property of is symmetry
Let us introduce Sobolev norms on and Z:
where is the Fourier transform of q(x) and (ω, σ) is the one-dimensional Fourier transform of h(ω, p) in the second variable. Then there exist constants c(s, d) and C(s, d) (see [19], chapter 2, sections 5) such that
Using these estimates, one extends the Radon transform to compactly supported distributions on .
2.1.3. Reconstruction procedure
We will denote by F(ω, p) the Radon transform of f
Recall that u(t, x) is the solution of (1) and (2) with the initial condition f(x). Let us define the Radon projections of u(t, x) for each fixed t ⩾ 0 by (6). It is well known that, for a fixed ω, such projections solve the 1D wave equation:
The above equation is understood either in the classical sense or in the sense of distributions, depending on the smoothness of u. Further, by taking into account (2) one can confirm that
Then, the solution of the Cauchy problem (9) and (10) is given by d'Alembert's formula,
Since f(x) is compactly supported in B(0, 1), its Radon projections F(ω, p) are supported on (−1, 1) in p. Therefore, for t = 2,
or
Thus, once u(2, x) has been computed, one easily reconstructs the Radon projections F of f from .
The methods for recovering a function from its Radon projections are well-known [19]. Consider the Hilbert transform whose action a function of a 1D variable h(t) is given by the formula
where the integral is understood in the principal value sense. The adjoint of the Radon transform (6) is defined by its action on a function h(ω, p) supported on Z as follows:
The inverse Radon transform is the left inverse of , and is in general not unique. For the purposes of the present paper we define as a composition of the differentiation in p, Hilbert transform in the second variable (p), and the adjoint Radon transform as follows ([19], chapter 2, section 2):
If , then . From the numerical standpoint, the problem of reconstructing a function from its Radon projections has been studied extensively, and efficient and accurate algorithms for implementing (11) are well known by now [19].
It should be noted that the image reconstruction based on the Radon transform of the solution of the wave equation has been considered recently in [20]. In that work, a non-traditional data acquisition scheme yields the values of the whole acoustic field u(t, x), instead of boundary values g(t, z). The problem we are solving here is different, but our technique bears some resemblance of the methods of [20].
From the numerical standpoint it may be preferable to compute the derivative of the Radon projections:
Formulas (11) can be easily modified to process instead of F, since the Hilbert transform commutes with differentiation. However, for simplicity of the presentation we will concentrate on reconstruction of F.
2.2. Reconstruction from reduced data
In order to deal with problem 1, we first solve a modified initial/boundary problem in Qext as follows. For a fixed δ > 0 (see figure 1) we introduce a function such that 0 ⩽ ψ ⩽ 1, ψ = 1 for τ ⩾ −δ, and ψ = 0 for τ ⩽ −2δ. We define the function h ∈ Hs((0, ∞) × ∂Ω) by setting
Consider now the exterior initial/boundary problem with homogeneous initial data and Dirichlet data h for the wave equation:
For h ∈ Hs((0, ∞) × ∂Ω), , there exists a unique solution . This result can be proved using the techniques developed in [21, section 24.1]. The local existence theorem (lemma 24.1.6) is restricted to non-negative s only because of a right-hand side term which vanishes in our case. Furthermore, if h ∈ L2((0, ∞) × ∂Ω), then the solution of our initial-boundary value problem is continuous in time, that is [22].
Solution w(t, x) serves as a crude approximation of the exact solution u(t, x) (compare this problem to problem (5)). Let us consider w(t, x) at t = 2. Due to the finite (unit) speed of propagation of waves, w(2, x) is finitely supported within the ball of radius 3 centered at the origin. Then, the (exterior) Radon transform of w(2, x) can be defined by (6) for 1 ⩽ |p| ⩽ 3. We only use a subset of these data and define as follows:
When considered on the whole sphere (in ω) the function is a rather poor approximation to F(ω, p). However, if one considers only the subset , one finds that is equal to F(ω, p) modulo infinitely smooth function of (ω, p). This fact is proven in theorem 8 in section 4 of this paper.
Motivated by the symmetry relation (7), we define G(ω, p) as follows:
We use G(ω, p) as an approximation for F(ω, p) and apply the inverse Radon transform (defined by (11)) to G(ω, p) to obtain an approximation of f(x):
One can show that , where κ(x) is a C∞(B(0, 1)). This is the main theoretical result of the present paper, given by proposition 9 in section 4. Although our analysis is microlocal in nature, and does not yield a norm estimate on the error κ(x), our numerical simulations show that it is quite small in practical terms.
Our general reconstruction procedure consists of the following steps:
- (a)Solve the initial/boundary value problem (12) on time interval [0, 2];
- (b)
- (c)
Theoretical foundations of our technique are presented in sections 3 and 4 below.
Computational efficiency of our scheme depends on particular algorithms used on each of the steps. On the first step, known methods for solving the exterior initial/boundary value problems can be used, including, in particular, finite difference schemes [23] and boundary layer techniques [24]. The second step is straightforward. The last step, inversion of the Radon transform, is well-studied by now, and efficient implementations of the filtered backprojection algorithm (11) are known.
However, for the geometries that allow for separation of variables in the wave equation, it may be possible to have a faster implementations of steps 2 and 3. In section 5 we present a very fast algorithm applicable when the acquisition surface is a circular arc (in 2D). Finally, the last section of the paper illustrates our findings by the results of numerical simulations.
3. The wave front set of the Dirichlet trace of a wave on a sphere
Let us analyze the propagation of singularities in the solution u(t, x) of the problem (1) and (2), with c(x) ≡ 1 and supp f = Ω0. The solution for this Cauchy problem is given by the formula
Consider the mapping where . This operator is a sum of two Fourier integral operators. Since Ω0 is a compact subset of B(0, 1), the operator has a non-degenerate phase function and the mapping f → g is continuous from into for , see for example [10]. Hence, for we obtain h ∈ Hs((0, ∞) × ∂Ω), where h is the function introduced at the beginning of the previous subsection.
At first we will study the wave front set of the Dirichlet trace g. In what follows we abbreviate . Since g is defined on its wave front set is a subset of , the cotangent bundle of the surface . The first result is of a more general nature.
Lemma 3. Let and let S be a smooth hypersurface in . Suppose that WF(p) ∩ N(S) = ∅ where N(S) is the conormal bundle of S. Then, the trace operator extends to a continuous operator from to Hs−1/2(S). Furthermore,
Here νx is a unit normal vector at x ∈ S and ξ − (ξ ⋅ νx)νx is the orthogonal projection of ξ onto the cotangent space of S at x.
Proof. The first statement of the lemma is just the trace theorem in Sobolev spaces provided s > 1/2. The condition on the wave front set allows us to extend the trace theorem to all . The concept of the wave front set is independent of the choice of coordinates. Locally, we may always assume that S = {xd = 0}. In this case we will write x' = (x1, ..., xd−1) and correspondingly, we have ξ = (ξ', ξd). In local coordinates, the second statement of the lemma is
and the conormal bundle is
Fix x' ∈ S. Since WF(p) ∩ N(S) = ∅ we know that there exists a satisfying φ(x', 0) = 1, such that for all and ξ in some conic neighborhoods of the vectors we have
Furthermore, away from these conic neighborhoods, we have |ξd| ≲ |ξ'|. For s ⩽ 1/2, we have . For a definition of these Sobolev spaces we refer to definition B.1.10 [21]. This local result can be made global and yields . Using theorem B.1.11 [21], we infer that q ∈ Hs−1/2(S). Recall that for we have
and hence,
By continuity this last formula extends to Fourier transforms which are integrable in ξd with values in . Now suppose that the points (x', 0; ξ', ξd) ∉ WF(p) for all . By the definition of the wave front set, there exists a function such that φ(x', 0) = 1 and a conic neighborhood of U(ξ') in such that for all
Now define by ψ(y') = φ(y', 0). Then we know that for all η' ∈ U(ξ')
where . Hence, we conclude that (x', ξ') ∉ WF(q) and conclude that
□
The wave front set of the solution u to (15) can be described very precisely. Over every point (x, η) ∈ WF(f) there are two null bicharacteristics, that is lines in , , which satisfy the following initial value problem
Note that the initial condition for τ is inferred from the fact that null bicharacteristics are in the characteristic variety. One can use t as a parameter and obtain the following solutions
Note that γ+ has the direction vector (|η|, η) for the first d + 1 components where as γ− has the direction (|η|, −η).
Since we are interested in the forward problem, we will restrict ourselves to t ⩾ 0. The wave front set of u consists exactly of all bicharacteristics whose initial data are in the wave front set of f, see for example [21, chapter XXIII]. The next result describes the wave front set of the trace of the wave u along ∂Ω.
Proposition 4. Let f ∈ Hs(Ω0) for some and let be the unique solution to (1) and (2) and . Then,
Furthermore, every point in WF(g) is a hyperbolic point. This is to say that (t, y; τ, ξ) ∈ WF(g) implies |τ| > |ξ|.
and observe that . Hence, the previous lemma is applicable.
If y ∈ ∂Ω, then y = x ± tη/|η| implies that ±α(y − x) = η for some α > 0 and t = |y − x|. Hence,
Now we apply lemma 3 and the proof of the first statement is finished.
For the second statement, let (t, y; τ, ξ) ∈ WF(g). Then there exists a point (t, y; τ, η) ∈ WF(u) where
Since the support Ω0 is a compact subset of the convex set Ω, no bicharacteristic tangential to can meet Ω0. Hence, and thus |ξ| < |η| = |τ|. □
Remark 5. The inclusion in proposition 4 can be replaced by an equal sign. This follows from the fact that the operator is a sum of two elliptic Fourier integral operators.
Now comes the second step. The unique solution w(t, x) to the exterior problem (12) has the following interesting property. The wave fronts of u and w are the same in the exterior upper half space
More precisely, we have
Theorem 6. For , suppose that u is the solution to the Cauchy problem (1) and (2) and that w is the solution to the exterior initial-boundary value problem (12). Then
and
Proof. Let v be the solution of the exterior Cauchy–Dirichlet problem with zero initial data and Dirichlet data (1 − ψ)g, i.e. v = u − w. We will show that
i.e. the function v is infinitely often differentiable in the upper half space. According to theorem 2.1 [25], the singularities of v depend on the wave front set of the Dirichlet data (1 − ψ)g. Since ψ ∈ C∞ we know that , where .
According to proposition 4 the wave front set of g depends only on the wave front set of f. In particular all points in WF(g) are hyperbolic points. Over each hyperbolic points there are exactly two bicharacteristics, an incoming one and an outgoing one. Since the initial data are zero, the solution is identically zero along all incoming bicharacteristics.
Let now (t, y; τ, ξ) ∈ WF(g) and denote the exterior unit normal vector to Ω at y by νy. Then, according to proposition 4, we have either τ > 0 (bicharacteristic γ−) or τ < 0 (bicharacteristic γ+). The spatial frequency of the outgoing bicharacteristic is in the case γ+ and in the case of γ−, compare with formula (17).
We will consider only the case τ > 0, the case τ < 0 is similar. Because of proposition 4 there exists a point x ∈ Ω0 and α > 0 such that
Compute now
and observe that the convexity of Ω implies that
The outgoing bicharacteristic γ− starting at the point (t, y) must have the direction
compare with (17). Since x ∈ Ω0 and , the projection of the bicharacteristic γ− into space-time is a straight line which cannot meet {(t, x) ∈ Qext: xd ⩾ −δ} for t > 0.
The second statement follows from the first one and lemma 3. □
4. The Radon transform and its wave front set
We have defined the Radon transform earlier, by equation (6).
Proposition 7. The Radon transform can be extended to a bounded linear operator from to and
For d = 2 this is theorem 3.1 in [26].
Proof. A large part of the proof is an application of theorem 8.2.13 in [27]. We use local coordinates ω = φ(y'), where we demand that φ(Y') is at most a hemisphere. The kernel of the Radon transform is
where we abbreviate and see that the kernel is a composition of the delta function and the function m(y, x) = φ(y') ⋅ x − p. Note that where and . Recall that . The wave front set of this kernel is analyzed using theorem 8.2.4 in [27]. We have
and hence,
Here φ' is the Jacobian matrix of φ. Now theorem 8.2.13 in [27] is used to finish the proof. At first note that
since the first fiber component in (20) cannot be zero. Hence, the Radon transform can be continuously extended to a linear operator from into . Similarly, we have
and hence,
Finally we return from the local coordinate system in Y to . Here it is important to note that the co-vector gets mapped to . Furthermore, if (x, ω) ∈ WF(f), then (x, τω) ∈ WF(f) for τ > 0 and (x, −τω) ∈ WF(f) for all τ < 0. □
Actually, a more precise result holds true, there is equality in (19). This can be inferred from the theory of Fourier integral operators and is explained in [28, p 59].
The Radon transforms of the solutions u(t, x) to the Cauchy problem (1) and (2) and w(t, x) to the Cauchy–Dirichlet problem (12) carry t as a parameter. Recall .
Theorem 8. Let and suppose that u is the solution to the Cauchy problem (1) and (2). Let w be the solution to the exterior initial-boundary value problem (12). Then,
Proof. As before, let v = u − w. We have to show that . Let . proposition 7 can be rephrased as follows: the wave front set of the Radon transform of v(2, ⋅) can have points with base point (ω, p) only if the wave front set of v(2, ⋅) has points of the form (x, ±ω) for some satisfying ω ⋅ x = p. According to theorem 6, the wave front sets of v(2, ⋅) is empty over the set D+ whereas over the wave front set of v(2, ⋅) is a subset of the wave front set of u(2, ⋅).
However, we can show that the wave front set of u over D− has no points of the form (x, ±ω) with x satisfying ω ⋅ x = p for some p > − 1. The wave front set of u is given in (18). If , then (y, ±ω) ∈ WF(f) where x = y ± 2ω. Note that x = y + 2ω is not possible since supp f = Ω0 implies yd ⩾ 0 and thus xd > −δ. Hence, x ⋅ ω = y ⋅ ω − 2 < −1. □
Recall the definitions of and G given in (13) and (14). We will be interested in the error
For and p ∈ (−1, 1) we have just proved that is an infinitely smooth function. Furthermore, by symmetry, for ωd < δ/2 and p ∈ (−1, 1), we infer that is smooth.
Let H denote the Heaviside function of a one-dimensional variable
Then,
and this function defined on is an infinitely smooth function except for a discontinuity on the set where is the equator . The next result shows that these singularities disappear, once the inverse Radon transform is applied. In order to apply the inverse Radon transform we need to extend EG to all . This is done by setting G ≡ 0 for all |p| > 1. Abusing notation, we will denote the resulting extension by EG as well.
Proposition 9. The inverse Radon transform restricted to the open unit ball is a smooth function κ ∈ C∞(B(0, 1)).
Proof. The function EG has two locations of singularities: one is on , due to (22) and the other is at |p| = 1 due to the extension by zero outside of p ∈ [−1, 1].
We discuss at first . According to formula (22), we have
Here denotes regular curves in . In view of (19) we see that this set has an empty intersection with the wave front set of the Radon transform of any distribution.
From the theory of elliptic Fourier integral operators [29, theorem 4.2.5] one knows that the inverse transform has the same canonical relation as does , only with the variables switched around. The application of the inverse Radon transform will ignore those points in the wave front set of EG.
In view of (19), the singularities of EG at |p| = 1 will correspond to singularities of its inverse Radon transform outside of the unit ball.
But this means that . □
5. A fast algorithm for the reduced circular geometry in 2D
The three-step image reconstruction procedure proposed in this paper is detailed at the end of section 2.2. Practicality of this technique depends, in particular, on the computational complexity of steps 1 and 2. (Efficient algorithms for implementing step 3 are well known). Let us assume that the domain Ω is discretized using md nodes, and the number of time steps is . The optimal number of projections is then with the number of samples in a projection equal to . If the first step is implemented using finite differences, it will have computational complexity floating point operations (flops). A straightforward computation of the Radon projections requires flops.
However, for special geometries it might be possible to design significantly faster algorithms. In the present section we develop an asymptotically fast ( flops) algorithm applicable in 2D when the acquisition curve is a circular arc.
To be precise, we consider the following geometry. The region Ω is the unit disk B(0, 1) centered at the origin, Ω0 is the upper half of B(0, 1), i.e.
The data acquisition surface Γ is an arc of a unit circle
The geometry is shown in figure 2, together with the phantom we use in the numerical simulations described further below (for which we chose 2δ to be equal to arctan(10°)).
Download figure:
Standard image High-resolution imageDue to the circular symmetry of Ω, solving the exterior boundary value problem (12) commutes with rotation. In addition, it commutes with the shifts in time variable. It is well known that the Radon transform commutes with rotation, too. Thus, one can expect that the operator that maps boundary data h(ω, t) into the Radon projections is a convolution, and that the Fourier transform in t combined with Fourier series in the angular variable would diagonalize it. This is indeed the case as shown below.
We start by noticing that the wave equation separates in the polar coordinate system. In particular, the following combinations Wk(t, λ, r, θ) of functions represent radiating solutions of the wave equation (propagating away from the origin):
where is the Hankel function of the first kind of order k, λ is any non-zero frequency, and r and t are the polar coordinates corresponding to the variable x, i.e. x = r(cos θ, sin θ). Let us extend Wk(t, λ, r, θ) to λ = 0 by continuity (see [30], section 10.7):
At λ = 0 functions Wk(t, 0, r, θ) are stationary solutions of the wave equations (i.e., harmonic functions), bounded at infinity. The values of Wk's on the cylinder r = 1, θ ∈ [0, 2π], are functions exp(ikθ) exp(−iλt); they represent a Fourier basis.
We will use functions Wk(t, λ, r, θ) to solve the forward problem (12). Let us extend the boundary condition h(t, x(1, θ)) in the time variable by 0 to all t < 0. Since solutions of the wave equation are causal, and we are only interested in w(t, x) at t = T, we can smoothly cut-off h(t, x(1, θ)) to 0 on the interval [T, T + b], and define to be 0 for all t > T + b. There is enough freedom in defining this cut-off to enforce the condition
Now, solution of problem (12) can be formally represented as
where coefficients ak(λ) are to be determined from the boundary condition
on , which yields
We notice, for future use, that each bk(λ) is continuous (in fact, real-analytic) due to the bounded support of h in time variable.
From the numerical standpoint it is somewhat easier to find instead of the Radon projections their derivative in p. To that end we will use ; we only need its value at t = T:
In the above equation we are able to exclude λ = 0 from the integration domain since the integrand is zero at this point.
Our goal is to approximate by the Radon transform of :
However, computing by using equation (26) and by numerically evaluating its Radon transform would be relatively slow. Instead, we take advantage of the fact that the line integrals of the circular wave functions can be found analytically as closed form expressions.
Define Ik(ω(α), p, λ), with ω(α) = (cos α, sin α) as the value of the Radon transform of the function at (ω(α), p):
Compute first
Using formulas 6.941.3 and 6.941.4 in [31], one obtains, for λ > 0,
Then, for general α,
By utilizing the well-known formulas for Hankel functions of a negative argument (see [30], section10.11.7)
one verifies that (27) is valid for all λ ≠ 0.
In order to turn the above relations into an algorithm, let us assume that M point-like transducers are placed at equispaced point θj = jΔθ, j = 0, 1, 2, ‥M, and the measurements are done on an equispaced time grid ti = iΔt, i = 1, 2, ..., N. We approximate bk(λ) on a uniform grid of frequencies λl = lΔλ, l = −lNyq, ..., lNyq, where lNyqΔλ equals to the Nyquist frequency of the discretization in time. This is can be done by discretizing (25) using the trapezoid rule, and applying the fast Fourier transform (FFT) algorithm both in θ and in t. Such an approximation of the outer integral of a periodic function in (25) is quite standard. However, the use of the FFT in t is equivalent to making the boundary condition periodic in time. In order to reduce the error introduced by this effect, the computation of the inner integral should be done with enough zero-padding. On the other hand, computing bk's using the 2D FFT makes this step asymptotically (and practically) very fast.
Once coefficients bk(λl) are obtained, one can approximate the time derivative of w*(t, r, θ) at t = T:
Combining this result with (28) and substituting T = 2 we obtain
with
One easily recognizes that formula (29) is a 2D discrete Fourier transform, and thus it can be efficiently implemented using the 2D FFT. Our algorithm then consists in
- (a)Computing coefficients bk(λl) (equation (25) using 2D FFT;
- (b)Computing coefficients ak,l using (30);
- (c)Computing given by (29) using 2D FFT;
- (d)Computing for α ∈ [0, π];
- (e)Computing for α ∈ (π, 2π).
An optional sixth step is to compute F(ω, p) from by numerical anti-differentiation, while enforcing conditions F(ω, 1) = F(ω, −1) = 0 in the least square sense. This step is optional since in the formula (11) (first raw) the Hilbert transform commutes with differentiation, and therefore (11) can be easily modified to reconstruct f(x) from .
If one assumes (realistically) that M, N, and lNyq are of order of , the algorithm requires flops, since the most time consuming operations here are the 2D FFTs.
The algorithm we presented shares important computational steps with the 2D algorithm presented in [32] and with the method applicable to the reduced circular geometry in [18]. We would like to point out that the technique of [32] was developed to solve the inverse source problem with full data; reduced data were not considered. The algorithm of [18] yields a theoretically exact reconstruction from reduced data, but at the expense of a significantly reduced support of source term f(x) as compared to the theoretically visible region. In the present method, the theoretically visible region {x: x ∈ B(0, 1)} and is only slightly larger than Ω0, since δ can be chosen to be much smaller than 1. However, the present technique is not theoretically exact.
6. Numerical simulations
In this section performance of our algorithm is demonstrated in numerical simulations. The model acquisition scheme can be seen in figure 2. Measurements where modeled by using 256 samples over time interval [0, 2] (slightly more were used to produce a smooth cut-off after T = 2). There were 1024 detector locations uniformly distributed over the angle interval between 0 and 360°. These were used to model full measurements. When we modeled the reduced measurements, all the values corresponding to angle interval [190°, 350°] were set to zero. We implemented the algorithm described in the previous section in MATLAB. The time required to compute on a 256 × 1024 grid using one thread of the Intel Xeon processor E5620 running at 2.4 GHz was about 1 s. About 85% of that time was used to compute values of the Hankel functions utilized by the algorithm. This suggests that, if needed, computations can be significantly sped up by either pre-computing the Hankel functions, or by implementing the algorithm in C or Fortran that compute these functions significantly faster (cf. the computing times reported in [32]).
Figure 3(b) presents the solution u(t, x) at t = 2 of the problem (5) with full data. Recall that theoretically, in this function coincides with the solution of the forward problem (1) and (2) with the initial condition f(x) shown in part (a) of the figure. Solution of the initial/boundary problem (12) with reduced data is demonstrated in figure 3(c). The difference w(2, x) − u(2, x) (i.e. the error induced by the loss of data) is plotted in the part (d) of the figure. One can see that the singularities in this difference are all located within the lower half space. Moreover, the error within the upper half-space is smooth and quite small.
Download figure:
Standard image High-resolution imageFigure 4(a) presents the Radon projections F(ω, p) computed using our algorithm from the full data. Our algorithm is theoretically exact in this case, and F(ω, p) is indistinguishable from the exact Radon projections. Figure 4(b) demonstrates approximate projections computed from the reduced data. One can see that on the interval α ∈ [0, π] the approximate projections are quite close to F(ω, p). Part (c) of this figure shows projections G(ω(α), p) computed from using symmetry relation (14). One can notice a small jump of values occurring at α = π. However, according to proposition 9 this singularity will not propagate into the reconstructed image.
Download figure:
Standard image High-resolution imageFigures 5 and 6 demonstrate the results of applying the inverse Radon transform to the correct projections F(ω, p) and to our approximation G(ω(α), p). In detail, theoretically exact reconstruction is shown in figure 5(a). Part (b) shows the image obtained by a naïve reconstruction from reduced data; it was computed using the fast 2D algorithm from [32]. Part (c) of figure 5 presents microlocally accurate reconstruction . Visually it differs little from exhibited in part (a). The error is about 6% in the relative L∞ norm and about 3% in the relative L2 norm. The difference can be seen in figure 5(d), plotted using a much finer color scale. It appears to be smooth, in accordance with the analysis presented in the previous sections.
Download figure:
Standard image High-resolution imageDownload figure:
Standard image High-resolution imageWe have also plotted in figure 6 the graphs of the horizontal (along the line x2 = 0.2) and central vertical cross-sections the phantom f(x) and images shown in figures 5 (b) and (c). One can see that while the naïve reconstruction is incorrect even qualitatively, our technique yields a close fit to the ground truth f(x).
Acknowledgments
The authors would like to thank L Friedlander and E T Quinto for helpful discussions and useful literature references. The last two authors gratefully acknowledge partial support from the NSF, award NSF/DMS 1814592. M Eller and L Kunyansky are grateful to the University of Lübeck for organizing the workshop 'Modeling, analysis, and approximation theory toward applications in tomography and inverse problems' in June 2016 supported by the Volkswagen Foundation, that initiated their collaboration. Finally, the authors thank the anonymous referees for suggestions on improving this paper.