Analysis of reconstruction from discrete Radon transform data in $\mathbb R^3$ when the function has jump discontinuities
Alexander Katsevich

TL;DR
This paper analyzes how well discrete Radon transform data can reconstruct functions with jump discontinuities in three dimensions, providing explicit asymptotic behavior and proving accurate reconstruction at generic points.
Contribution
It provides the first explicit asymptotic analysis of reconstruction near discontinuities in 3D and establishes conditions under which the discrete inversion accurately recovers functions.
Findings
Explicit leading term behavior of reconstructed function near discontinuities
Discrete inversion formula converges at generic points with jumps as data density increases
Connection between reconstruction accuracy and uniform distribution theory
Abstract
In this paper we study reconstruction of a function from its discrete Radon transform data in when has jump discontinuities. Consider a conventional parametrization of the Radon data in terms of the affine and angular variables. The step-size along the affine variable is , and the density of measured directions on the unit sphere is . Let denote the result of reconstruction from the discrete data. Pick any generic point (i.e., satisfying some mild conditions), where has a jump. Our first result is an explicit leading term behavior of in an -neighborhood of as . A closely related question is why can we accurately reconstruct functions with discontinuities at all? This is a fundamental question, which has not been studied in the literature in dimensions three and higher.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMedical Imaging Techniques and Applications · Digital Image Processing Techniques · Mathematical Analysis and Transform Methods
Analysis of reconstruction from discrete Radon transform data in when the function has jump discontinuities
Alexander Katsevich1
Abstract.
In this paper we study reconstruction of a function from its discrete Radon transform data in when has jump discontinuities. Consider a conventional parametrization of the Radon data in terms of the affine and angular variables. The step-size along the affine variable is , and the density of measured directions on the unit sphere is . Let denote the result of reconstruction from the discrete data. Pick any generic point (i.e., satisfying some mild conditions), where has a jump. Our first result is an explicit leading term behavior of in an -neighborhood of as .
A closely related question is why can we accurately reconstruct functions with discontinuities at all? This is a fundamental question, which has not been studied in the literature in dimensions three and higher. We prove that the discrete inversion formula “works”, i.e. if is generic, then as . The proof of this result reveals a surprising connection with the theory of uniform distribution (u.d.). This is a new phenomenon that has not been known previously. We also present some numerical experiments, which confirm the validity of the developed theory.
1Department of Mathematics, University of Central Florida, Orlando, FL 32816.
This work was supported in part by NSF grant DMS-1615124.
1. Introduction
In this paper we consider the question: “Why and how well does tomographic reconstruction from discrete data work?” The answer is known if the function to be reconstructed is sufficiently smooth. Related problems are usually studied by sampling theory, where the goal is to estimate how closely the reconstructed function approximates in some global norm [9, 3, 11, 12, 15, 2, 5, 4, 20, 7]. Usually, is required to be essentially bandlimited, which imposes a smoothness requirement on . In the case when is not smooth (e.g. has jump discontinuities) the question has not been studied much. It consists of two parts:
- Q1.
What does reconstruction look like near the singularities of ?
- Q2.
What is the effect of “remote” singularities, i.e. the part of located at a distance from the reconstruction point?
Frequently, one is less interested in how approximates in some global norm. Instead, one would like to know how accurately and with what resolution the singularities of are reconstructed. Convergence of reconstruction algorithms in the case of objects with discontinuities has been studied as well [6, 16, 14, 17]. However, in these works the discontinuities of the object are a complicating factor rather than the object of the study. The first paper focusing specifically on the behavior of near a jump discontinuity of is [8], where the author considers inversion of the Radon transform in in the parallel beam setting. The object can be static or change with time. The parametrization of the data is conventional, i.e. in terms of the affine and angular variables. Suppose the step-sizes along the angular and affine variables are . Let denote the result of reconstruction from the descrete data. Pick a point , where has a jump. We suppose that is generic, i.e. it satisfies some mild conditions. The result of [8] is an explicit leading term behavior of in an -neighborhood of as . The obtained behavior, which we call transition behavior or, equivalently, edge response provides the desired resolution of the reconstruction algorithm. No such results were known in dimensions greater than two. In this paper we obtain the edge response in .
A closely related question is why can we accurately reconstruct functions with discontinuities at all? This is a fundamental question, which has not been studied in the literature in dimensions three and higher. The answer to the question is complicated. In , convergence of reconstruction algorithms in the case of objects with discontinuities has been studied in [6, 13, 16, 17]. In this paper we answer the question in . The key reason why reconstruction works comes from a surprising connection with the theory of uniform distribution (u.d.). This is a completely new phenomenon, which has not been noticed previously. The first hint of such a connection appeared in [8], where the transition behavior is derived using the u.d. property of a relevant sequence.
Let us discuss the main results of this paper in more detail. Similarly to the 2D case, we assume here that the step-size along the affine variable is , and the density of measured directions on the unit sphere is . First, we extend the notion of a generic point. Second, we obtain the transition behavior of in an -neighborhood of a generic point where has a jump discontinuity. This answers the question Q1 above. A connection with the u.d. theory here is similar to the one in [8].
Third, we answer the question Q2. We show that if is generic, then as . This means that if , then the singularities of at a distance from (i.e., “remote” singularities) do not contribute to the transition behavior at . Only the behavior of near contributes to the edge response. There is no contradiction between the assumptions and , since the singularities of near and away from can be separated by a partition of unity using the linearity of the Radon transform. Additionally, this result proves that the discrete inversion formula “works” (i.e., provides increasingly accurate results as ) and illuminates the reasons why. We show that reconstruction is guaranteed to work if certain collection of points is u.d. inside a set, whose shape depends on . A major complication in the proof is that the set shrinks as . This connection with the u.d. theory never appeared in the literature before (including [8]).
As was noted in [13, 14], the behavior of the reconstruction algorithm depends on the geometry of . Clearly, it also depends on the strength of singularities of (e.g., in the Sobolev scale). Comprehensive analysis of all these cases is beyond the scope of this paper. Here we consider only the case when has jump discontinuities across , and is the union of smooth convex surfaces.
The paper is organized as follows. In Section 2 we describe the problem set-up, specify the class of functions we consider, describe discrete Radon transform data, introduce the discrete inversion formula, define the notion of a generic point, and formulate the main result (Theorem 1). In Section 3 we obtain the edge response in a neighborhood of a generic point . In Section 4 we show that “remote” singularities do not contribute to the edge response. In Section 5 we illustrate on numerical experiments that when is generic, then the theoretically predicted and numerically computed edge responses match very well. We also show that if is not generic, then the match may no longer be accurate. Technical results related to the u.d. property of certain sets of points, which are needed in Section 4, are proven in Appendix A.
2. Preliminary construction
Consider a function , which can be represented as a finite sum
[TABLE]
where is the characteristic function of the domain . We assume that for each :
- (1)
is bounded, 2. (2)
The boundary of is and convex, 3. (3)
is in a domain containing the closure of .
The Radon transform of is defined as follows:
[TABLE]
where is the area element on the plane . The discrete data are given by
[TABLE]
where , and , , is the index that enumerates the measured directions . When considering in some small open set , we will use a 2D multi-index instead of : . The assumption is that for almost all there exists an open set , , such that
[TABLE]
Here are some constants, , which may depend on . The function , where is some bounded domain, is a smooth diffeomorphism. Both and may depend on and . We also assume that the determinant
[TABLE]
is bounded away from zero in each .
Let be an interpolating kernel, which satisfies the following assumptions:
- A1.
is exact up to the order , i.e.
[TABLE]
- A2.
is compactly supported,
- A3.
The derivatives , , exist,
- A4.
is piecewise continuous and bounded,
- A5.
.
The interpolated (in ) version of can be written in the form
[TABLE]
To simplify notations, the dependence of on is omitted in most places.
Since the Radon transform is even, the classical inversion formula with continuous data is given by
[TABLE]
where is any half of the unit sphere in . The discrete inversion formula is given by
[TABLE]
where are integration weights. We assume that there exist so that
[TABLE]
for all as . A convenient and useful way to think of the coefficients is that they represent the area of pieces that tessellate , each piece is sufficiently regular and contains only one . In particular, for any such that belongs to the same tessellation piece as .
Pick a point , and suppose that is a smooth surface with positive principal curvatures in a neighborhood of . Let be the unit vector normal to at and pointing into the interior of the corresponding domain . Consider the point
[TABLE]
where varies over a bounded set. Denote also:
[TABLE]
Introduce the coordinates on in a neighborhood of :
[TABLE]
Let be a function determined by the condition that the plane be tangent to . Generally, can be multi-valued. In what follows we always consider one of its single-valued local branches. Pick some and introduce the functions
[TABLE]
Pick any such that . If has positive principal curvatures at a point , where is tangent to , and , then the equation determines a locally smooth curve, which we denote by . By construction, . The curve is smooth, because . The derivative with respect to is computed on the unit sphere, and are the orthogonal projections of , respectively, onto the plane . Clearly, can be tangent to at other points, but here is the local branch that is valid in a neighborhood of . Our statements apply to any of the branches and the corresponding points of tangency.
Definition 1**.**
We say that a point is generic if
- (1)
* is a smooth surface with positive principal curvatures in a neighborhood of . In particular, does not self-intersect at ;* 2. (2)
Let be the unit vector normal to at , and let be such that . The vector has at least one irrational component; and 3. (3)
If a plane contains and is tangent to at some , then the principal curvatures of at are positive.
An additional condition for a point to be generic is formulated in Section 4.
Definition 2**.**
We say that a point is generic if it satisfies condition (3) above and the additional condition in Section 4.
Now we formulate the main result of the paper.
Theorem 1**.**
For a generic , one has
[TABLE]
The proof of the theorem is split into two sections.
3. Contribution of the local singularity
In this section we choose the hemisphere in (2.8) and (2.9). The range of in (2.9) can be split into three sets:
[TABLE]
for some small (but fixed) . Here is a large parameter. Let denote the value of the sum in (2.9) ranging over indices such that , . Consider first.
It will be shown below (see Section 3.1) that the Radon transform of locally smooth components of does not contribute to the transition behavior of . Hence, without loss of generality, we can assume that in a neighborhood of on the exterior side of (this is the side corresponding to in (2.11)). By linearity and using a partition of unity if necessary, we can assume that is contained in a small neighborhood of . The local branch of that we use in this section is determined by the condition that the point of tangency be close to . As is known, [18, 19], in this case we have
[TABLE]
where is a smooth function near ,
[TABLE]
and is the matrix of the second fundamental form of in the basis at the point where is tangent to . A simple calculation shows that
[TABLE]
when . Hence the interpolated data are given by
[TABLE]
In view of (2.9) and (3.5), denote
[TABLE]
The assumptions A1–A4 imply that
[TABLE]
[TABLE]
[TABLE]
Combining (3.4)–(3.6) and using (2.9), (3.1), we obtain
[TABLE]
where we have introduced the notation
[TABLE]
The term in brackets in (3.10) corresponds to the second term in brackets in (3.5). This follows because , is compactly supported, and (cf. (3.1) and (3.4)). In (3.10) we used that (a) there are terms in the sum with respect to , and (b) using (2.10), the sum in (3.10) remains bounded as .
Set . The tessellation of based on induces a tessellation of the domain . Let denote the area of the tessellation piece corresponding to . From (2.13),
[TABLE]
The term here also includes the Jacobian of the transformation .
Apply (2.4) to an open set containing . By shifting indices and adjusting , if necessary, we can always assume that . Denote
[TABLE]
Then
[TABLE]
Combining the above, rewrite (3.10) as follows
[TABLE]
where depends on , but is independent of . The term in (3.14) is absorbed by the term in (3.15).
To find the limit of as , pick some small and break up the domain into squares of size . Consider one and all within it. Replace all with , where is the center of , everywhere in the arguments of . This leads to an error of magnitude . By we denote any quantity whose magnitude does not exceed , where is independent of the selected square , the chosen , and . Clearly,
[TABLE]
By (3.8) and (3.16), we can consider the set
[TABLE]
where are such that . There are such : per each coordinate . Here and in what follows, denotes the fractional part of a number . By Theorem 2.9 and Example 2.9 of [10], the set is u.d. as if at least one of the components of the vector is irrational (see condition (2) in the definition of a generic point). Clearly, the shift by does not affect the u.d. property. Therefore, for the sum of the terms in (3.15) corresponding to we obtain
[TABLE]
Here is the number of terms in the sum in (3.18), and is the average of . By construction, whenever .
Sum over all squares and observe that the resulting Riemann sum is within from the corresponding integral. This yields:
[TABLE]
Since can be as small as we like, combining (3.19) with (3.15) gives
[TABLE]
In view of (3.9), if is fixed, the integrand in (3.20) is zero when is large enough (recall that is positive definite). Hence we can select large enough and obtain by changing variables
[TABLE]
Lemma 1**.**
One has
[TABLE]
for some large enough.
Proof.
[TABLE]
Using A2 and A5 we finish the proof. ∎
3.1. Analysis of the terms and .
The Radon transform of is smooth when are such that and , i.e. is not tangent to . Hence the interpolated data has derivatives with respect to up to the order uniformly bounded as . Therefore,
[TABLE]
For a function we have
[TABLE]
where we have used (2.6). Combining with (3.24) this implies
[TABLE]
In a similar fashion, we will show that
[TABLE]
Choose in (3.1) so that is strictly convex on . In view of (3.4), this is possible. Hence the lower bound on the values of on is determined by looking at its values at the boundary of , where (3.4) holds. Pick large enough. Our argument implies that there exist sufficiently large and sufficiently small such that on for all , . Since is compactly supported, is a smooth function in a neighborhood of all such that and . The reason is that for such we can drop the subscript from in (3.2):
[TABLE]
Hence (3.27) follows similarly to (3.24)–(3.26).
Examining the above argument more carefully, we see that on , the part of the Radon transform of that is used in the inversion formula coincides with a globally smooth function, so we have
[TABLE]
where is defined in (2.12). The notation “” means that the derivative with respect to is evaluated on the interior side of the domain where the Radon transform of is smooth. The last equality in (3.29) is an immediate corollary of the inversion formula and the smoothness of the Radon transform.
4. Contribution of remote singularities
Suppose the plane is tangent to at some , . In this section is generic, but otherwise arbitrary, and is arbitrary as well. In particular, is not necessarily on . Again, using linearity, we suppose that is a subset of a small neighborhood of . The surface can have a wide variety of shapes in a neighborhood of . Some of these shapes may produce artifacts (e.g., if is locally flat near ), while others - will not. Comprehensive analysis of all such cases is beyond the scope of this paper. Here we will consider one generic situation: the principal curvatures of at are positive. In this section we prove that the singularity at does not contribute to the transition behavior of the reconstruction at . More precisely, we will prove that in the limit the discretized reconstruction formula (2.9) gives the same result as the exact reconstruction formula (2.8).
To illustrate the main ideas, we start with the case when the reconstruction point is rather than . As noted in Section 2, assumption (3) in the definition of a generic point implies that the equation determines a locally smooth curve denoted . Let be a smooth cut-off function with small support such that on . Using (2.14), introduce the functions
[TABLE]
where is the domain of . The function here is the same as in (3.13).
Let and be the images of and , respectively, under the map . Using (2.5) and that for any , we can assume that is so small that either for any or for any . Without loss of generality, suppose . This implies that an equation of can be written in the form
[TABLE]
for some smooth . Indeed, setting , the Implicit Function theorem implies that is well-defined, and .
Now we can formulate the last condition that a generic point satisfies.
- (4)
Pick any local piece constructed as above and any such that . Consider the function defined on the domain . We have
- (a)
The set of such that is the union of a finite number of distinct points and non-intersecting intervals, and 2. (b)
If on an interval, then is irrational on that interval.
An obvious modification needs to be made for pieces where , .
[TABLE]
Let denote the result of inserting and into the discrete inversion formula (2.9), . By linearity, . Similarly to (3.5), (3.10):
[TABLE]
Let be the projection of onto the -axis. Partition the projection onto the intervals of length : , . Pick one of the subintervals, e.g. the -th. Let be its center, and set , . For convenience, denote , , and let be the set of indices such that . Rewrite the part of the sum in (4.4) that corresponds to the indices :
[TABLE]
Here we have used that the sum is uniformly as , and that for all such that and , where is the area of the tessellation piece containing . By (3.9), there are nonzero terms in the sum. Combined with (2.10), we get that the sum is indeed of order .
By construction,
[TABLE]
The assumption , , implies that the lines , intersect transversely. Then
[TABLE]
where we have used that is bounded whenever , and . There are two big- terms in (4.7), because and are independent variables. Similarly,
[TABLE]
By (3.8), the non-zero terms in (4.6) can be written in the form
[TABLE]
where we denoted
[TABLE]
Because of (3.9), there are finitely many values of for which in (4.9) is non-zero.
For a fixed value of , the effect of the term in the first argument of is just a shift that does not affect the u.d. property. So it can be ignored if we show that the points
[TABLE]
are u.d. in the square as . Corollary 2 and Assumption (4) imply that the set
[TABLE]
is u.d. in as . Then, Lemma 3 implies the desired result.
Pick one value of . The arguments of on the last line in (4.9) are u.d. over the rectangle with area . There are distinct values of such that . Thus, the area per each value is . Summation over just shifts this rectangle along the second variable. These rectangles are stacked precisely one on top of the other without overlap. Hence
[TABLE]
Using (3.23) and then A5 gives:
[TABLE]
From (4.5), (4.6), (4.9), (4.13), and (4.14) it follows that we have to evaluate the following expression:
[TABLE]
Here we have used that the elementary area in the -coordinates is , and the area of the corresponding piece on is . Combining the above results gives
[TABLE]
Next we sum for all . Since can be arbitrarily small, we conclude from (4.16) by using (4.7) that
[TABLE]
The result in (4.17) is, of course, expected, since this is what one gets in the continuous case by substituting and (cf. (4.3)) into (2.8). The same result for , which leads to , follows immediately, since the second order derivative or with respect to is piecewise-smooth and bounded on . In this case the contribution of the terms in an -neighborhood of goes to zero as .
Next we discuss how the above derivation changes when replaces in (4.4). Clearly, it is sufficient to consider only the leading singular term . The analogue of (4.1) becomes
[TABLE]
From (4.8) and (4.18), we find
[TABLE]
Hence the analogue of (4.9) becomes:
[TABLE]
The new arguments of are obtained from the old ones by a constant shift. Clearly, this does not affect the averaging argument in (4.10)–(4.16). The interval needs to be enlarged slightly to account for the dependence of on . The derivation works the same way, and we get the same result as in (4.17) even if replaces on the left side of (4.17). Thus, we proved the following result.
Theorem 2**.**
Pick a generic point . For any , confined to a bounded set, and any one has
[TABLE]
Combining (3.21), (3.23), (3.26), (3.27), (3.29), and (4.21), we finish the proof of Theorem 1.
5. Numerical experiments
We start by constructing an interpolation kernel with the required properties. We use the method of [1]. In [1] the authors construct piecewise-polynomial kernels , which are characterized by a quadruple of numbers . Here
- (1)
is the maximal degree of polynomial pieces that make up , 2. (2)
is the support: , 3. (3)
is regularity, i.e. is times continuously differentiable, and 4. (4)
is order, i.e. the approximation error behaves like , where is step-size.
Additional requirements, e.g. that be symmetric and interpolating can be imposed too.
Assumption A3 implies that . Since is piecewise-polynomial, is automatically piecewise continuous and bounded, so Assumptions A3 and A4 are satisfied if . As is easy to see, Assumption A1 is satisfied if . Assumption A2 means that . Hence we should have , , and . The construction in [1] involves a number of free parameters (degrees of freedom) . In our case there are
[TABLE]
degrees of freedom. The requirement that be interpolating: imposes (respectively, ) additional conditions if is odd (respectively, even). Consequently, (resp., ) if is odd (resp., even). Hence, and . Choosing , gives the minimal acceptable value . Thus, can be selected in the class .
Imposing the condition that be symmetric and using equations (20), (22), and (23) in [1] implies that can be represented in the form
[TABLE]
where are some constants, and denotes the cardinal B-spline of degree supported on . Finding by solving the system and simplifying gives the final expression
[TABLE]
Using the properties of B-splines, we see that .
The test object consists of two balls with centers and . Each ball has radius and uniform density 1. The point on the boundary , in a neighborhood of which we study resolution, is given by
[TABLE]
In agreement with our convention, points into the interior of the first ball. The second ball is chosen in such a way that the plane through and normal to is tangent to its boundary. This way we demonstrate that remote singularities do not contribute to edge response.
To simulate discrete data, Radon transform is computed at the points
[TABLE]
Thus, . The predicted response is computed using (2.15), where . The results are shown in Figure 1. The -axis in the figure shows the -values. The -axis shows the reconstructed values at the points (cf. (2.11)) as well as the predicted transition curve (edge response). The results show a good match.
Next we illustrate the situation where condition (2) does not hold and Theorem 1 does not hold either. The test object consists of a single ball of radius 1 with center in the first experiment, and center - in the second experiment. The point on the boundary is now given by
[TABLE]
As is easily seen, in both cases the components of the vector (cf. (3.13)) are integers, so is not generic. The results are shown in Figure 2. The plot on the left is for the case , and on the right - for the case . The match between the predicted and actual transition behaviors is no longer accurate.
Appendix A Auxiliary results
Lemma 2**.**
Given an interval , consider a real-valued function such that either (1) on and equals to an irrational number, or (2) on , and
[TABLE]
for some . Then the points , , are u.d. as .
Proof.
Case (1) is well-known (see [10]), so we only consider case (2). Using Weyl’s criterion, we wish to show that
[TABLE]
for all integers , where . Let be fixed in what follows. The case can be reduced to the case by complex conjugation.
Without loss of generality, we may assume that and . Let be the points such that
[TABLE]
Suffice it to show that
[TABLE]
for each , .
Partition into the intervals of length :
[TABLE]
By assumption, is bounded away from zero on , so each subinterval contains points from the original set .
First, we show that
[TABLE]
Since
[TABLE]
it follows from (A.6)
[TABLE]
The big- terms in (A.7) and (A.8) are uniform in , because uniformly as .
To prove (A.4), partition the sum and then use (A.6), (A.8) to obtain an estimate:
[TABLE]
In , the sum is over such that
[TABLE]
In , the sum is over such that
[TABLE]
Each of the sums is over consequtive values of . In particular, the number of terms in each sum is bounded from below by for all sufficiently small, where is some constant.
Consider . We use the inequality
[TABLE]
where denotes the distance from to the nearest integer. By (A.1), (A.3), (A.5), and (A.10),
[TABLE]
for all used in . Using (A.12) in (A.9) with
[TABLE]
gives
[TABLE]
This implies,
[TABLE]
The quantity can be estimated in a similar fashion (using (A.11) instead (A.10)), and the lemma is proven. ∎
Corollary 1**.**
Given an interval , pick a real-valued function . Suppose that
- (1)
The set is the union of a finite number of distinct points and non-intersecting intervals, and 2. (2)
If on an interval, then is irrational on that interval.
Then the points , , are u.d. as .
Proof.
Let be the set consisting of the isolated points where and of the endpoints of the intervals where . By assumption, contains finitely many points. Let denote the -neighborhood of . Clearly, is a finite union of non-overlapping intervals such that (1) can be made as small as we like by choosing small, and (2) each of the intervals satisfies the assumptions of Lemma 2. Thus the points , , are u.d. as . The fraction of the remaining points can be made arbitrarily small, which proves the desired assertion. ∎
Corollary 2**.**
Given an interval , pick two functions . Suppose the linear combination satisfies the assumptions of Corollary 1 for any pair , . Then the set of points , , is u.d. in as .
Proof.
The assertion follows immediately from [10], Theorem 6.3, and Corollary 1. ∎
Lemma 3**.**
Let the set , , be u.d. in the square as . Here is some set of indices that depends on . Then the set , , is also u.d. in as for any .
Proof.
Pick some so that . Consider the domain
[TABLE]
As is seen from elementary geometry (proof by picture), the area of is independent of and equals . Since is u.d. in , the desired assertion follows. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] T. Blu, P. Thévenaz, and M. Unser. Complete Parameterization of Piecewise-Polynomial Interpolation Kernels. IEEE Transactions on Image Processing , 12:1297–1309, 2003.
- 2[2] A. Caponnetto and M. Bertero. Tomography with a finite set of projections: singular value decomposition and resolution. IEEE Transactions on Information Theory , 13:1191–1205, 1997.
- 3[3] L. Desbat. Efficient sampling on coarse grids in tomography. Inverse Problems , 9:251–269, 1993.
- 4[4] A. Faridani. Sampling theory and parallel-beam tomography. In Sampling, wavelets, and tomography , volume 63 of Applied and Numerical Harmonic Analysis , pages 225–254. Birkhauser Boston, Boston, MA, 2004.
- 5[5] A. Faridani and E. Ritman. High-resolution computed tomography from efficient sampling. Inverse Problems , 16:635–650, 2000.
- 6[6] S. I. Gonchar. Convergence of computational algorithms for recovering discontinuous functions from the Radon transform. Russian Mathematical Surveys , 41:205–206, 1986.
- 7[7] S. H. Izen. Sampling in flat detector fan beam tomography. SIAM Journal on Applied Mathematics , 72:61–84, 2012.
- 8[8] A. Katsevich. A local approach to resolution analysis of image reconstruction in tomography. SIAM Journal on Applied Mathematics , 77:1706–1732, 2017.
