211
Views
17
CrossRef citations to date
0
Altmetric
Articles

Inversion of weighted Radon transforms via finite Fourier series weight approximations

&
Pages 787-802 | Received 01 Apr 2013, Accepted 03 Jul 2013, Published online: 02 Aug 2013

Abstract

We consider weighted Radon transforms on the plane. We show that the Chang approximate inversion formula for these transforms admits a significant extension as inversion via finite Fourier series weight approximations. We illustrate this inversion approach by numerical examples for the case of the attenuated Radon transforms in the framework of the single-photon emission computed tomography (SPECT).

Introduction

The basic problem of many tomographies consists of finding an unknown function f on R2 from its weighted ray transform PWf on R×S1 for some known weight W, where(1.1) PWf(s,θ)=RW(sθ+tθ,θ)f(sθ+tθ)dt,sR,θ=(θ1,θ2)S1,θ=(θ2,θ1),(1.1) where f=f(x), W=W(x,θ), xR2. Up to change of variables, the operator PW is known also in literature as the weighted Radon transform on the plane. In this work we always assume that(1.2) WC(R2×S1)L(R2×S1),w0(x)def=12πS1W(x,θ)dθ0,xR2,(1.2) where W is complex valued, in general, and dθ is the standard element of arc length on S1. Additional assumptions on W will be formulated in the framework of context. In particular, in important cases, W is real valued and strictly positive:(1.3) W=W¯,Wc>0.(1.3) In addition, for this work one can always assume that(1.4) fL(R2),suppfD,(1.4) where f is complex valued, in general, and D is an open bounded domain (which is fixed a priori).

In definition (1.1), the product R×S1 is interpreted as the set of all oriented straight lines in R2. If γ=(s,θ)R×S1, then γ={xR2:x=sθ+tθ,tR} (modulo orientation) and θ gives the orientation of γ.

If W1, then PW is reduced to classical ray (or Radon) transform on the plane. If(1.5) W(x,θ)=exp(0+a(x+tθ)dt),(1.5) where a is a complex-valued sufficiently regular function on R2 with sufficient decay at infinity, then PW is known in literature as the attenuated ray (or Radon) transform on the plane.

The classical ray transform arises, in particular, in X-ray transmission tomography, see e.g. [Citation1]. The attenuated ray transform (at least, with real-valued a0) arises, in particular, in SPECT, see e.g. [Citation1, Citation2]. Transforms PW with some other weights also arise in applications, see e.g. [Citation2Citation5].

Exact and simultaneously explicit inversion formulas for the classical and attenuated ray (or Radon) transforms on the plane were given for the first time in [Citation6] and [Citation7], respectively. For some other weights W, exact and simultaneously explicit inversion formulas were given in [Citation8Citation11]. Note that, we say that an inversion method for PW is an explicit inversion formula if its complexity is comparable with complexity of the aforementioned Radon inversion formula of [Citation6]. In this sense, the analytic inversion method for the attenuated ray transform proposed before [Citation7] in [Citation12] is not an explicit inversion formula: the inversion of [Citation12] is not better than an infinite series, where each term is not simpler than the classical Radon inversion formula.

Apparently, for general PW, under assumptions (1.2), (1.3), explicit and simultaneously exact (modulo KerPW) inversion formulas are impossible. In addition, [Citation13] gives an example of infinitely smooth W satisfying (1.2), (1.3) and such that KerPW0 in the space of infinitely smooth compactly supported functions on R2. But, due to [Citation14], KerPW=0 in the space of continuous compactly supported functions on R2 for real analytic W satisfying (1.3).

On the other hand, the following Chang approximate (but explicit) inversion formula for PW, where W is given by (1.5) with a0, has been used for a long time (see e.g. [Citation2, Citation11, Citation15]):(1.6) fappr=(w0)1P1PWf,(1.6) where w0 is defined in (1.2), P1 denotes the classical Radon inversion realized via the formula given below:(1.7) P1q(x)=14πS1θx(1πp.v.Rq(t,θ)xθtdt)dθ,xR2,θx=θ2/x1+θ1/x2,xθ=θ2x1+θ1x2,θ=(θ1,θ2),x=(x1,x2),(1.7) where q is a test function on R×S1. It is known that formula (1.6) is efficient for the first approximation in SPECT reconstructions and, in particular, is sufficiently stable for reconstruction from discrete data with strong Poisson noise. The exact inversion formula of [Citation7] for the attenuated ray transform is considerably less stable in this respect. For more information in this connection see [Citation16].

Formula (1.6), under assumptions (1.2), can be considered as approximate inversion of PW via the approximation(1.8) W(x,θ)w0(x),xR2,θS1,(1.8) i.e. via the zero term Fourier approximation for W in angle variable. In addition, due to [Citation6], formula (1.6) is exact if(1.9) W(x,θ)w0(x),xR2,θS1.(1.9) Besides, due to [Citation11], formula (1.6) is exact if and only if(1.10) W(x,θ)w0(x)w0(x)W(x,θ),xR2,θS1.(1.10) However, already for W of (1.5) property (1.10) is not fulfilled, in general.

In the present work, we consider approximate inversion of PW via the approximations(1.11) W(x,θ(φ))n=NNeinφwn(x),wn(x)=12πππeinφW(x,θ(φ))dφ,xR2,θ(φ)=(cosφ,sinφ),φ[π,π],NN0.(1.11) One can see that for N=0 approximation (1.11) is reduced to (1.8).

Our approximate inversion algorithms for PW on functions of (1.4), under general assumptions (1.2), are presented in Subsection 2.4 of Section 2 , see approximate inversions (2.20), (2.22). In particular, one can consider that N=2m+1, where N is the approximation number of (1.11) and m is the maximal number of (2.22). In these considerations, we proceed from [Citation2] and [Citation17].

In Section 3, our approximate inversions (2.20), (2.22) of Subsection 2.4 are illustrated by numerical examples for specific W given by (1.5) with a0 in the framework of SPECT.

Finally, note that the ‘philosophy’ of our approach to approximate inversion of PW via the approximations (1.11) is actually similar to the ‘philosophy’ described in [Citation18, Citation19] for the case of coefficient inverse problems. More precisely: we replace the exact model by its approximations (via (1.11) in our case) and for the approximate model, we solve the problem by iterations with good properties (via (2.22) in our case). Next, we show that such a solution is good enough for the initial non-approximative model (see Subsection 3.5).

Approximate inversion of PW

Symmetrization of W

Let(2.1) AWf=P1PWf,(2.1) where P1 is defined by (1.7). Let(2.2) Wsym(x,θ)=12(W(x,θ)+W(x,θ)),xR2,θS1.(2.2) We consider also the Fourier series(2.3) W(x,θ(φ))=n=+einφwn(x),xR2,φ[π,π],(2.3) where wn is defined in (1.11), θ(φ)=(cosφ,sinφ).

The following formulas hold (see [Citation2, Citation11]):(2.4) 12(PWf(s,θ)+PWf(s,θ))=PWsymf(s,θ),(s,θ)R×S1,(2.4) (2.5) AWf=P1PWsymf,(2.5) (2.6) Wsym(x,θ(φ))=l=+ei2lφw2l(x),xR2,φ[π,π].(2.6) Actually, using (2.4)–(2.6) we reduce inversion of PW to inversion of PWsym. In particular, using (2.1), (2.5), (2.6), one can see that such reduction arises already in the framework of (1.6).

Operators QW,D,m and numbers σW,D,m

Consider(2.7) z=x1+ix2,z¯=x1ix2,x=(x1,x2)R2.(2.7) Using (2.7), we identify R2 with C.

Let Π, Π¯ denote the linear integral operators on R2 identified with C such that(2.8) Πu(z)=1πCu(ζ)(ζz)2dReζdImζ,Π¯u(z)=1πCu(ζ)(ζ¯z¯)2dReζdImζ,(2.8) where u is a test function, zC; see e.g. [Citation20] for detailed properties of these operators.

Let D be the domain of (1.4).

Let χD denote the characteristic function of D, i.e.(2.9) χD1onD,χD0onR2D.(2.9) Let(2.10) QW,D,m=l=1m((Π¯)lw2lw0+(Π)lw2lw0)χDformN,QW,D,m=0form=0,(2.10) where w0, w2l are the Fourier coefficients of (2.3), (2.6) and w±2l/w0, χD are considered as the multiplication operators of R2.

Let(2.11) σW,D,m=l=1m(supxD|w2l(x)w0(x)|+supxD|w2l(x)w0(x)|)formN,σW,D,m=0form=0.(2.11) According to [Citation17] we have that(2.12) QW,D,mL2(R2)L2(R2)σW,D,m.(2.12)  

Exact inversion for finite Fourier series weights

Let conditions (1.2), (1.4) be fulfilled and(2.13) W(x,θ(φ))=n=NNeinφwn(x),xR2,θ(φ)=(cosφ,sinφ),φ[π,π],NN0.(2.13) Suppose also that(2.14) σW,D,m<1form=[N/2],(2.14) where [N/2] denotes the integer part of N/2. Then according to [Citation17], we have the following exact inversion for PW:(2.15) f=(w0)1(I+QW,D,m)1P1PWf,(2.15) where I is the identity operator on R2, P1 is defined by (1.7). In addition, in view of (2.12), (2.14) we have that(2.16) (I+QW,D,m)1=I+j=1+(QW,D,m)j.(2.16) In addition, under our assumptions, we have that (see [Citation17]):(2.17) AWf=P1PWfL2(R2).(2.17)  

Approximate inversion for general weights

Let conditions (1.2), (1.4) be fulfilled and(2.18) l=1(w2lw0L2(D)+w2lw0L2(D))<+,(2.18) where wn are defined by (2.11). Suppose that(2.19) σW,D,mσmax<1forfixedmN0.(2.19) Then we consider that(2.20) ffm,fm=(w0)1(I+QW,D,m)1P1PWf,(2.20) where I is the identity operator, QW,D,m is defined by (2.10), P1 is defined by (1.7). Note that the right-hand side of (2.20b) is well-defined: in particular, in view of (2.12), (2.19) we have formula (2.16) in norm ·L2(R2)L2(R2) and using (2.18) one can show that(2.21) P1PWfL2(R2).(2.21) Formula (2.20) is a natural extension of the Chang formula (1.6). In particular, (2.20) for m=0 coincides with (1.6).

In addition, if (2.19) is fulfilled for some m1, then fm is a refinement of the Chang approximation f0 and, more generally, fj is a refinement of fi for 0i<jm. But of course fj=fi if w2l0, w2l0 for i<lj.

Actually, in many important examples condition (2.19) is efficiently fulfilled for small m (e.g. m=2) and is not fulfilled for large m. Therefore, in the present work, under conditions (1.2)-(1.4), we propose the following approximate reconstruction of f from PWf:(2.22) findmaximalmsuchthat(2.19)isstillfulfilledandapproximatelyreconstructfvia(2.20)using(2.12),(2.16).(2.22) In Section 3, we illustrate this approximate reconstruction by numerical examples in the framework of SPECT with σmax=0.7. In particular, these numerical examples show that stability properties of this approximate reconstruction fm are similar to stability properties of the Chang approximate reconstruction f0 but fm is more precise than f0 if m>0.

Note also that using considerations presented below in Subsection 2.5 and considerations presented at the end of Section 5 of [Citation2], algorithm (2.22) can be designed on the basis of the 2D FFT.

Using considerations of Subsection 2.3, one can see also that(2.23) f=fm(w0)1(I+QW,D,m)1P1PδWmf,(2.23) where(2.24) δWm(x,θ(φ))def=W(x,θ(φ))n=2m12m+1einφwn(x),xR2,θ(φ)=(cosφ,sinφ),φ[π,π],mN0,(2.24) where wn are defined by (1.11). One can use (2.23) for estimating the error ffm. One can also consider (2.23) as an integral equation for finding f from fm. Note also that Equation (2.23) for m=0 is, actually, well known, see e.g. [Citation2].

Relations with [Citation2]

Let conditions (1.2), (1.4) be fulfilled and(2.25) limm+σW,D,m=σW,D<+.(2.25) Then, we can consider(2.26) QW,D=limm+QW,D,min·L2(R2)L2(R2).(2.26) In addition, if(2.27) σW,D<1,(2.27) then(2.28) f=(w0)1(I+QW,D)1P1PWf,(2.28) (2.29) (I+QW,D)1=I+j=1+(QW,D)j.(2.29) Actually, (2.28) is a linear integral equation for exact reconstruction of f from PWf under assumptions (1.2), (1.4), (2.18), (2.27). In addition, (2.29) can be interpreted as the method of successive approximations for solving this equation.

It is possible to show that the reconstruction of f from PWf of [Citation2] (or, more precisely, the linear integral equation on ε on page 814 of [Citation2]) can be transformed into (2.28).

In [Citation2] (under the assumption that 0<W<1), it was shown that this equation on ε of [Citation2] is uniquely solvable if(2.30) limm+ρW,D,m=ρW,D<1,ρW,D,mdef=l=1m(supxD|w2l(x)|+supxD|w2l(x)|)minxD|w0(x)|.(2.30) One can see that in many cases, σW,D,m is much smaller than ρW,D,m and our condition (2.27) is much less restrictive than (2.30) of [Citation2].

Under assumption (2.30), finite Fourier series weight approximations (1.11) are also considered at the end of Section 5 of [Citation2] in the framework of approximate but rapid inversion of weighted Radon transforms on the basis of the 2D FFT.

In addition, the most important difference between our algorithm (2.22) and the inversion algorithms of [Citation2] consists in the following: we suggest algorithm (2.22) for general weights W satisfying (1.2), (1.3), whereas the algorithms of [Citation2] are suggested under very restrictive smallness assumption (2.30) only.

Actually, in order to relate considerations of [Citation2] on one hand with considerations of [Citation17] and the present work on the other hand, we use the following formulas(2.31) F(Πlu)(ξ)=(ξ1iξ2ξ1+iξ2)lFu(ξ),F(Π¯lu)(ξ)=(ξ1+iξ2ξ1iξ2)lFu(ξ),ξ=(ξ1,ξ2)R2,lN,(2.31) (2.32) QW,D,mu(x)=P1(PW,D,mu)(x),PW,D,mu(s,θ)def=R((l=m1+l=1m)w2l(sθ+tθ)w0(sθ+tθ)(θ1+iθ2)2l)×χD(sθ+tθ)u(sθ+tθ)dt,xR2,sR,θ=(θ1,θ2)S1,mN,(2.32) where F denotes the 2D Fourier transform operator, Π, Π¯ are defined by (2.8), Qm is defined by (2.10), P1 is defined by (1.7), u is a test function.

Finally, note that in our numerical examples of Section 3 the approximate reconstruction (2.20) is realized numerically using formula (2.32).

Numerical examples

In principle, our approximate inversion algorithm (2.22) can be used under general assumptions (1.2)-(1.4). In this work we illustrate this algorithm numerically for specific but very important weights W arising in particular in SPECT.

Framework of SPECT

All numerical examples of this work are given in the framework of SPECT. In particular, we assume that W=Wa(x,θ) is given by (1.5), where a(x)0. We recall that in SPECT, after restricting the problem to a fixed 2D plane, the functions PWf, a and f are interpreted as follows:

  1. f=f(x) is the distribution of radioactive isotopes emitting photons (emitter activity);

  2. a=a(x) is the photon attenuation coefficient (attenuation map);

  3. in addition, it is assumed that suppaD, suppfD, where D is some known compact domain;

  4. PWf describes the expected radiation outside D. In addition, in some approximation, measured SPECT data p are modelled as PWf with Poisson noise on some discrete subset Γ of R×S1. That is p(γ) is modelled as a realization of a Poisson variable p(γ), where the mean Mp(γ)=PWf(γ) for each γΓ. We recall that variance Vp=Mp for a Poisson variable p and, therefore, the Poisson noise can be considered as an intermediate case between additive and multiplicative noises. Usually, it is also assumed that:

  5. DBR={xR2:|x|R}, where R is the radius of image support,

  6. Γ is a uniform n×n sampling of(3.1) TR={γR×S1:γBR0}={(s,θ)R×S1:|s|R}.(3.1)

For more information on SPECT see e.g. [Citation1, Citation21, Citation22] and references therein.

Image parameters

All 2D images of this work are considered on n×n grids (X and Γ), where n=128. We assume that X is a uniform n×n sampling of(3.2) DR={x=(x1,x2)R2:|x1|R,|x2|R}(3.2) and Γ is a uniform n×n sampling of TR, where R is the radius of the image support.

In addition, all 2D images of this work are drawn using a linear greyscale in such a way that the dark grey colour represents zero (or negative values, if any) and white corresponds to the maximum value of the imaged function.

Numerical phantoms

We consider two numerical phantoms (phantom 1 and phantom 2). Attenuation maps a, emitter activities f, noiseless emission data g=PWf and noisy emission data p for these phantoms are shown in Figures and .

Fig. 1 (a) Attenuation map a=a(x), (b) emiter activity f=f(x), (c) noiseless emission data g=PWf(γ), (d) noisy emission data p=p(γ) (30% noise) for phantom 1. (See Subsections 3.1, 3.3)

Fig. 1 (a) Attenuation map a=a(x), (b) emiter activity f=f(x), (c) noiseless emission data g=PWf(γ), (d) noisy emission data p=p(γ) (30% noise) for phantom 1. (See Subsections 3.1, 3.3)

Fig. 2 (a) Attenuation map a=a(x), (b) emiter activity f=f(x), (c) noiseless emission data g=PWf(γ), (d) noisy emission data p=p(γ) (30% noise) for phantom 2. (See Subsections 3.1, 3.3)

Fig. 2 (a) Attenuation map a=a(x), (b) emiter activity f=f(x), (c) noiseless emission data g=PWf(γ), (d) noisy emission data p=p(γ) (30% noise) for phantom 2. (See Subsections 3.1, 3.3)

Phantom 1 is a version of the elliptical chest phantom (used for the numerical simulations of cardiac SPECT imaging; see e.g. [Citation16, Citation21, Citation22]). Actually, this version is the same as in [Citation16, Citation22] and, in addition to Figure , its description includes the following information:

  1. the major axis of the ellipse representing the body is 30 cm,

  2. attenuation coefficient a is 0.04 cm1 in the lung region (modelled as two interior ellipses), 0.15 cm1 elsewhere within the body ellipse and zero outside the body,

  3. emitter activity f is in the ratio 8:0:1:0 in myocardium (represented as a ring), lungs, elsewhere within the body and outside the body,

  4. noisy emission data p contain 30% of the Poisson noise in the sense of L2-norm and the total number of photons is 125 450. Phantom 2 is a simulated numerical version of the Utah phantom (designed at the 2nd International Meeting on fully Three-Dimensional Image Reconstruction in Radiology and Nuclear Medicine, Snowbird, Utah, 1993). A real non-simulated version of this phantom was considered, in particular, in [Citation23]. However, in the present work we consider its simulated numerical version in order to see clearly different reconstruction errors. In addition to Figure , the description of phantom 2 includes the following information:

  5. geometrically the phantom consists of a large disk containing two small disks, where the radius of the large disks is 10 cm,

  6. attenuation coefficient a is 0.16 cm1 in the large disk outside the small disks, 0.63 cm1 in the left small disk, 0.31 cm1 in the right small disk, and zero outside the large disk,

  7. emitter activity f is a positive constant in the large disk outside the small disks and zero elsewhere

  8. noisy emission data p contain 30% of the Poisson noise in the sense of L2-norm and the total number of photons is 89 350.

Note also that all computations of the present work are fulfilled using the same numerical realizations of basic formulas as in [Citation16, Citation22, Citation23].

Results for the bounds σW,D,m and ρW,D,m

The bound numbers σW,D,m, ρW,D,m of (2.11), (2.30) for phantoms 1 and 2 are shown in Tables and , where D=BR.

Table 1 Numbers σW,D,m, ρW,D,m of (2.11), (2.30) for phantom 1, where D=BR.

Table 2 Numbers σW,D,m, ρW,D,m of (2.11), (2.30) for phantom 2, where D=BR.

For phantoms 1 and 2, Tables and show that condition (2.19) with σmax = 0.7 is fulfilled for m = 1 and m = 2, whereas ρW,D,m>1 already for m=1.

Table 3 Relative reconstruction errors η(fm,f,X),η(fm+,f,X) for the noiseless case for phantom 1.

 

Reconstruction results for the emitter activity f

For phantoms 1 and 2 we consider the approximate reconstructions fm realized numerically via (2.20b) (using the method of successive approximations i.e. using (2.16)) from the noiseless data g and filtered noisy data p. The method of successive approximations was always realized in the framework of 4 iterations. In addition:

  1. we consider fm, mainly, under the condition that σW,D,mσmax=0.7,

  2. we consider p=Wp for W=A8,8sym, where W=Al1,l2sym is the approximately optimal space-variant Wiener-type filter of Section 5.3 of [Citation22].

 

Table 4 Relative reconstruction errors η(fm,f,X),η(fm+,f,X) for the noiseless case for phantom 2.

In addition to fm we consider also their non-negative parts fm+, wherefm+(x)=fm(x)iffm(x)0andfm+(x)=0iffm(x)<0For phantoms 1 and 2, Tables and show that σW,D,m0.7 is fulfilled for m=0,1,2 only.

To study reconstruction errors we consider, in particular,(3.3) η(u2,u1,X)=u2u1L2(X)u1L2(X),(3.3) where u1, u2 are test functions on X.

The approximate reconstructions f0, f2 with their central horizontal profiles from the noiseless data g for phantoms 1 and 2 are shown in Figures and .

Fig. 3 Phantom 1:(a) true f, (b), (c) approximate reconstructions f0, f2 from the noiseless data g, (d), (e), (f) central horizontal profiles. (See Subsections 3.3, 3.5)

Fig. 3 Phantom 1:(a) true f, (b), (c) approximate reconstructions f0, f2 from the noiseless data g, (d), (e), (f) central horizontal profiles. (See Subsections 3.3, 3.5)

Fig. 4 Phantom 2:(a) true f, (b), (c) approximate reconstructions f0, f2 from the noiseless data g, (d), (e), (f) central horizontal profiles. (See Subsections 3.3, 3.5)

Fig. 4 Phantom 2:(a) true f, (b), (c) approximate reconstructions f0, f2 from the noiseless data g, (d), (e), (f) central horizontal profiles. (See Subsections 3.3, 3.5)

Fig. 5 Phantom 1: (a) true f, (b), (c) approximate reconstructions f0, f2 from the filtered noisy data p=A8,8symp (30% noise), (d), (e), (f) central horizontal profiles. (See Subsections 3.3, 3.5)

Fig. 5 Phantom 1: (a) true f, (b), (c) approximate reconstructions f0, f2 from the filtered noisy data p∼=A8,8symp (30% noise), (d), (e), (f) central horizontal profiles. (See Subsections 3.3, 3.5)

Fig. 6 Phantom 2: (a) true f, (b), (c) approximate reconstructions f0, f2 from the filtered noisy data p=A8,8symp (30% noise), (d), (e), (f) central horizontal profiles. (See Subsections 3.3, 3.5)

Fig. 6 Phantom 2: (a) true f, (b), (c) approximate reconstructions f0, f2 from the filtered noisy data p∼=A8,8symp (30% noise), (d), (e), (f) central horizontal profiles. (See Subsections 3.3, 3.5)

Tables and show the relative errors η(fm,f,X) and η(fm+,f,X) in L2- norm for the approximate reconstructions fm with respect to precise f for the noiseless case for phantoms 1 and 2.

Table 5 Relative errors η(fm,f,X),η(fm+,f,X) for fm reconstructed from p=A8,8symp for phantom 1.

Table 6 Relative errors η(fm,f,X),η(fm+,f,X) for fm reconstructed from p=A8,8symp for phantom 2.

Figures , and Tables , show that for phantoms 1 and 2 for the noiseless case the approximations f1, f2 are considerably more precise than the classical Chang approximation f0.

In particular, for phantom 2 for the noiseless case f2 is drastically more precise than f0 if we take also into account their negative parts!

The approximate reconstructions f0, f2 with their central horizontal profiles from the filtered noisy data p=A8,8symp for phantoms 1 and 2 are shown in Figures and , where Al1,l2sym is the aforementioned filter of [Citation22].

Tables and show the relative errors η(fm,f,X) and η(fm+,f,X) in L2- norm for fm reconstructed from filtered noisy data p=A8,8symp for phantoms 1 and 2.

Figures , and Tables , show that for phantoms 1 and 2 for the noisy case the approximations f1, f2 are also more correct than the classical Chang approximation f0.

In particular, for phantom 2 for the noisy case f1, f2 are considerably more precise than f0 if we take also into account their negative parts.

Table also shows that the reconstruction quality of fm may degrade for large m. However, this degradation is absent in other numerical examples of this work. Apparently, this can be explained by the fact that our bounds σW,D,m remain relatively small for large m in our numerical examples, see Tables and .

Conclusions

In this work, we showed that the classical Chang approximate inversion formula (1.6) admits a very natural extention into inversion via finite Fourier series weight approximations or, more precisely, into inversion via (2.20) considered under assumption (2.19). Related theoretical considerations are presented in Sections 1 and 2 and numerical examples in the framework of SPECT are given in Section 3. Our examples of Section 3 include comparisons with the approximate Chang reconstruction f0 and show numerical efficiency (with respect to precision and stability) of our approximate reconstructions fm for m>0, under the condition that inequality (2.19) is fulfilled (with σmax = 0.7 in our examples), see Figures and Tables . In addition, possible advantages of our fm for m>0 in comparison with f0 are especially obvious from Figures and . Besides, Tables and show that our errors compare well with the 30% noise in the data.

Note also that considerations of Subsections 2.5 and 3.4 explain convergence of the iterative inversion of [Citation2] for many cases when the inequality of (2.30) is not fulfilled. The point is that less restrictive inequality (2.27) is sufficient for this convergence.

Acknowledgments

The authors are grateful to M.V. Klibanov and to anonymous referees for remarks that have helped to improve the presentation. The second author was partially supported by TFP No 14.A18.21.0866 of Ministry of Education and Science of Russian Federation (at Faculty of Control and Applied Mathematics of Moscow Institute of Physics and Technology).

References

  • Natterer F. The mathematics of computerized tomography. Stuttgart: Teubner; 1986.
  • Kunyansky LA. Generalized and attenuated Radon transforms:restorative approach to the numerical inversion. Inverse Probl. 1992;8:809–819.
  • Quinto ET. The invertibility of rotation invariant Radon transforms. J. Math. Anal. Appl. 1983;91:510–522.
  • Miqueles EX, De Pierro AR. Fluorescence tomography:reconstruction by iterative methods, ISBI. 2008;8:760–763.
  • Bal G. Inverse transport theory and applications, Inverse Probl. 2009;25:053001 (48pp).
  • Radon J. Uber die Bestimmung von Funktionen durch ihre Integralwerte langs gewisser Mannigfaltigkeiten. Ber. Verh. Sachs. Akad. Wiss. Leipzig, Math-Nat. 1917;K 1 69:262–267.
  • Novikov RG. An inversion formula for the attenuated X-ray transformation. Ark. Mat. 2002;40:145–167.
  • Tretiak OJ, Metz C. The exponential Radon transform. SIAM J. Appl. Math. 1980;39:341–354.
  • Boman J, Strömberg JO. Novikov’s inversion formula for the attenuated Radon transform - a new approach. J. Geom. Anal. 2004;14:185–198.
  • Gindikin S. A remark on the weighted Radon transform on the plane. Inverse Probl. Imag. 2010;4:649–653.
  • Novikov RG. Weighted Radon transforms for which Chang’s approximate inversion formula is exact. Uspekhi Mat. Nauk. 2011;66(2):237–238.
  • Arbuzov EV, Bukhgeim AL, Kazantsev SG. Two-dimensional tomography problems and the theory of A-analytic functions. Siberian Adv. Math. 1998;8(4):1–20.
  • Boman J. An example of non-uniqueness for a generalized Radon transform. J. Anal. Math. 1993;61:395–401.
  • Boman J, Quinto ET. Support theorems for real-analytic Radon transforms. Duke Math. J. 1987;55:943–948.
  • Chang LT. A method for attenuation correction in radionuclide computed tomography. IEEE Trans. Nucl. Sci. 1978;NS–25:638–643.
  • Guillement J-P, Novikov RG. Optimized analytic reconstruction for SPECT. J. Inv. Ill-Posed Problems. 2012;20:489–500.
  • Novikov RG. Weighted Radon transforms and first order differential systems on the plane, Available from: http://hal.archives-ouvertes.fr/hal-00714524.
  • Beilina L, Klibanov MV. The philosophy of the approximate global convergence for multidimensional coefficient inverse problems. Complex Var. and Ellip. Equa. 2012;57(2–4):277–299.
  • Beilina L, Klibanov MV. Approximate global convergence and adaptivity for coefficient inverse problems. New York: Springer; 2012.
  • Vekua IN. Generalized analytic functions. London: Pergamon Press; 1962.
  • Bronnikov AV. Reconstruction of the attenuation map using discrete consistency conditions. IEEE Trans. Med. Imaging. 2000;19:451–462.
  • Guillement J-P, Novikov RG. On Wiener type filters in SPECT. Inverse Probl. 2008;24:025001.
  • Guillement J-P, Jauberteau F, Kunyansky L, Novikov R, Trebossen R. On single-photon emission computed tomography imaging based on an exact formula for the nonuniform attenuation correction. Inverse Probl. 2002;18:L11–L19.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.