Skip to main content
NIHPA Author Manuscripts logoLink to NIHPA Author Manuscripts
. Author manuscript; available in PMC: 2013 Jul 31.
Published in final edited form as: Inverse Probl. 2012 Jul 31;28(9):095005. doi: 10.1088/0266-5611/28/9/095005

A direct D-bar reconstruction algorithm for recovering a complex conductivity in 2-D

S J Hamilton *, C N L Herrera , J L Mueller , A Von Herrmann §
PMCID: PMC3638890  NIHMSID: NIHMS441205  PMID: 23641121

Abstract

A direct reconstruction algorithm for complex conductivities in W2,∞ (Ω), where Ω is a bounded, simply connected Lipschitz domain in ℝ2, is presented. The framework is based on the uniqueness proof by Francini [Inverse Problems 20 2000], but equations relating the Dirichlet-to-Neumann to the scattering transform and the exponentially growing solutions are not present in that work, and are derived here. The algorithm constitutes the first D-bar method for the reconstruction of conductivities and permittivities in two dimensions. Reconstructions of numerically simulated chest phantoms with discontinuities at the organ boundaries are included.

1 Introduction

The reconstruction of admittivies γ from electrical boundary measurements is known as the inverse admittivity problem. The unknown admittivity appears as a complex coefficient γ(z) = σ(z) + iωε(z) in the generalized Laplace equation

·(γ(z)u(z))=0,zΩ,uΩ=f, (1)

where u is the electric potential, σ is the conductivity of the medium, ε is the permittivity, and ω is the temporal angular frequency of the applied electromagnetic wave. The data is the Dirichlet-to-Neumann, or voltage-to-current density map defined by

Λγu=γuν|Ω, (2)

where uH1(Ω) is the solution to (1). By the trace theorem Λγ: H1/2(Ω) → H−1/2(Ω).

In this work we present a direct reconstruction algorithm for the admittivity γ. The majority of the theory is based on the 2000 paper by Francini [21] in which it is established that if σ, εW2,∞(Ω), where Ω is a bounded domain in ℝ2 with Lipschitz boundary, then the real-valued functions σ and ε are uniquely determined by the Dirichlet-to-Neumann map, provided that the imaginary part of the admittivity is sufficiently small. The proof in [21] is based on the D-bar method and is nearly constructive, but equations linking the scattering transform and the exponentially growing solutions to the Dirichlet-to-Neumann data are not used in the proof, and so it does not contain a complete set of equations for reconstructing the admittivity. In this work, we derive the necessary equations for a direct, nonlinear reconstruction algorithm for the admittivity γ. Furthermore, we establish the existence of exponentially growing solutions to (1), which prove to be useful in relating the Dirichlet-to-Neumann data to the scattering transform. The reconstruction formula in [21] is for the potential Qγ, whose relationship to γ is described below. We provide a direct formula for γ from the D-bar equations in [21], which is computationally advantageous as well.

The inverse admittivity problem has an important application known as electrical impedance tomography (EIT). The fact that the electrical conductivity and permittivity vary in the different tissues and organs in the body allows one to form an image from the reconstructed admittivity distribution. In the 2-D geometry, EIT is clinically useful for chest imaging. Conductivity images have been used for monitoring pulmonary perfusion [9, 23, 48], determining regional ventilation in the lungs [24, 22, 52], and the detection of pneumothorax [16], for example. In three dimensions, conductivity images have been used, for instance, in head imaging [51, 50] and knowledge of the admittivity has been applied to breast cancer detection [8, 31, 32].

Reconstruction algorithms based on a least-squares approach that reconstruct permittivity include [19, 8, 30]. The aforementioned algorithms are iterative, whereas the work presented here is a direct method that makes use of exponentially growing solutions, or complex geometrical optics (CGO) solutions, to the admittivity equation. The steps of the algorithm are to compute these CGO solutions from knowledge of the Dirichlet-to-Neumann map, to compute a scattering transform matrix, to solve two systems of ∂̄ (D-bar) equations in the complex frequency variable k for the CGO solutions to a related elliptic system, and finally to reconstruct the admittivity from the values of these solutions at k = 0. In this work, we provide a complete implementation of this algorithm and present reconstructions of several numerical phantoms relevant to medical EIT imaging. The phantoms we consider here are discontinuous at the organ boundaries, which is actually outside the theory of the algorithm. The work [26] contains computations of smooth admittivities and validates our formulas and computations by comparing the results of the intermediate functions (CGO solutions and scattering transforms) with those computed from knowledge of the admittivity.

We briefly review the history of results using CGO solutions on the inverse conductivity problem in dimension 2. The inverse conductivity problem was first introduced by A.P. Calderón [12] in 1980, where he proved that, in a linearized version of the problem, the Dirichlet-to-Neumann map uniquely determines the conductivity, and he proposed a direct reconstruction method for this case. An implementation in dimension two for experimental data is found in [6]. In 1996, Nachman [44] presented a constructive proof of global uniqueness for twice differentiable conductivities using D-bar methods. The D-bar algorithm following from [44, 46] has been applied to simulated data in [39, 41, 27, 38] and to experimental data on tanks and in vivo human data in [28, 29, 42, 18]. While the initial scattering transform was regularized using a Born approximation, a more recent paper [40] contains a full nonlinear regularization analysis, including estimates on speed of convergence in Banach spaces, for twice differentiable conductivities. The regularity conditions on the conductivity were relaxed to once-differentiable in [10]. The proof uses D-bar techniques and formulates the problem as a first-order elliptic system. A reconstruction method based on [10] can be found in [33, 34, 35]. Francini [21] provided a proof of unique identifiability for the inverse admittivity problem for σ, εW2,∞ (Ω), with ω small. Her work provides a nearly constructive proof based on D-bar methods on a first-order elliptic system similar to that in [10]. A non-constructive proof that applies to complex admittivities with no smallness assumption is found in [11]. Astala and Päivärinta provide a CGO-based constructive proof for real conductivities σL(Ω), and numerical results related to this work can be found in [3, 4].

The paper is organized as follows. In Section 2 we describe the direct reconstruction algorithm, which is comprised of boundary integral equations for the exponentially growing solutions to (1) involving the Dirichlet-to-Neumann data, boundary integral equations relating those CGO solutions and the CGO solutions Ψ of the first order system, equations for the scattering transform involving only the traces of Ψ, the ∂̄k equations established in [21], and the direct reconstruction formula for Qγ and thus γ. Derivations of the novel equations are found in this section. Section 3 describes the numerical implementation of the algorithm. Results on noisy and non-noisy simulated data of a cross-sectional chest with discontinuous organ boundaries are found in Section 4.

2 The Direct Reconstruction Algorithm

In this section we will provide the equations for the direct reconstruction algorithm, completing the steps for the proof in [21] to be completely constructive. In particular, boundary integral equations relating the CGO solutions to the Dirichlet-to-Neumann (DN) map are derived.

Let Ω ⊂ ℝ2 be a bounded open domain with a Lipschitz boundary. Throughout we assume that there exist positive constants σ0 and β such that

σ(z)>σ0,zΩR2 (3)

and

||σ||W1,(Ω),||ε||W1,(Ω)β. (4)

We extend σ and ε from Ω to all of ℝ2 such that σ ≡ 1 and ε ≡ 0 outside a ball with fixed radius that contains Ω, and (3) and (4) hold for all of ℝ2. In fact, all that is required is that γ is constant outside that ball of fixed radius; for convenience we look at the case where γ ≡ 1.

The proof in [21] closely follows that of [10] for conductivities σW1,p(Ω), p > 2. The matrix potential Qγ is, however, defined slightly differently, and since the potential in [21] is not Hermitian, the approach in [21] is to consider the complex case as a perturbation from the real case provided the imaginary part of γ is small. Define Qγ(z) and a matrix operator D by

Qγ(z)=(0-12zlogγ(z)-12¯zlogγ(z)0),D=(¯z00z). (5)

Thus we define

Q12(z)=-12zlogγ(z)andQ21(z)=-12¯zlogγ(z), (6)

and equivalently we can write

Q12(z)=-zγ1/2(z)γ1/2(z)andQ21(z)=-¯zγ1/2(z)γ1/2(z), (7)

or

Q12(z)=-12γ-1(z)γ(z)andQ21(z)=-12γ-1(z)¯γ(z). (8)

Defining a vector

(vw)=γ1/2(u¯u), (9)

in terms of the solution u to (1), one sees that

D(vw)-Qγ(vw)=0.

The uniqueness result in [21] is

Theorem 2.1. (Theorem 1.1 [21])

Let Ω be an open bounded domain in ℝ2 with Lipschitz boundary. Let σj and εj, for j = 1, 2 satisfy assumptions (3) and ||σ||W2, ∞ (Ω), ||ε||W2, ∞(Ω)β. There exists a constant ω0 = ω0(β, σ0, Ω) such that if γj = σj + iωεj for j = 1, 2 and ω < ω0 and if

Λγ1=Λγ2,

then

σ1=σ2andε1=ε2.

2.1 CGO solutions

Francini shows in [21] that for ω sufficiently small and γ satisfying (3) and (4) there exists a unique 2 × 2 matrix M(z, k) for k ∈ ℂ satisfying

M(·,k)-ILp(R2),forsomep>2, (10)

that is a solution to

(Dk-Qγ(z))M(z,k)=0, (11)

where Dk is the matrix operator defined by

DkM=DM-ik(100-1)Moff,

and “off” denotes the matrix consisting of only the off-diagonal entries of M. The system (11) is equivalent to the following set of equations, included for the reader’s convenience

¯zM11-Q12M21=0(¯z-ik)M12-Q12M22=0(z+ik)M21-Q21M11=0zM22-Q21M12=0. (12)

Thus, there exists a unique matrix Ψ(z, k) defined by

Ψ(z,k)=M(z,k)(eizk00e-iz¯k)=(eizkM11(z,k)e-iz¯kM12(z,k)eizkM21(z,k)e-iz¯kM22(z,k)), (13)

that is a solution to

(D-Qγ)Ψ=0, (14)

or equivalently

¯zΨ11-Q12Ψ21=0zΨ21-Q21Ψ11=0¯zΨ12-Q12Ψ22=0zΨ22-Q21Ψ12=0. (15)

These CGO solutions Ψ(z, k) are key functions in the reconstructions, but the proof in [21] does not provide a link from these functions to the DN data. A useful link can be established through exponentially growing solutions to the admittivity equation (1). For γ − 1 with compact support, equation (1) can be studied on all of ℝ2, and introducing the complex parameter k, two distinct exponentially growing solutions, which differ in their asymptotics, exist. We will denote these solutions by u1 and u2 where u1~eikzik and u2~e-ikz¯-ik in a sense that is made precise in Theorems 2.2 and 2.3, where the existence of such solutions is established. The proof will make use of the following lemma proved in the real case by Nachman [44]; the complex version shown here also holds and was used in [21]. The lemma is also true if ∂̄z is interchanged with z.

Lemma 2.1

Let 1 < s < 2 and 1r=1s-12.

  1. If the complex function vLs(ℝ2), then there exists a unique complex function uLr(ℝ2) such that (z + ik)u = v.

  2. If the complex function vLr(ℝ2) and ∂̄zvLs(ℝ2), k ∈ ℂ\{0}, then there exists a unique complex function uW1,r(ℝ2) such that (z+ik)u = v.

  3. If the complex function vLr(ℝ2) and ∂̄zvLs(ℝ2), k ∈ ℂ\{0}, then there exists a unique complex function uW1,r(ℝ2) such that (∂̄zik)u = v.

The following lemma will also be used in the proofs of Theorems 2.2 and 2.3.

Lemma 2.2

For ω sufficiently small and γ satisfying (3) and (4), the following identities hold:

¯z(γ(z)-1/2M11(z,k)-1)=(z+ik)(γ(z)-1/2M21(z,k)) (16)
z(γ(z)-1/2M22(z,k)-1)=(¯z-ik)(γ(z)-1/2M12(z,k)). (17)
Proof

By the product rule,

¯z(γ(z)-1/2M11(z,k)-1)=¯z(γ(z)-1/2)M11(z,k)+γ(z)-1/2¯z(M11(z,k))=γ(z)-1/2Q21(z)M11(z,k)+γ(z)-1/2Q12(z)M21(z,k)=γ(z)-1/2(z+ik)M21(z,k)+γ(z)-1/2Q12(z)M21(z,k).

The second and third equalities utilized (6) and (12), respectively.

We also have

(z+ik)(γ(z)-1/2M21(z,k))=z(γ(z)-1/2M21(z,k))+ikγ(z)-1/2M21(z,k)=z(γ(z)-1/2)M21(z,k)+γ(z)-1/2z(M21(z,k))+ikγ(z)-1/2M21(z,k)=γ(z)-1/2Q12(z)M21(z,k)+γ(z)-1/2(z+ik)M21(z,k).

This establishes (16).

Similarly, using (6) and (12),

z(γ(z)-1/2M22(z,k)-1)=z(γ(z)-1/2)M22(z,k)+γ(z)-1/2z(M22(z,k))=γ(z)-1/2Q12(z)M22(z,k)+γ(z)-1/2Q21(z)M12(z,k)=γ(z)-1/2(¯z-ik)M12(z,k)+γ(z)-1/2Q21(z)M12(z,k).

We also have

(¯z-ik)(γ(z)-1/2M12(z,k))=¯z(γ(z)-1/2M12(z,k))-ikγ(z)-1/2M12(z,k)=¯z(γ(z)-1/2)M12(z,k)+γ(z)-1/2¯z(M12(z,k))-ikγ(z)-1/2M12(z,k)=γ(z)-1/2Q21(z)M12(z,k)+γ(z)-1/2(¯z-ik)M12(z,k).

This establishes (17).

Knudsen establishes the existence of exponentially growing solutions to the conductivity equation in the context of the inverse conductivity problem in [33]. The proofs of their existence for the admittivity equation and the associated boundary integral equations are in the same spirit as [33].

Theorem 2.2

Let γ(z) ∈ W1,p(Ω), with p > 2 such that σ and ε satisfy (3) and (4), and let γ(z) − 1 have compact support in W1,p(Ω). Then for all k ∈ ℂ\{0} there exists a unique solution

u1(z,k)=eikz[1ik+w1(z,k)], (18)

to the admittivity equation in ℝ2 such that w1(·, k) ∈ W1,r(ℝ2), 2 < r < ∞. Moreover, the following equalities hold:

(z+ik)[e-ikzu1(z,k)-1ik]=γ-1/2(z)M11(z,k)-1 (19)
¯z[e-ikzu1(x,k)-1ik]=γ-1/2(z)M21(z,k), (20)

and

e-ikzu1(x,k)-1ikW1,r(R2)C(1+1k), (21)

for some constant C.

Theorem 2.3

Let γ(z) satisfy the hypotheses of Theorem 2.2. Then for all k ∈ ℂ\{0} there exists a unique solution

u2(z,k)=e-ikz¯[1-ik+w2(z,k)], (22)

to the admittivity equation in ℝ2 with w2(·, k) ∈ W1,r(ℝ2), 2 < r < ∞. Moreover, the following equalities hold:

(¯z-ik)[eikz¯u2(z,k)+1ik]=γ-1/2(z)M22(z,k)-1 (23)
z[eikz¯u2(z,k)+1ik]=γ-1/2(z)M12(z,k), (24)

and

eikz¯u2(z,k)+1ikW1,r(R2)C(1+1k), (25)

for some constant C.

We will prove Theorem 2.2; the proof of Theorem 2.3 is analogous.

Proof

Assume u is a solution of the admittivity equation of the form (18), and let (v, w)T = γ1/2(z u, ∂̄z u)T be the corresponding solution to (DQγ) Ψ = 0. Define the complex function v via v(z, k) = γ(z)−1/2M11(z, k) − 1. We will first show there exists a unique complex function w1W1,r(ℝ2), where r > 2 such that (z+ik)w = v, for k ∈ ℂ\{0}. Let us rewrite v as follows:

v(z,k)=γ(z)-1/2[M11(z,k)-1]+[γ(z)-1/2-1].

Let r > 2 and 1 < s < 2 with 1r=1s-12. We know by Theorem 4.1 of [21] that there exists a constant C > 0 depending on β, σ0 and p such that sup ||M11 (z, k) − 1||Lr(ℝ2)C for every r > 2, and that γ(z)−1/2 − 1 has compact support in W1,r(ℝ2). It follows that vLr(ℝ2), and by Minkowski’s Inequality

||v(z,k)||Lr=γ(z)-1/2[M11(z,k)-1]+[γ(z)-1/2-1]LrCr,γ,

where Cr,γ depends on r and the bounds on σ and ε.

From (8),

¯zv(z,k)=¯z(γ(z)-1/2M11(z,k)-1)=(¯zγ(z)-1/2)M11(z,k)+γ(z)-1/2(¯zM11(z,k))=γ(z)-1/2Q21(z)M11(z,k)+γ(z)-1/2Q12(z)M21(z,k)=γ(z)-1/2Q21(z)[M11(z,k)-1]+γ(z)-1/2Q21(z)+γ(z)-1/2Q12(z)M21(z,k)

We know that γ(z)−1/2Q21(z) ∈ Lα(ℝ2) with 1 ≤ αp since Q12(z) has compact support. It follows that γ(z)−1/2Q21(z) ∈ Ls(ℝ2) ∩ L2(ℝ2). By the generalized Hölder’s inequality and the fact that ||M11(z, k) − 1||Ls is bounded with 1s=1r+12, we have ∂̄z vLs(ℝ2) and ||∂̄z v||Ls(ℝ2)Kr, γ, where Kr, γ depends only on r and the bounds on σ and ε. Thus, by Lemma 2.1 (2), there exists a unique solution w1(z, k) ∈ W1,r(ℝ2) such that

(z+ik)w1(z,k)=γ(z)-1/2M11(z,k)-1. (26)

We have by (16),

¯(γ(z)-1/2M11(z,k)-1)=(z+ik)(γ(z)-1/2M21(z,k)). (27)

Taking ∂̄z of both sides of (26) and using (27),

¯z(z+ik)w1(z,k)=¯z(γ(z)-1/2M11(z,k)-1)=(z+ik)(γ(z)-1/2M21(z,k)). (28)

Using the fact ∂̄( + ik) = ( + ik)∂̄, it follows that

(z+ik)(¯zw1(z,k)-(z)-1/2M21(z,k))=0. (29)

Since ∂̄z w1(z, k) − γ(z)−1/2M21(z, k) ∈ Lr(ℝ2), by Lemma 2.1 (1), we must have

¯zw1(z,k)=γ(z)-1/2M21(z,k). (30)

We now define

u1(z,k)=eikz[w1(z,k)+1ik], (31)

then by (26)

(z+ik)(e-ikzu1(z,k)-1ik)=(z+ik)w1(z,k)=γ-1/2(z)M11(z,k)-1,

which proves (19), and by (30)

¯z(e-ikzu1(z,k)-1ik)=¯zw1(z,k)=γ-1/2(z)M21(z,k),

which proves (20).

The norm estimate given by (21) follows by Minkowski’s Inequality, the constant C depends on r, the bound on γ − 1, and the bounds on σ and ε.

Remark

Note that from (19)

γ-1/2M11(z,k)-1=(z+ik)(e-ikzu1(z,k)-1ik)=z(e-ikzu1)+ike-ikzu1(z,k)-1=e-ikzzu1(z,k)-1, (32)

and from (20)

γ-1/2M21(z,k)=¯z(e-ikzu1(z,k)-1ik)=u1(z,k)¯z(e-ikz)+e-ikz¯zu1(z,k)=e-ikz¯zu1(z,k). (33)

Thus, we can equivalently rewrite (19) and (20), respectively, as

γ1/2(z)zu1(z,k)=eikzM11(z,k)=Ψ11(z,k) (34)
γ1/2(z)¯zu1(z,k)=eikzM21(z,k)=Ψ21(z,k). (35)

In a similar manner, we can rewrite (23) and (24), respectively, as

γ1/2(z)¯zu2(z,k)=e-ikz¯M22(z,k)=Ψ22(z,k) (36)
γ1/2(z)zu2(z,k)=e-ikz¯M12(z,k)=Ψ12(z,k). (37)

Useful boundary integral equations for the traces of u1 and u2 can be derived under the additional assumption that γW2,p and u1, u2W2,p, p > 1. The following proposition shows a relationship between the exponentially growing solutions ψS(z, k) (when they exist) to the Schrödinger equation

(-Δ+qS(z))ψS(z,k)=0, (38)

and the CGO solutions u1 and u2 to (1). The solution ψS to (38), where qS is complex, is asymptotic to eikz in the sense that

wSe-ikzψS(·,k)-1Lp¯L,

where 1p=1p-12 and 1 < p < 2. The question of the existence of a unique solution to (38) is addressed for real γ in [44], where it is shown to exist if and (roughly) only if qS=Δγ1/2γ1/2. The solutions ψS will be used to derive the boundary integral equations for u1 and u2, but not in the direct reconstruction algorithm.

Lemma 2.3

Let γ(z) = σ(z) + iωε(z) ∈ W2,p(Ω), with p > 2 such that σ and ε satisfy (3) and (4), and let γ(z) − 1 have compact support in W1,p(Ω). Let u1 be the exponentially growing solution to the admittivity equation as given in Theorem 2.2, and let ψS be the exponentially growing solution to the Schrödinger equation (38), when it exists. Then

iku1(z,k)=γ-1/2(z)ψS(z,k). (39)
Proof

From (18),

iku1(z,k)=eikz(1+ikw1(z,k))=eikzγ-1/2(z)[γ1/2(z)+γ1/2(z)ikw1(z,k)]=eikzγ-1/2(z)(1+[γ1/2(z)-1]+γ1/2(z)ikw1(z,k))

satisfies the admittivity equation with [γ1/2(z)−1]+γ1/2(z)ikw1(z, k) ∈ W1,r(Ω) for r > 2. We also know that when it exists,

γ-1/2(z)ψS(z,k)=eikzγ-1/2(z)(1+wS(z,k)) (40)

is also a solution to the admittivity equation with wS(z, k) ∈ W1, (ℝ2). Hence, these exponentially growing solutions must be equal.

Lemma 2.4

Let γ(z) = σ(z) + iωε(z) ∈ W2,p(Ω), with p > 2 such that σ and ε satisfy (3) and (4), and let γ(z) − 1 have compact support in W1,p(Ω). Let u2 be the exponentially growing solution to the admittivity equation as given in Theorem 2.3, and let ψS be the exponentially growing solution to the Schrödinger equation (38), when it exists. Then

-iku2(z,k)=γ-1/2(-z¯)ψS(-z¯,k). (41)
Proof

From (22),

-iku2(z,k)=e-ikz¯(1-ikw2(z,k))=e-ikz¯γ-1/2(-z¯)(1+[γ1/2(-z¯)-1]-γ1/2(-z¯)ikw2(z,k))

satisfies the admittivity equation with [γ1/2(−) − 1] − γ1/2(−)ikw2(z, k) ∈ W1,r(Ω) for r > 2. From (40),

γ1/2(-z¯)ψS(-z¯,k)=e-ikz¯γ1/2(-z¯)(1+wS(-z¯,k))

satisfies the admittivity equation with wS(−, k) ∈ W1,p̄(ℝ2). Thus, these exponentially growing solutions must be equal, and so

-iku2(z,k)=γ-1/2(-z¯)ψS(-z¯,k).

Let us recall some terminology arising from [44] before establishing boundary integral equations involving the exponentially growing solutions. Let Λσ be the Dirichlet-to-Neumann map when Ω contains the conductivity distribution σ, and Λ1 is the Dirichlet-to-Neumann map for a homogeneous conductivity equal to 1. The Faddeev Green’s function Gk(z) is defined by

Gk(z):=eik·zgk(z),-ΔGk=δ, (42)

where

gk(z):=1(2π)2R2eiz·ξξ(ξ¯+2k)dξ,(-Δ-4ik¯)gk=δ, (43)

for k ∈ ℂ\{0}. In the real-valued case γ = σ, the trace of the function ψS(·, k) on Ω satisfies the integral equation [44]

ψS(z,k)=eikz-ΩGk(z-ζ)(Λσ-Λ1)ψS(ζ,k)dS(ζ),zΩ, (44)

where k ∈ ℂ\{0}. The equation (44) is a Fredholm equation of the second kind and uniquely solvable in H1/2(Ω) for any k ∈ ℂ\{0}.

The boundary integral equations for u1 and u2 are similar to (44).

Theorem 2.4

Let γW2,p(Ω) for p > 1 and suppose γ = 1 in a neighborhood of Ω. Suppose σ and ε satisfy (3) and (4), and let γ(z) − 1 have compact support in W2,p(Ω). Then for any nonexceptional k ∈ ℂ\{0}, the trace of the exponentially growing solution u1(·, k) on Ω is the unique solution to

u1(z,k)=eikzik-ΩGk(z-ζ)(Λγ-Λ1)u1(ζ,k)dS(ζ),zΩ. (45)
Proof

Let 1p=1r-12, where 1 < r < 2 and p > 2. Let {γn}nNW2, r(Ω) be a sequence converging to γW1,p(Ω). Then by the Sobolev Embedding Theorem, {γn}n∈ℕW1,r (Ω). Let ψn be the exponentially growing solutions to the Schrödinger equation with potential γn-1/2Δγn1/2, and un be the CGO solutions defined by Theorem 2.2 to the admittivity equation with admittivity γn. Then for each n ∈ ℕ, the complex γ version of (44) holds for nonexceptional k ∈ ℂ\{0}

ψn(z,k)Ω=eikzΩ-ΩGk(z-ζ)(Λγn-Λ1)ψn(ζ,k)dS(ζ), (46)

where γn = 1 in the neighborhood of Ω.

It follows by (39) that for each complex number k ≠ 0, and for each n ∈ ℕ

γn-1/2(z)ikψn(z,k)=un(z,k)u1(z,k)inH1/2(Ω). (47)

We claim that for each n, un satisfies (45). To see this, by (39), for zΩ,

eikzik-ΩGk(z-ζ)(Λγ-Λ1)un(ζ,k)dS(ζ)=eikzik-ΩGk(z-ζ)(Λγ-Λ1)γn-1/2(ζ)ikψn(ζ,k)dS(ζ)=γn-1/2(z)ikψn(z,k)=un(z,k), (48)

where we used the fact that γn = 1 in a neighborhood of Ω. Thus, un satisfies (45) for each n ∈ ℕ.

We know by Theorem 3.1 of [21] that M(z, k) depends continuously on γ. From (47), we can conclude that

ΩGk(z-ζ)(Λγn-Λ1)un(ζ,k)dS(ζ)ΩGk(z-ζ)(Λγ-Λ1)u1(ζ,k)dS(ζ). (49)

Thus, by (47), (48), and (49), we have that u1(·, k)|Ω satisfies (45). The uniqueness of u1(·, k)|Ω follows by Theorem 2.2.

An analogous theorem holds for u2.

Theorem 2.5

Let γW2,p(Ω) for p > 1 and suppose γ = 1 in a neighborhood of Ω. Suppose σ and ε satisfy (3) and (4), and let γ(z) − 1 have compact support in W2,p(Ω). Then for any nonexceptional k ∈ ℂ\{0}, the trace of the exponentially growing solution u2(·, k) on Ω is the unique solution to

u2(z,k)=e-ikz¯-ik-ΩGk(-z¯+ζ¯)(Λγ-Λ1)u2(ζ,k)dS(ζ),zΩ. (50)
Proof

Let p, r, {γn}nNW2,r(Ω), and ψn be as in the proof of Theorem 2.4. Let un be the CGO solutions defined in Theorem 2.3 to the admittivity equation with admittivity γn. Then for each n ∈ ℕ, for nonexceptional k ∈ ℂ\{0}, evaluating (46) at −,

ψn(-z¯,k)Ω=e-ikz¯Ω-ΩGk(-z¯-ζ)(Λγn-Λ1)ψn(ζ,k)dS(ζ), (51)

where γn = 1 in a neighborhood of Ω.

It follows by (41) that for each complex number k ≠ 0, and for each n ∈ ℕ

γn-1/2(-z¯)-ikψn(-z¯,k)=un(z,k)u2(z,k)inH1/2(Ω). (52)

We claim that for each n, un satisfies (50). To see this, by (41), for zΩ,

e-ikz¯-ik-ΩGk(-z¯+ζ¯)(Λγ-Λ1)un(ζ,k)dS(ζ)=e-ikz¯-ik-ΩGk(-z¯+ζ¯)(Λγ-Λ1)γn-1/2(-ζ¯)-ikψn(-ζ¯,k)dS(ζ)=e-ikz¯-ik-ΩGk(-z¯-ζ¯)(Λγ-Λ1)γn-1/2(ζ)-ikψn(ζ,k)dS(ζ)=γn-1/2(-z¯)-ikψn(-z¯,k)=un(z,k), (53)

using the change of variables −ζ̄ζ̄ and the fact that γn = 1 in a neighborhood of Ω. Thus, un satisfies (50) for each n ∈ ℕ.

We know by Theorem 3.1 of [21] that M(z, k) depends continuously on γ. From (52), we can conclude that

ΩGk(-z¯+ζ¯)(Λγn-Λ1)un(ζ,k)dS(ζ)ΩGk(-z¯+ζ¯)(Λγ-Λ1)u2(ζ,k)dS(ζ). (54)

Thus, by (52), (53), and (54), we have that u2(·, k)|Ω satisfies (50). The uniqueness of u2(·, k)|Ω follows by Theorem 2.3.

2.2 The Scattering Transform Matrix

The scattering transform Sγ(k) of the matrix potential Qγ is defined in [21] by

Sγ(k)=iπR2(0Q12(z)e(z,-k¯)M22(z,k)-Q21(z)e(z,k)M11(z,k)0)dμ(z), (55)

where e(z, k) = exp{i(zk + z̄k̄)}. Thus we are only concerned with computing the off-diagonal entries of Sγ, which we will denote by S12(k) and S21(k).

Boundary integral formulas for the off-diagonal entries of Sγ(k) in (55) can be computed by integration by parts as follows

S12(k)=iπΩQ12(z)e-ik¯zΨ22(z,k)dμ(z)=iπΩe-ik¯z¯zΨ12(z,k)dμ(z)=i2πΩe-ik¯zΨ12(z,k)(ν1+iν2)dS(z)-iπΩ¯ze-ik¯zΨ12(z,k)dμ(z)=i2πΩeik¯zΨ12(z,k)(ν1+iν2)dS(z) (56)

and similarly,

S21(k)=-i2πΩeik¯z¯Ψ21(z,k)(ν1-iν1)dS(z), (57)

where ν = ν1 + 2 denotes the outward unit normal to the boundary Ω.

Theorem 2.6

The trace of the exponentially growing solutions Ψ12(z, k) and Ψ21(z, k) for k ∈ ℂ\{0} can be determined by

Ψ12(z,k)=Ωeik¯(z-ζ)4π(z-ζ)[Λγ-Λ1]u2(ζ,k)dS(ζ) (58)
Ψ21(z,k)=Ω[eik(z-ζ)4π(z-ζ)]¯[Λγ-Λ1]u1(ζ,k)dS(ζ), (59)

where u1 and u2 are calculated via equations (45) and (50) respectively.

Proof

We use the relations in (35) and (37) to obtain boundary integral equations for Ψ21 and Ψ12 for zΩ from Equations (45) and (50), respectively. Let us begin with Ψ12:

Ψ12(z,k)=γ1/2(z)zu2(z,k)=γ1/2(z)z[e-ikz¯-ik-ΩGk(-z¯+ζ¯)[Λγ-Λ1]u2(ζ,k)dS(ζ)]=-γ1/2(z)Ωz[Gk(-z¯+ζ¯)][Λγ-Λ1]u2(ζ,k)dS(ζ). (60)

Similarly,

Ψ21(z,k)=γ1/2(z)¯zu1(z,k)=γ1/2(z)¯z[eikzik-ΩGk(z-ζ)[Λγ-Λ1]u1(ζ,k)dS(ζ)]=-γ1/2(z)Ω¯z[Gk(z-ζ)][Λγ-Λ1]u1(ζ,k)dS(ζ). (61)

A thorough study of the properties of the Faddeev Green’s function Gk and its derivatives is given in [47]. The calculations for the specific derivatives needed here are shown below. By the definition of Gk (42)

zGk(-z¯+ζ¯)=z[eik(-z¯+ζ¯)gk(-z¯+ζ¯)]=eik(-z+ζ¯)zgk(-z¯+ζ¯). (62)

Using the definition of gk (43),

zgk(-z¯+ζ¯)=z1(2π)2R2ei(-z¯+ζ¯)·ξξ(ξ¯+2k)dξ=1(2π)2R2z[e-(i/2)(z¯ξ¯+zξ)]eiζ¯·ξξ(ξ¯+2k)dξ=1(2π)2R2(iξ/2)ei(-z¯+ζ¯)·ξξ(ξ¯+2k)dξ=ei(-z¯+ζ¯)·(-2k¯)41(2π)2R22ei(-z¯+ζ¯)·(ξ+2k¯)i(ξ+2k¯¯)dξ=ei(-z¯+ζ¯)·(-zk¯)4π(-z¯+ζ¯¯)=-e-ik(-z¯+ζ¯)e-ik¯(-z+ζ)4π(z-ζ) (63)

by the definition of the inverse Fourier transform and the well known result

F-1{2iξ¯}(z)-1πz¯.

Therefore, by (62) and (63)

zGk(-z¯+ζ¯)=-eik¯(z-ζ)4π(z-ζ). (64)

The ∂̄z derivative for Ψ21 is calculated in a similar manner,

¯zGk(z-ζ)=-[eik(z-ζ)4π(z-ζ)]¯. (65)

Substituting the representations for z Gk(− + ζ̄) and ∂̄z Gk(zζ), given in (64) and (65), back into the equations for Ψ12 and Ψ21, given in (60) and (61) respectively, proves the theorem.

2.3 From S(k) to M

The dependence of M on the complex parameter k is related to the scattering transform through the following ∂̄k system.

Theorem 2.7 (Theorem 4.1 [21])

Let σ and ε satisfy (3) and (4) and let M be the unique solution to (11) satisfying (10). The map kM(·, k) is differentiable as a map into L-βr, and satisfies the equation

¯kM(z,k)=M(z,k¯)(e(z,k¯)00e(z,-k))Sγ(k), (66)

where

Sγ(k)=iπR2(e(z,-k¯)00-e(z,k))(QγM)off(z,k)dμ(z). (67)

Moreover, for every p > 2,

supk||M(z,·)-I||Lp(R2)K2,

where K2 depends on β, σ0, Ω, and p.

Notice that Equation (66) can be written as the following two systems of equations:

{¯kM11(z,k)=M12(z,k¯)e(z,-k)S21(k)¯kM12(z,k)=M11(z,k¯)e(z,k¯)S12(k), (68)

and

{¯kM21(z,k)=M22(z,k¯)e(z,-k)S21(k)¯kM22(z,k)=M21(z,k¯)e(z,k¯)S12(k), (69)

included for the reader’s convenience.

2.4 From M to γ

Theorem 2.8 (Theorem 6.2 [21])

For any ρ > 0,

Qγ(z)=limk0μ(Bρ(0))-1{k:k-k0<ρ}DkM(z,k)dμ(k). (70)

This provides a reconstruction formula for the entries of Qγ, and one can recover γ from Q12=-12zlog(γ) or Q21=-12¯zlog(γ). However, this formula is computationally impractical as it requires a large k limit of integrals involving ∂̄z and z derivatives of M(z, k).

We have derived computationally advantageous formulas for recovering the entries of Qγ that only require knowledge of the CGO solutions at k = 0. Theorem 2.9 provides this direct relation between the CGO solutions M(z, 0) (from the ∂̄k equation (66)) and the matrix potential Qγ(z), eliminating the large k limit required in equation (70) above.

Theorem 2.9

The entries of the potential matrix Qγ(z) defined in (5) can be calculated using only knowledge of the CGO solutions M(z, 0) via

Q12(z)=¯zM+(Qγ,z,0)M-(Qγ,z,0) (71)
Q21(z)=zM-(Qγ,z,0)M+(Qγ,z,0). (72)

where,

M+(Qγ,z,k)=M11(Qγ,z,k)+e(z,-k)M12(Qγ,z,k) (73)
M-(Qγ,z,k)=M22(Qγ,z,k)+e(z,k)M21(Qγ,z,k). (74)
Proof

We follow an idea similar to that in [5] and define

M+(Qγ,z,k)=M11(Qγ,z,k)+e(z,-k)M12(Qγ,z,k) (75)
M-(Qγ,z,k)=M22(Qγ,z,k)+e(z,k)M21(Qγ,z,k). (76)

Note that M+ and M are only dependent on the Qγ matrix, not -QγT as is required in [5]. Therefore,

¯zM+(Qγ,z,k)=Q12(z)e(z,-k)[M-(Qγ,z,k)=+i(k-k¯)M12(Qγ,z,k)]zM-(Qγ,z,k)=Q21(z)e(z,k)M+(Qγ,z,k),

so that

¯zM+(Qγ,z,0)=Q12(z)M-(Qγ,z,0)zM-(Qγ,z,0)=Q21(z)M+(Qγ,z,0).

One can then reconstruct the log of the admittivity γ from either Q12 or Q21 by inverting the z or ∂̄z operator respectively, and exponentiate to recover explicitly

log(γ(z))=-2πCQ12(ζ)z¯-ζdμ(ζ)=-2πCQ21(ζ)z-ζdμ(ζ). (77)

2.5 The steps of the algorithm

We now have all the necessary steps for a direct reconstruction algorithm:

  1. Compute the exponentially growing solutions u1(z, k) and u2(z, k) to the admittivity equation from the boundary integral formulas (45) and (50)
    u1(z,k)Ω=eikzik|Ω-ΩGk(z-ζ)(Λγ-Λ1)u1(ζ,k)dS(ζ)u2(z,k)Ω=eikz¯-ik|Ω-ΩGk(-z¯+ζ¯)(Λγ-Λ1)u2(ζ,k)dS(ζ).
  2. Compute the off diagonal entries of the CGO solution Ψ(z, k) for zΩ from the boundary integral formulas (58) and (59)
    Ψ12(z,k)=Ωeik¯(z-ζ)4π(z-ζ)[Λγ-Λ1]u2(ζ,k)dS(ζ)Ψ21(z,k)=Ω[eik(z-ζ)4π(z-ζ)]¯[Λγ-Λ1]u1(ζ,k)dS(ζ).
  3. Compute the off-diagonal entries of the scattering matrix Sγ(k) from (56) and (57)
    S12(k)=i2πΩe-ik¯zΨ12(z,k)(ν1+iν2)dS(z)S21(k)=-i2πΩeik¯z¯Ψ21(z,k)(ν1-iν2)dS(z).
  4. Solve the ∂̄k equation (66) for the matrix M(z, k)
    ¯kM(z,k)=M(z,k¯)(e(z,k¯)00e(z,-k))Sγ(k).
  5. Reconstruct Qγ from Theorem 2.9 and use (77) to compute γ.

3 Numerical Implementation

In this section, we describe the implementation of the algorithm. Greater detail of the numerical methods and validations of the computations for admittivity distributions with twice differentiable real and imaginary parts can be found in [26], where the solution to the forward problem (11) is computed and used to validate formulas (58) an (59), as well as computations of the scattering transform. In this work, we consider examples with discontinuities at the organ boundaries.

3.1 Computation of the DN map

An approximation to the DN map was computed by simulating voltage data by the finite element method (FEM), and then computing a matrix approximation to the map by computing the inner product of the applied currents with the voltages. This approximation to the DN map has been discussed, for example, in [28, 18, 40]. It can be formed analogously in the complex case.

Gaussian white noise was added independently to the real and imaginary parts of the simulated voltages for each current pattern by adding a random vector of amplitude η > 0 multiplied by the maximum voltage value for that current pattern and real or imaginary component to the computed voltages. We consider noise levels η = 0 and η = 0.0001, which corresponds to 0.01% noise, the published level of the ACT 3 system [19], which applies the trigonometric current patterns used in the simulations here.

3.2 Computation of the CGO solutions and Sγ(k)

The CGO solutions on the boundary of Ω were computed for each k in a grid [−K, K]2 in the complex plane. The choice of K, which serves as a cut-off frequency, was determined by the behavior of the scattering transforms S12 and S21. As in [40] for the D-bar algorithm for conductivity reconstructions, the cutoff frequency K has a regularizing effect, and was chosen here empirically to balance smoothing and numerical error. We do not address the selection of K by more sophisticated means in this work.

3.2.1 Computation of u1 and u2

A boundary integral equation of the form (45) was solved in [18] and [40]. In this work, as in [18], we employ an approximation to the Faddeev’s Green’s function Gk that allows for very rapid computation of u1 and u2 from (45) and (50) respectively. Namely, Gk is approximated by the fundamental solution for the Laplacian

G0(z)=12πlogz.

Denoting the solutions to (45), (50) by u10 and u20, respectively, the convolution integrals

u10(z,k)Ω=eikzik|Ω-ΩG0(z-ζ)(Λγ-γ1)u12(ζ,k)dS(ζ)u20(z,k)Ω=e-ikz¯-ik|Ω-ΩG0(-z¯+ζ¯)(Λγ-γ1)u20(ζ,k)dS(ζ)

were computed for z = z, the center of the ℓth electrode, via Simpson’s rule, and G0 was set to 0 when ζ = z. Note that by the definition of G0, G0(zζ) = G0(− + ζ̄).

3.2.2 Computation of Ψ12 and Ψ21

The boundary integral formulas (58) and (59) for Ψ12 and Ψ21, respectively, require knowledge of [Λγ − Λ1] uj(ζ, k) for j = 1, 2, with ζΩ, and k ∈ ℂ\{0}. These values are already computed during the evaluation of u1 and u2 via (45) and (50). Therefore, we merely recall those values and approximate the boundary integral using a finite sum. One should note that G0(zζ), ∂̄z Gk(zζ), and z Gk(− + ζ̄) are all undefined for z = ζ. We removed these points in the computation by setting their values to zero.

3.2.3 Computation of the scattering transform

The off-diagonal entries of the scattering transform matrix, namely S12(k) and S21(k), were computed inside the square [−K, K]2 (with k = 0 not included since the formulas for the CGO solutions do not hold for k = 0). We compute S12(k) and S21(k) using a finite sum approximation to (56) and (57):

S12(k)iL=1Le-ik¯zΨ12(z,k)zS21(k)-iL=1Le-ik¯z¯Ψ21(z,k)z¯,

where zl denotes the coordinate of the ℓth equally spaced electrode around Ω (in this case the unit circle).

3.3 Solution of the system of D-bar equations

The two systems of ∂̄k equations (68) and (69) can be written as the convolutions

{1=M11(z,k)-1πk(M12(z,k¯)e(z,-k)S21(k))0=M12(z,k)-1πk(M11(z,k¯)e(z,k¯)S12(k)), (78)

and

{1=M22(z,k)-1πk(M21(z,k¯)e(z,k¯)S21(k))0=M12(z,k)-1πk(M22(z,k¯)e(z,-k)S21(k)). (79)

A numerical solver for equations of the form

¯kv(k)=T(k)v(k)¯.

was developed in [36] for the inverse conductivity problem. The solver is based on the fast method by Vainikko [37] that uses FFT’s for solving integral equations with weakly singular kernels.

In this work, we must solve the systems of equations (78) and (79) rather than a single equation. Furthermore, the unknowns M(z, k) are not conjugated, but instead the argument k is conjugated. To address this, we interpolated the scattering data Sγ, computed above in Section 3.2.3, to a new k-grid that includes the origin k = 0 at the center and has an odd number of grid points in both the horizonal and vertical directions. We solve the systems (78) and (79) on this new k-grid using appropriate flip operations to ensure that we access the correct entries in the matrix corresponding to M(z, ).

To perform the convolution we used Fourier transforms as follows:

1πk(M12(z,k¯)e(z,-k)S21(k))=hκ2IFFT(FFT(1πk)·FFT(M12(z,k¯)e(z,-k)S21(k))),

and similarly

1πk(M11(z,k¯)e(z,k¯)S12(k))=hκ2IFFT(FFT(1πk)·FFT(M11(z,k¯)e(z,k¯)S12(k))),

where hk is the step size of the uniform k-grid of size 129 × 129, and · denotes componentwise multiplication. We used GMRES to solve the resulting linear systems for each value of z in a grid of 128 equally spaced points between [−1.1,1.1] in both the x and y directions and computed M(z, k) for all |z| ≤ 1.1. The step size in z was hz ≈ 0.0173.

3.4 Computation of the admittivity

The admittivity is computed by solving first for Q21 from (72) (note that equivalently one could use Q12 from (71)), and then solving (77) for log(γ) in the Fourier domain using FFT’s. The functions M+ and M in equations (73) and (74) were evaluated using the entries of M(z, 0) recovered when solving the ∂̄k equation (see Section 3.3 above). We used centered finite differences (with a step size of hz ≈ 0.0173) to evaluate the ∂̄z and z derivatives of M+ and M respectively. We then performed componentwise division to compute Q12 and Q21 for |z| ≤ 1.1. Finally, the computed log(γ) was exponentiated to recover γ inside the unit disk.

4 Numerical Results

We consider several test problems simulating a simplified cross-section of a human torso. In each example, the admittivity is given by γ = σ + . That is, the imaginary component includes the temporal angular frequency ω. Since this is a known value, there is no loss of generality in representing γ this way in the simulations. The complete electrode model (CEM), originally described in [14], was implemented in the FEM in order to solve the forward problem. The CEM takes into account both the shunting effect of the electrodes and the contact impedances between the electrodes and tissue. In our computations, Ω was chosen to be a disk of radius 0.15m, and the FEM computations were performed on a mesh with 4538 triangular elements and 32 equispaced electrodes 0.029m × 0.024m placed on the boundary. The effective contact impedance was chosen to be z = 0.0057Ωm2 on all electrodes in our simulations. The current amplitude was chosen to be C = 2mA, and the applied current patterns are the trigonometric patterns

Ij={Ccos(jθ),1L,1jL2Csin((L2-j)θ),1L,L2+1jL-1, (80)

where θ=2πL, |e| is the area of the ℓth electrode, I is the current on the ℓth electrode, and L denotes the total number of electrodes. As in [28, 18], the currents were normalized to have ℓ2-norm of 1, and the voltages were normalized accordingly. Also, the DN map was scaled to represent data collected on the unit disk using the relation Λγ,1 = rΛγ,r, where the second subscript represents the radius of the disk.

Where indicated, we added 0.01% Gaussian relative noise to the simulated voltages as follows. Denote the (complex-valued) vector of computed voltage for the j-th current pattern by Vj, let η = 0.0001 denote the noise level, and N a Gaussian random vector (generated by the randn commmand in MATLAB) that is unique for each use of the notation N. Denoting the noisy data by j we then have j = Re(j) + i Im(j) where

Re(Vj)=Re(Vj)+ηmaxRe(Vj)NIm(Vj)=Im(Vj)+ηmaxIm(Vj)N.

We solve the boundary integral equations (45) and (50) for the traces of the CGO solutions u1 and u2 for k ∈ [−K, K]2, with K varying for each test problem in this work. The solution M(z, k), to the ∂̄k equation (66), is computed in parallel by the method described in Section 3.3. The low-pass filtering by taking k ∈ [−K, K]2 results in smooth functions Mjp, j, p = 1, 2, which are differentiated by centered finite differences to recover Q21, as described in Section 3.4. The admittivity γ was then computed by (77).

Define the dynamic range of the conductivity, and likewise the permittivity, by

maxσ(K)-minσ(K)maxσ-minσ·100%, (81)

where the maximum and minimum values are taken on the computational grid for the reconstruction and σ(K) denotes the reconstructed conductivity σ that was computed using a scattering transform computed on the truncated k grid.

4.1 Example 1

The first test problem is an idealized cross-section of a chest with a background admittivity of 1+0i. We do not include units or frequency in these examples, since our purpose is to demonstrate that the equations in this paper lead to a feasible reconstruction algorithm for complex admittivities. Reconstructions from more realistic admittivity distributions or experimental data are the topic of future work. Figure 1 shows the values of the admittivity in the simulated heart and lungs. Noise-free reconstructions with the scattering transform computed on a 128×128 grid for k ∈ [−5.5, 5.5]2 are found in Figure 2. The reconstruction has a maximum conductivity and permittivity value of 1.1452 + 0.1802i, occurring in the heart region and a minimum of 0.8286 − 0.0247i, occurring in the lung region, resulting in a dynamic range of 79% for the conductivity and 60% for the permittivity when the negative permittivity value is set to 0. Although this decreases the dynamic range, we set the permittivity to 0 when it takes on a negative value in any pixel, since physically the permittivity cannot be less than 0. The reconstruction has the attributes of good spatial resolution and good uniformity in the reconstruction of the background and its value.

Figure 1.

Figure 1

The test problem in Example 1.

Figure 2.

Figure 2

Reconstruction from noise-free data for Example 1 with the real part of γ (conductivity) on the left, and the imaginary part (permittivity) on the right. The cut-off frequency was K = 5.5. The dynamic range is 79% for the conductivity, and 60% for the permittivity.

4.2 Example 2

This second example was chosen with conductivity values the same as in Example 1, but with permittivity values in which the “lungs” match the permittivity of the background. This is motivated by the fact that at some frequencies, physiological features may match that of the surrounding tissue in the conductivity or permittivity component. This example, purely for illustration, mimics that phenomenon. The admittivity values can be found in Figure 3. Noise-free reconstructions with the scattering transform computed on a 128 × 128 grid for k ∈ [−5.5, 5.5]2 are found in Figure 4. The maximum value of the conductivity and permittivity occur in the heart region, 1.1429 + 0.1828i, and the minimum value of the conductivity and permittivity is 0.8271 − 0.0204i. In this example, the dynamic range is 79% for the conductivity and 61% for the permittivity when the negative permittivity value is set to 0. Again the spatial resolution is quite good, and the background is quite homogeneous, although some small artifacts are present in both the real and imaginary parts.

Figure 3.

Figure 3

The test problem in Example 2. Notice that in this case, the permittivity of the lungs matches the permittivity of the background, and so only the heart should be visible in the imaginary component of the reconstruction.

Figure 4.

Figure 4

Reconstruction from noise-free data for Example 2 with the real part of γ (conductivity) on the left, and the imaginary part (permittivity) on the right. The cut-off frequency was K = 5.5. The dynamic range is 79% for the conductivity, and 61% for the permittivity.

4.3 Example 3

Example 3 is an admittivity distribution of slightly higher contrast, and a non-unitary background admittivity of γ0 = 0.8 + 0.3i. See Figure 5 for a plot of the phantom with admittivity values for the regions. Due to the non-unitary background, the problem was scaled, as was done, for example, in [18, 28], by defining a scaled admittivity γ̃ = γ/γ0 to have a unitary value in the neighborhood of the boundary and scaling the DN map by defining Λγ̃ = γ0Λγ, solving the scaled problem, and rescaling the reconstructed admittivity. The scattering data for the noise-free reconstruction was computed on a 128 × 128 grid for k ∈ [−5.2, 5.2]. Noisy data was computed as described above in the beginning of this section, and the scattering data was also computed on a 128 × 128 grid for |k| ≤ 5.5. The reconstructions are found in Figure 6. The maximum and minimum values are given in Table 1. In this example, for the noise-free reconstruction, the dynamic range is 71% for the conductivity and 75% for the permittivity. Again the spatial resolution is quite good. There is some degradation in the image and the reconstructed values in the presence of noise. We chose this noise level to be comparable to that of the 32 electrode ACT3 system at RPI [15]. A thorough study of the effects of noise and stability of the algorithm with respect to perturbations in the data is beyond the scope of this paper. The scattering transform began to blow up for noisy data, requiring a truncation of the admissible scattering data to a circle of radius 5.5, resulting in a dynamic range of 62% for the conductivity and 68% for the permittivity. A thorough study of the effects of the choice of K and its method of selection is not included in this paper.

Figure 5.

Figure 5

The test problem in Example 3. In this case, the background admittivity is 0.8 + 0.3i, rather than 1 + 0i as in Examples 1 and 2.

Figure 6.

Figure 6

Top row: Reconstruction from noise-free data for Example 3. The cut-off frequency was K = 5.2. The dynamic range is 71% for the conductivity, and 75% for the permittivity. Bottom row: Reconstruction from data with 0.01% added noise. The cut-off frequency was |k| ≤ 5.5. The dynamic range is 62% for the conductivity, and 68% for the permittivity.

Table 1.

Maximum and minimum values in Example 3 with the non-unitary background were found in the appropriate organ region. The table indicates these values of the admittivity in the appropriate region.

Admitivity of test problem Reconstruction from noise-free data Reconstruction from noisy data

heart 1.2 + 0.6 i 1.0246 + 0.5014 i (max) 0.9740 + 0.4679 i (max)
lungs 0.5 + 0.1i 0.5262 + 0.1258 i (min) 0.5390 + 0.1281 i (min)

5 Conclusions

A new direct method is presented for the reconstruction of a complex conductivity. This method has the attributes of being fully nonlinear, parallelizable, and the direct reconstruction does not require a high frequency limit. It was demonstrated on numerically simulated data representing a cross-section of a human chest with discontinuous organ boundaries that the method yields reconstructions with good spatial resolution and dynamic range on noise-free and noisy data. This was the first implementation of such a method, and although efforts were made to realistically simulate experimental data by including discontinuous organ boundaries, data on a finite number of electrodes, and simulated contact impedance, actual experimental data will surely prove more challenging. While this study with simulated data gives very promising results, more advanced studies of stability and robustness may be necessary to deal with the more difficult problem of reconstructions from experimental data.

Acknowledgments

The project described was supported by Award Number R21EB009508 from the National Institute Of Biomedical Imaging And Bioengineering. The content is solely the responsibility of the authors and does not necessarily represent the official view of the National Institute Of Biomedical Imaging And Bioengineering or the National Institutes of Health. C.N.L. Herrera was supported by FAPESP under the process number 2008/08739 - 7.

References

  • 1.Astala K, Päivärinta L. Calderón’s inverse conductivity problem in the plane. Ann of Math. 2006;163:265–299. [Google Scholar]
  • 2.Astala K, Lassas M, Päivärinta L. Calderón’s inverse problem for anisotropic conductivity in the plane. Comm Partial Differential Equations. 2005;30:207–224. [Google Scholar]
  • 3.Astala K, Mueller JL, Päivärinta L, Siltanen S. Numerical computation of complex geometrical optics solutions to the conductivity equation. Applied and Computational Harmonic Analysis. 2010;29:2–17. [Google Scholar]
  • 4.Astala K, Mueller JL, Päivärinta L, Perämäki A, Siltanen S. Direct electrical impedance tomography for nonsmooth conductivities. Inverse Problems and Imaging. 2011;5:531–550. [Google Scholar]
  • 5.Barceló JA, Barceló T, Ruiz A. Stability of the Inverse Conductivity Problem in the Plane for Less Regular Conductivities. J Differential Equations. 2001;173:231–270. [Google Scholar]
  • 6.Bikowski J, Mueller JL. 2D EIT reconstructions using Calderón’s method. Inverse Problems and Imaging. 2008;2:43–61. [Google Scholar]
  • 7.Borcea L. Electrical impedance tomography. Inverse Problems. 2002;18:99–136. [Google Scholar]
  • 8.Boverman G, Kao T-J, Kulkarni R, Kim BS, Isaacson D, Saulnier GJ, Newell JC. Robust linearized image reconstruction for multifrequency EIT of the breast. IEEE Trans Biomed Eng. 2008;27:1439–1448. doi: 10.1109/TMI.2008.922187. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 9.Brown BH, Barber DC, Morice AH, Leathard A, Sinton A. Cardiac and respiratory related electrical impedance changes in the human thorax. IEEE Trans Biomed Eng. 1994;41:729–734. doi: 10.1109/10.310088. [DOI] [PubMed] [Google Scholar]
  • 10.Brown RM, Uhlmann G. Uniqueness in the inverse conductivity problem for nonsmooth conductivities in two dimensions. Comm Partial Differential Equations. 1997;22:1009–1027. [Google Scholar]
  • 11.Bukhgeim AL. Recovering a potential from cauchy data in the two-dimensional case. Inverse Problems. 2007;15:1–15. [Google Scholar]
  • 12.Calderón AP. On an inverse boundary value problem. In Seminar on Numerical Analysis and its Applications to Continuum Physics. Soc Brasileira de Matemàtica. 1980:65–73. [Google Scholar]
  • 13.Cheney M, Isaacson D, Newell JC. Electrical Impedance Tomography. SIAM Review. 1999;41:85–101. [Google Scholar]
  • 14.Cheng K-S, Isaacson D, Newell JC, Gisser DG. Electrode models for electric current computed tomography. IEEE Trans on Bio Eng. 1989;36(9):918–924. doi: 10.1109/10.35300. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 15.Cook RD, Saulnier GJ, Goble JC. A phase sensitive voltmeter for a high-speed, high precision electrical impedance tomograph. Proc Ann Int Conf IEEE Eng in Medicine and Biology Soc. 1991:22–23. [Google Scholar]
  • 16.Costa ELV, Chaves CN, Gomes S, Gonzalez Lima R, Amato MBP. Real-time detection of pneumothorax using electrical impedance tomography. Crit Care Med. 2008;36:1230–1238. doi: 10.1097/CCM.0b013e31816a0380. [DOI] [PubMed] [Google Scholar]
  • 17.Costa ELV, Gonzalez Lima R, Amato MBP. Electrical impedance tomography. Current Opinion in Crit Care. 2009;15:18–24. doi: 10.1097/mcc.0b013e3283220e8c. [DOI] [PubMed] [Google Scholar]
  • 18.DeAngelo M, Mueller JL. D-bar reconstructions of human chest and tank data using an improved approximation to the scattering transform. Physiological Measurement. 2010;31:221–232. doi: 10.1088/0967-3334/31/2/008. [DOI] [PubMed] [Google Scholar]
  • 19.Edic PM, Isaacson D, Saulnier GJ, Jain H, Newell JC. An iterative Newton-Raphson method to solve the inverse admittivity problem. IEEE Trans Biomed Engr. 1998;45:899–908. doi: 10.1109/10.686798. [DOI] [PubMed] [Google Scholar]
  • 20.Faddeev LD. Increasing solutions of the Schrödinger equation. Sov Phys Dokl. 1966;10:1033–1035. [Google Scholar]
  • 21.Francini E. Recovering a complex coefficient in a planar domain from the Dirichlet-to-Neumann map. Inverse Problems. 2000;6:107–119. [Google Scholar]
  • 22.Frerichs I, Hinz J, Herrmann P, Weisser G, Hahn G, Dudykevych T, Quintel M, Hellige G. Detection of local lung air content by electrical impedance tomography compared with electron beam CT. J Appl Physiol. 2002;93(2):660–6. doi: 10.1152/japplphysiol.00081.2002. [DOI] [PubMed] [Google Scholar]
  • 23.Frerichs I, Hinz J, Herrmann P, Weisser G, Hahn G, Quintel M, Hellige G. Regional lung perfusion as determined by electrical impedance tomography in comparison with electron beam CT imaging. IEEE Trans Med Imaging. 2002;21:646–652. doi: 10.1109/TMI.2002.800585. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 24.Frerichs I, Schmitz G, Pulletz S, Schädler D, Zick G, Scholz J, Weiler N. Reproducibility of regional lung ventilation distribution determined by electrical impedance tomography during mechanical ventilation. Physiol Meas. 2007;28:261–267. doi: 10.1088/0967-3334/28/7/S19. [DOI] [PubMed] [Google Scholar]
  • 25.Fuks LF, Cheney M, Isaacson D, Gisser DG, Newell JC. Detection and Imaging of Electric conductivity and permittivity at low frequency. IEEE Trans Biomed Engr. 1991;38:1106–1110. doi: 10.1109/10.99074. [DOI] [PubMed] [Google Scholar]
  • 26.Hamilton SJ. PhD thesis. Colorado State University; 2012. A Direct D-bar Reconstruction Algorithm for Complex Admittivities in W2,∞(Ω) for the 2-D EIT Problem. [Google Scholar]
  • 27.Mueller JL, Siltanen S, Isaacson D. A Direct Reconstruction Algorithm for Electrical Impedance Tomography. IEEE Trans Med Im. 2003;21:555–559. doi: 10.1109/TMI.2002.800574. [DOI] [PubMed] [Google Scholar]
  • 28.Isaacson D, Mueller JL, Newell JC, Siltanen S. Reconstructions of chest phantoms by the D-bar method for electrical impedance tomography. IEEE Trans Med Im. 2004;23:821–828. doi: 10.1109/TMI.2004.827482. [DOI] [PubMed] [Google Scholar]
  • 29.Isaacson D, Mueller JL, Newell JC, Siltanen S. Imaging cardiac activity by the D-bar method for electrical impedance tomography. Physiol Meas. 2006;27:S43–S50. doi: 10.1088/0967-3334/27/5/S04. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 30.Jain H, Isaacson D, Edic PM, Newell JC. Electrical impedance tomography of complex conductivity distributions with noncircular boundary. IEEE Trans Biomed Engr. 1997;44:1051–1060. doi: 10.1109/10.641332. [DOI] [PubMed] [Google Scholar]
  • 31.Kao T-J, Boverman G, Kim BS, Isaacson D, Saulnier GJ, Newell JC, Choi MH, Moore RH, Kopans DB. Regional admittivity spectra with tomosynthesis images for breast cancer detection: preliminary patient study. IEEE Trans Med Im. 2008;27:1762–1768. doi: 10.1109/TMI.2008.926049. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 32.Kerner TE, Paulsen KD, Hartov A, Soho SK, Poplack SP. Electrical Impedance Spectroscopy of the Breast: Clinical Imaging Results in 26 Subjects. IEEE Trans Med Im. 2002;21:638–645. doi: 10.1109/tmi.2002.800606. [DOI] [PubMed] [Google Scholar]
  • 33.Knudsen K. PhD thesis. Department of Mathematical Sciences, Aalborg University; Denmark: 2002. On the Inverse Conductivity Problem. [Google Scholar]
  • 34.Knudsen K. A new direct method for reconstructing isotropic conductivities in the plane. Physiol Meas. 2003;24:391–401. doi: 10.1088/0967-3334/24/2/351. [DOI] [PubMed] [Google Scholar]
  • 35.Knudsen K, Tamasan A. Reconstruction of less regular conductivities in the plane. Comm Partial Differential Equations. 2004;29:361–381. [Google Scholar]
  • 36.Knudsen K, Mueller JL, Siltanen S. Numerical solution method for the dbar-equation in the plane. J Comp Phys. 2004;198:500–517. [Google Scholar]
  • 37.Vainikko G. In Direct and inverse problems of mathematical physics (Newark, DE, 1997), volume 5 of Int Soc Anal Appl Comput. Kluwer Acad. Publ; Dordrecht: 2000. Fast solvers of the Lippmann-Schwinger equation; pp. 423–440. [Google Scholar]
  • 38.Knudsen K, Lassas M, Mueller JL, Siltanen S. Reconstructions of piecewise constant conductivities by the D-bar method for electrical impedance tomography, Proceedings of the 4th AIP International Conference and the 1st Congress of the IPIA, Vancouver. Journal of Physics: Conference Series. 2008;124 [Google Scholar]
  • 39.Knudsen K, Lassas M, Mueller JL, Siltanen S. D-bar method for electrical impedance tomography with discontinuous conductivities. SIAM J Appl Math. 2007;67:893–913. [Google Scholar]
  • 40.Knudsen K, Lassas M, Mueller JL, Siltanen S. Regularized D-bar method for the inverse conductivity problem. Inverse Problems and Imaging. 2009;3:599–624. [Google Scholar]
  • 41.Mueller JL, Siltanen S. Direct reconstructions of conductivities from boundary measurements. SIAM J Sci Comp. 2003;24:1232–1266. [Google Scholar]
  • 42.Murphy E, Mueller JL, Newell JC. Reconstruction of conductive and insulating targets using the D-bar method on an elliptical domain. Physiol Meas. 2007;28:S101–S114. doi: 10.1088/0967-3334/28/7/S08. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 43.Nachman AI. Reconstructions from boundary measurements. Annals of Mathematics. 1988;128:531–576. [Google Scholar]
  • 44.Nachman AI. Global uniqueness for a two-dimensional inverse boundary value problem. Ann of Math. 1996;143:71–96. [Google Scholar]
  • 45.Nachman AI. University of Rochester, Dept of Mathematics Preprint Series, No. 19. 1993. Global uniqueness for a two-dimensional inverse boundary value problem. [Google Scholar]
  • 46.Siltanen S, Mueller J, Isaacson D. An implementation of the reconstruction algorithm of A. Nachman for the 2-D inverse conductivity problem. Inverse Problems. 2000;16:681–699. [Google Scholar]
  • 47.Siltanen S. PhD Thesis. Helsinki University of Technology; Espoo, Finland: 1999. Electrical Impedance Tomography and Faddeev Green’s Functions. [Google Scholar]
  • 48.Smit H, Vonk Noordegraaf A, Marcus JT, Boonstra A, de Vries PM, Postmus PE. Determinants of pulmonary perfusion measured by electrical impedance tomography. Eur J Appl Physiol. 2004;92:45–49. doi: 10.1007/s00421-004-1043-3. [DOI] [PubMed] [Google Scholar]
  • 49.Sylvester J, Uhlmann G. A global uniqueness theorem for an inverse boundary value problem. Annals of Mathematics. 1987;125:153–169. [Google Scholar]
  • 50.Tidswell AT, Gibson A, Bayford RH, Holder DS. Three-dimensional electrical impedance tomography of human brain activity. NeuroImage. 2001;13:283–294. doi: 10.1006/nimg.2000.0698. [DOI] [PubMed] [Google Scholar]
  • 51.Tidswell AT, Gibson A, Bayford RH, Holder DS. Validation of a 3D reconstruction algorithm for EIT of human brain function in a realistic head-shaped tank. Physiological Meas. 2001;22:177–185. doi: 10.1088/0967-3334/22/1/321. [DOI] [PubMed] [Google Scholar]
  • 52.Victorino JA, Borges JB, Okamoto VN, Matos GFJ, Tucci MR, Caramez MPR, Tanaka H, Santos DCB, Barbas CSV, Carvalho CRR, Amato MBP. Imbalances in Regional Lung ventilation: a validation study on electrical impedance tomography. Am J Respir Crit Care Med. 2004;169:791–800. doi: 10.1164/rccm.200301-133OC. [DOI] [PubMed] [Google Scholar]
  • 53.Von Herrmann A. PhD thesis. Colorado State University; 2009. Properties of the reconstruction algorithm and associated scattering transform for admittivity γ ∈ W1,p(Ω) in the plane. [Google Scholar]

RESOURCES