![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
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 from its weighted ray transform
on
for some known weight W, where
(1.1)
(1.1) where
,
,
. Up to change of variables, the operator
is known also in literature as the weighted Radon transform on the plane. In this work we always assume that
(1.2)
(1.2) where W is complex valued, in general, and
is the standard element of arc length on
. 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)
(1.3) In addition, for this work one can always assume that
(1.4)
(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 is interpreted as the set of all oriented straight lines in
. If
, then
(modulo orientation) and
gives the orientation of
.
If , then
is reduced to classical ray (or Radon) transform on the plane. If
(1.5)
(1.5) where a is a complex-valued sufficiently regular function on
with sufficient decay at infinity, then
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 ) arises, in particular, in SPECT, see e.g. [Citation1, Citation2]. Transforms
with some other weights also arise in applications, see e.g. [Citation2–Citation5].
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 [Citation8–Citation11]. Note that, we say that an inversion method for 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 , under assumptions (1.2), (1.3), explicit and simultaneously exact (modulo
) inversion formulas are impossible. In addition, [Citation13] gives an example of infinitely smooth W satisfying (1.2), (1.3) and such that
in the space of infinitely smooth compactly supported functions on
. But, due to [Citation14],
in the space of continuous compactly supported functions on
for real analytic W satisfying (1.3).
On the other hand, the following Chang approximate (but explicit) inversion formula for , where W is given by (1.5) with
, has been used for a long time (see e.g. [Citation2, Citation11, Citation15]):
(1.6)
(1.6) where
is defined in (1.2),
denotes the classical Radon inversion realized via the formula given below:
(1.7)
(1.7) where q is a test function on
. 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 via the approximation
(1.8)
(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)
(1.9) Besides, due to [Citation11], formula (1.6) is exact if and only if
(1.10)
(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 via the approximations
(1.11)
(1.11) One can see that for
approximation (1.11) is reduced to (1.8).
Our approximate inversion algorithms for 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
, 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 in the framework of SPECT.
Finally, note that the ‘philosophy’ of our approach to approximate inversion of 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 ![](//:0)
![](//:0)
Symmetrization of W
Let(2.1)
(2.1) where
is defined by (1.7). Let
(2.2)
(2.2) We consider also the Fourier series
(2.3)
(2.3) where
is defined in (1.11),
.
The following formulas hold (see [Citation2, Citation11]):(2.4)
(2.4)
(2.5)
(2.5)
(2.6)
(2.6) Actually, using (2.4)–(2.6) we reduce inversion of
to inversion of
. In particular, using (2.1), (2.5), (2.6), one can see that such reduction arises already in the framework of (1.6).
Operators ![](//:0)
and numbers ![](//:0)
![](//:0)
Consider(2.7)
(2.7) Using (2.7), we identify
with
.
Let ,
denote the linear integral operators on
identified with
such that
(2.8)
(2.8) where u is a test function,
; see e.g. [Citation20] for detailed properties of these operators.
Let D be the domain of (1.4).
Let denote the characteristic function of D, i.e.
(2.9)
(2.9) Let
(2.10)
(2.10) where
,
are the Fourier coefficients of (2.3), (2.6) and
,
are considered as the multiplication operators of
.
Let(2.11)
(2.11) According to [Citation17] we have that
(2.12)
(2.12)
Exact inversion for finite Fourier series weights
Let conditions (1.2), (1.4) be fulfilled and(2.13)
(2.13) Suppose also that
(2.14)
(2.14) where
denotes the integer part of
. Then according to [Citation17], we have the following exact inversion for
:
(2.15)
(2.15) where I is the identity operator on
,
is defined by (1.7). In addition, in view of (2.12), (2.14) we have that
(2.16)
(2.16) In addition, under our assumptions, we have that (see [Citation17]):
(2.17)
(2.17)
Approximate inversion for general weights
Let conditions (1.2), (1.4) be fulfilled and(2.18)
(2.18) where
are defined by (2.11). Suppose that
(2.19)
(2.19) Then we consider that
(2.20)
(2.20) where I is the identity operator,
is defined by (2.10),
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
and using (2.18) one can show that
(2.21)
(2.21) Formula (2.20) is a natural extension of the Chang formula (1.6). In particular, (2.20) for
coincides with (1.6).
In addition, if (2.19) is fulfilled for some , then
is a refinement of the Chang approximation
and, more generally,
is a refinement of
for
. But of course
if
,
for
.
Actually, in many important examples condition (2.19) is efficiently fulfilled for small m (e.g. ) 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
:
(2.22)
(2.22) In Section 3, we illustrate this approximate reconstruction by numerical examples in the framework of SPECT with
. In particular, these numerical examples show that stability properties of this approximate reconstruction
are similar to stability properties of the Chang approximate reconstruction
but
is more precise than
if
.
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)
(2.23) where
(2.24)
(2.24) where
are defined by (1.11). One can use (2.23) for estimating the error
. One can also consider (2.23) as an integral equation for finding f from
. Note also that Equation (2.23) for
is, actually, well known, see e.g. [Citation2].
Relations with [Citation2]
Let conditions (1.2), (1.4) be fulfilled and(2.25)
(2.25) Then, we can consider
(2.26)
(2.26) In addition, if
(2.27)
(2.27) then
(2.28)
(2.28)
(2.29)
(2.29) Actually, (2.28) is a linear integral equation for exact reconstruction of f from
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 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 ), it was shown that this equation on
of [Citation2] is uniquely solvable if
(2.30)
(2.30) One can see that in many cases,
is much smaller than
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)
(2.31)
(2.32)
(2.32) where
denotes the 2D Fourier transform operator,
,
are defined by (2.8),
is defined by (2.10),
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 is given by (1.5), where
. We recall that in SPECT, after restricting the problem to a fixed
plane, the functions
, a and f are interpreted as follows:
is the distribution of radioactive isotopes emitting photons (emitter activity);
is the photon attenuation coefficient (attenuation map);
in addition, it is assumed that
,
, where D is some known compact domain;
describes the expected radiation outside D. In addition, in some approximation, measured SPECT data p are modelled as
with Poisson noise on some discrete subset
of
. That is
is modelled as a realization of a Poisson variable
, where the mean
for each
. We recall that variance
for a Poisson variable
and, therefore, the Poisson noise can be considered as an intermediate case between additive and multiplicative noises. Usually, it is also assumed that:
, where R is the radius of image support,
is a uniform
sampling of
(3.1)
(3.1)
Image parameters
All 2D images of this work are considered on grids (X and
), where
. We assume that X is a uniform
sampling of
(3.2)
(3.2) and
is a uniform
sampling of
, 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 and noisy emission data p for these phantoms are shown in Figures and .
Fig. 1 (a) Attenuation map , (b) emiter activity
, (c) noiseless emission data
, (d) noisy emission data
(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)](/cms/asset/79ba4b23-87fd-4b63-9f59-091fd7960f27/gipe_a_823417_f0001_b.gif)
Fig. 2 (a) Attenuation map , (b) emiter activity
, (c) noiseless emission data
, (d) noisy emission data
(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)](/cms/asset/d2a25f0b-f9eb-49ce-8d64-e586e5a3fdc6/gipe_a_823417_f0002_b.gif)
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:
the major axis of the ellipse representing the body is 30 cm,
attenuation coefficient a is 0.04 cm
in the lung region (modelled as two interior ellipses), 0.15 cm
elsewhere within the body ellipse and zero outside the body,
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,
noisy emission data
contain 30% of the Poisson noise in the sense of
-norm and the total number of photons is 125 450. Phantom 2 is a simulated numerical version of the Utah phantom (designed at the 2
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:
geometrically the phantom consists of a large disk containing two small disks, where the radius of the large disks is 10 cm,
attenuation coefficient a is 0.16 cm
in the large disk outside the small disks, 0.63 cm
in the left small disk, 0.31 cm
in the right small disk, and zero outside the large disk,
emitter activity f is a positive constant in the large disk outside the small disks and zero elsewhere
noisy emission data p contain 30% of the Poisson noise in the sense of
-norm and the total number of photons is 89 350.
Results for the bounds ![](//:0)
and ![](//:0)
![](//:0)
The bound numbers ,
of (2.11), (2.30) for phantoms 1 and 2 are shown in Tables and , where
.
Table 1 Numbers ,
of (2.11), (2.30) for phantom 1, where
.
Table 2 Numbers ,
of (2.11), (2.30) for phantom 2, where
.
For phantoms 1 and 2, Tables and show that condition (2.19) with = 0.7 is fulfilled for m = 1 and m = 2, whereas
already for
.
Table 3 Relative reconstruction errors for the noiseless case for phantom 1.
Reconstruction results for the emitter activity f
For phantoms 1 and 2 we consider the approximate reconstructions 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
. The method of successive approximations was always realized in the framework of 4 iterations. In addition:
we consider
, mainly, under the condition that
,
we consider
for
, where
is the approximately optimal space-variant Wiener-type filter of Section 5.3 of [Citation22].
Table 4 Relative reconstruction errors for the noiseless case for phantom 2.
In addition to we consider also their non-negative parts
, where
For phantoms 1 and 2, Tables and show that
is fulfilled for
only.
To study reconstruction errors we consider, in particular,(3.3)
(3.3) where
,
are test functions on X.
The approximate reconstructions ,
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 ,
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)](/cms/asset/b6ba5fa4-3faa-464e-bb03-5bd2ee3229b1/gipe_a_823417_f0003_b.gif)
Fig. 4 Phantom 2:(a) true f, (b), (c) approximate reconstructions ,
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)](/cms/asset/5e633611-1fee-41d4-ac1a-964dde813d28/gipe_a_823417_f0004_b.gif)
Fig. 5 Phantom 1: (a) true f, (b), (c) approximate reconstructions ,
from the filtered noisy data
(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)](/cms/asset/d3b34a88-0a1c-4923-9146-62c8a5c17d20/gipe_a_823417_f0005_b.gif)
Fig. 6 Phantom 2: (a) true f, (b), (c) approximate reconstructions ,
from the filtered noisy data
(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)](/cms/asset/c7638dc6-337f-4cb7-9058-6733717cacf4/gipe_a_823417_f0006_b.gif)
Tables and show the relative errors and
in
- norm for the approximate reconstructions
with respect to precise f for the noiseless case for phantoms 1 and 2.
Table 5 Relative errors for
reconstructed from
for phantom 1.
Table 6 Relative errors for
reconstructed from
for phantom 2.
Figures , and Tables , show that for phantoms 1 and 2 for the noiseless case the approximations ,
are considerably more precise than the classical Chang approximation
.
In particular, for phantom 2 for the noiseless case is drastically more precise than
if we take also into account their negative parts!
The approximate reconstructions ,
with their central horizontal profiles from the filtered noisy data
for phantoms 1 and 2 are shown in Figures and , where
is the aforementioned filter of [Citation22].
Tables and show the relative errors and
in
- norm for
reconstructed from filtered noisy data
for phantoms 1 and 2.
Figures , and Tables , show that for phantoms 1 and 2 for the noisy case the approximations ,
are also more correct than the classical Chang approximation
.
In particular, for phantom 2 for the noisy case ,
are considerably more precise than
if we take also into account their negative parts.
Table also shows that the reconstruction quality of 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
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 and show numerical efficiency (with respect to precision and stability) of our approximate reconstructions
for
, under the condition that inequality (2.19) is fulfilled (with
= 0.7 in our examples), see Figures – and Tables –. In addition, possible advantages of our
for
in comparison with
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.