Hengyong Yu1, Ge Wang. 1. Biomedical Imaging Division, VT-WFU School of Biomedical Engineering and Science, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, USA.
Abstract
Here we propose a cone-beam composite-circling mode to solve the quasi-short object problem, which is to reconstruct a short portion of a long object from longitudinally truncated cone-beam data involving the short object. In contrast to the saddle curve cone-beam scanning, the proposed scanning mode requires that the X-ray focal spot undergoes a circular motion in a plane facing the short object, while the X-ray source is rotated in the gantry main plane. Because of the symmetry of the proposed mechanical rotations and the compatibility with the physiological conditions, this new mode has significant advantages over the saddle curve from perspectives of both engineering implementation and clinical applications. As a feasibility study, a backprojection filtration (BPF) algorithm is developed to reconstruct images from data collected along a composite-circling trajectory. The initial simulation results demonstrate the correctness of the proposed exact reconstruction method and the merits of the proposed mode.
Here we propose a cone-beam composite-circling mode to solve the quasi-short object problem, which is to reconstruct a short portion of a long object from longitudinally truncated cone-beam data involving the short object. In contrast to the saddle curve cone-beam scanning, the proposed scanning mode requires that the X-ray focal spot undergoes a circular motion in a plane facing the short object, while the X-ray source is rotated in the gantry main plane. Because of the symmetry of the proposed mechanical rotations and the compatibility with the physiological conditions, this new mode has significant advantages over the saddle curve from perspectives of both engineering implementation and clinical applications. As a feasibility study, a backprojection filtration (BPF) algorithm is developed to reconstruct images from data collected along a composite-circling trajectory. The initial simulation results demonstrate the correctness of the proposed exact reconstruction method and the merits of the proposed mode.
Since its introduction in 1973 [1], X-ray CT has revolutionized clinical imaging and become a
cornerstone of radiology departments.
Closely correlated to the development of X-ray CT, the research for
better image quality at lower dose has been pursued for important medical
applications with cardiac CT being the most challenging example. The first
dynamic CT system is the dynamic spatial reconstructor (DSR) built at the Mayo
Clinic in 1979 [2, 3]. In a 1991 SPIE
conference, for the first time we presented a spiral cone-beam scanning mode to
solve the long object problem [4, 5] (reconstruction of a long object from longitudinally
truncated cone-beam data). In 1990s, single-slice spiral CT became the standard
scanning mode of clinical CT [6]. In 1998, multislice
spiral CT entered the market [7, 8]. With the fast evolution of the technology,
helical cone-beam scanning becomes a main mode of clinical CT. Moreover, just
as there have been strong needs for clinical imaging, there are equally strong
demands for preclinical imaging, especially of genetically engineered mice [9-11].To meet the biomedical needs and technical challenges,
it is imperative that cone-beam CT methods and architectures must be developed
in a systematic and innovative manner so that the momentum of the CT technical
development as well as clinical and preclinical applications can be sustained
and increased. For that purpose, our CT
research has been for superior dynamic volumetric low-dose imaging
capabilities. Since the long object
problem has been well studied by now, we recently started working on the
quasi-short object problem (reconstruction of a short portion of a long object
from longitudinally truncated cone-beam data involving the short object).Currently, the state-of-the-art
cone-beam scanning for clinical cardiac imaging follows either circular or
helical trajectories. The former only permits approximate cone-beam
reconstruction because of the inherent data incompleteness. The latter allows
theoretically exact reconstruction but due to the openness of helical scanning
there is no satisfactory scheme to utilize cone-beam data collected near the
two ends of the involved helical segment. Recently, saddle-curve cone-beam
scanning was studied for cardiac CT [12, 13], which can be directly implemented by compositing circular
and linear motions: while the X-ray source is rotated in the vertical -
plane, it is also driven back and forth along the -axis. Because the electromechanical
needs are very challenging for converting a motor rotation to the linear
oscillation and handling the acceleration of the X-ray source along the -axis,
it is rather difficult to implement directly the saddle-curve scanning mode in
practice, and it has not been employed by any CT company. However, it does
represent a very promising solution to the quasi-short object problem. Early
this year, we invented a composite-circling scanning principle to solve the quasi-short object problem [14].In Section 2, we will define
the new scanning mode. In Section 3, we will describe a backprojection filtration-
(BPF-) based exact reconstruction algorithm. In Section 4, we will
present representative simulation results. In Section 5, we discuss some
related issues and conclude the paper.
2. COMPOSITE-CIRCLING SCANNING
When an X-ray focal spot is in a 2D (no, linear, circular,
or other types) motion on the plane, or more general in a 3D motion within a neighborhood,
facing a short object to be reconstructed, and the X-ray source is at the same
time rotated in a transverse plane of a patient, the synthesized 3D scanning
trajectory can take various forms with respect to the short object. Specifically,
let and be the lengths of the two semiaxes of the scanning range in the focal spot plane facing the short object, and the radius of the tube scanning circle on the
- plane, we define a family of saddle-like composite trajectory as where represents time, and are the angular frequencies of the focal spot
and tube rotations, respectively. When the ratio between and is an irrational number or a rational number
with large numerator in its reduced form, the scanning curve covers a band of
width ,
allowing a uniform sampling pattern. With all the possible settings of , , , , and , we have numerous cone-beam scanning
trajectories including saddle curves and composite-circling loci that can be
used to solve the quasi-short problem exactly. We are particularly interested in a rational ratio between and in this paper, which will result in a
periodical scanning trajectory. Without
loss of generality, we reexpress (1) as where is a rational number. When and , we obtain the standard saddle curve. When , we have our proposed composite-circling trajectory.
Some representative composite-circling curves are shown in Figure 1.
As mentioned in the introduction,
while the saddle curve cone-beam scanning does meet the requirement for exact
cone-beam cardiac CT, it imposes quite hard mechanical constraints. In contrast
to the saddle curve cone-beam scanning, our proposed composite-circling requires that the X-ray
focal spot undergo a circular motion in a plane facing the short object to be
reconstructed, while the X-ray source is rotated in the main gantry plane (see Figure 2). Preferably, we may let the patient
sit or stand straight and make the gantry plane parallel to the earth
surface. Because of the symmetry of the
proposed mechanical rotations and the compatibility with the physiological
conditions, we believe that this approach to cone-beam CT of the short object has
significant advantages over the existing cardiac CT methods and the standard
saddle curve oriented systems from perspectives of both engineering
implementation and clinical applications.
Figure 2
Compositing-circling scanning mode. In such a CT system, the scanning trajectory is a
composition of two circular motions: while an X-ray focal spot is rotated on a plane facing a short object to
be reconstructed, the X-ray source is also rotated around the object on the gantry plane. Once a projection
dataset is acquired, exact or approximate reconstruction can be done in a number of ways (Copyright by
Wang G, Yu HY, US Provisional Patent Application, 2007).
3. EXACT RECONSTRUCTION
3.1. Notations
Assume an object function is located at the origin of the natural coordinate system .
For any unit vector ,
let us define a cone-beam projection of from a source point on a composite-circling trajectory by Then, we define a unit vector as the one pointing to from on the composite-circling trajectory As shown in Figure 3, a generalized PI-line can be defined
as the line through a point and across the composite-circling
trajectory at two points and ,
where and are the rotation angles corresponding to these
two points. At the same time, the PI-segment (also referred to as a chord) is
defined as the part of the generalized PI-line between and ,
the PI-arc as the part of the scanning trajectory between and ,
and the PI-interval as .
All the PI-segments form a convex hull of the composite-circling curve
where the exact reconstruction is achievable according to the generalized
backprojection filtration (BPF) approach [15, 16].
Figure 3
Concepts of the PI-Segment (chord) and associated PI-arc.
To perform
the BPF reconstruction from data collected along a composite-circling
trajectory, we define a unit vector along the chord and set up a local coordinate system associated with the
trajectory. Initially, we only consider the circular scanning trajectory of the X-ray tube in the - plane which can
be expressed as For a given ,
we define a local coordinate
system for by three orthogonal unit vectors , , and (see Figure 4). Equispatial cone-beam data
are measured on a planar detector array parallel to and at a distance from with ,
where the constant is the distance between the -axis and the
detector plane. A detector position in the array is denoted by ,
which are signed distances along and , respectively. Let correspond to the orthogonal
projection of onto the detector array. If is given, are determined by .
Thus, the cone-beam projection data along a direction from can be rewritten in the planar detector coordinate system as with Now, let us consider the circular rotation of the focal spot
at the given time .
According to our definition (2), the focal spot rotation plane is parallel to
the local area detector, and the orthogonal projection of the circling focal
spot position in the above-mentioned local area detector is .
Thus, the cone-beam projection data along a direction from can be rewritten in the same local planar detector coordinate system as with
Figure 4
Local coordinate system with the composite-circling scanning trajectory.
3.2. Reconstruction algorithm
In 2002, an exact and efficient helical cone-beam
reconstruction method was developed by Katsevich [17, 18],
which is a breakthrough in the area of helical/spiral cone-beam CT. The
Katsevich formula is in a filtered backprojection (FBP) format using data from
a PI-arc within a slightly enlarged Tam-Danielsson window. By interchanging the order of the Hilbert
filtering and backprojection, Zou and Pan proposed a backprojection filtration
(BPF) formula in the standard helical scanning case [19]. This BPF formula can reconstruct an object
from the data within the Tam-Danielsson window. For important biomedical applications including bolus-chasing CT
angiography [20] and electron-beam
CT/micro-CT [21], our group first
proved the general validity of both the
BPF and FBP formulae in the case of cone-beam scanning along a general smooth trajectory
[15, 16, 22, 23].
Our group also formulated the generalized FBP and BPF algorithms in a unified
framework [23], and applied them in the
cases of generalized n-PI-window [24] and saddle curve scanning [13]. Note that our generalized BPF and FBP
formulae as well as others' results [25] on general cone-beam
reconstruction are valid to any smooth scanning loci, and they can be certainly
applied to the reconstruction problem with the proposed composite-circling trajectory.
Based on our experience with the cone-beam reconstruction from data along a saddle
curve [13], the BPF algorithm is more
computationally efficient than the PI-line-based FBP, and they have similar
noise characteristics. Therefore, here we will use the BPF method and describe
its major steps as follows.
Step 1 (Cone-beam data differentiation)
For every projection, compute the derivative data from the projection data : where The detailed derivations of (10) are in Appendix A.
Step 2 (Weighted backprojection)
For every chord
specified by and and
for every point on the chord, compute the weighted
backprojection data
with
Step 3 (Inverse Hilbert filtering)
For every chord
specified by and ,
perform the inverse Hilbert filtering along the 1D chord direction to reconstruct from .
The filtering formulation is essentially
the same as in our previous papers [13, 16, 24].
Step 4 (Image rebinning)
Rebin the reconstructed image into the natural coordinate system by determining the
chord(s) for each grid point in the natural coordinate system. The rebinning
scheme is the same as what we used for the saddle curve [13]. However, there are some differences in the
method for determining a chord, which will be described in the next subsection.
3.3. Chord determination
For our composite-circling
mode, we assume that .
In this case, the projection of the trajectory in the - plane will be a
convex single curve (Appendix B). Among all the potential composite-circling
trajectories, we now target the case which is similar to the popular saddle curve
setting. That is, we will study how to determine a chord for a fixed point for in this subsection.As shown in Figure 5, to find a chord containing the fixed point in the
convex hull ,
we first consider the
projection curve of the trajectory in the - plane. Due to the convexity of
the projection curve, any line passing a point inside the curve in the -
plane has two and only two intersections with the projection curve. Then, we
consider a special plane .
In this case, there are two intersection points between the plane and
the projection curve. Solving the equation ,
that is, ,
we can obtain one and only one real root for [26], and the
view angles and that correspond to the two intersection
points and .
On the other hand, we consider another special plane .
Solving the equation ,
that is, ,
we have the only real root and the view angles and corresponding to the two intersection points and . Clearly, the above four angles
satisfy .
Now, we consider a chord intersecting
the line parallel to the -axis through the point .
In the - plane, the projection of the line is the point and the projection of passes
through the point . According to the definition of a composite-circling curve, the line intersects at while intersects at .
Recall that we have assumed that is inside the convex hull ,
there will be ,
that is, .
When the starting point of moves from to smoothly, the corresponding end point will change from to smoothly,
and the -coordinate of its intersection with will vary from to continuously. Therefore, there exists at least
one chord that intersects at and satisfies , .
Because the composite-circling trajectory
is closed, we can immediately obtain another chord corresponding to the
PI-interval .
The union of the two intervals yields a scan range. Similarly, we can find and as well as the chord intervals and .
Hence, we can perform reconstruction at least four times for a given point inside the hull of a composite-circling
trajectory. These properties are very similar to that of a saddle curve [12, 13].
Figure 5
Projection of the chord and composite-circling trajectory on the - plane.
Based on
the above discussion, to illustrate the procedure for the chord determination, we
list the following pseudocodes for numerically finding the chord corresponding
to the PI-interval :Note that in S2.1 is the direction
perpendicular to and at the left side of .
Given the fact that implementation details of the above-described BPF method and
chord determination scheme are similar to what we published in our previous papers
[13, 16, 24, 27],
we will not elaborate them further.set , ;set and find so that intersects :compute the unit direction in the - plane (see Figure 5);set , , and ;compute the projection ;if stop, else go to (S2.2) and set if , and set if ;compute of the intersection point between and ;if stop, else go to (S2) and set if and set
.
4. SIMULATION RESULTS
To verify the correctness of the
exact reconstruction method and demonstrate the merits of the
composite-circling scanning mode, we implemented the reconstruction algorithm developed
in Section 3 in MatLab on a PC (2.0 Gagabyte memory, 2.8 GHz CPU), with all the computationally intensive parts coded
in C. A composite-circling trajectory
was made with cm, cm, and , which is consistent with the specifications
of available commercial CT scanners and satisfies the requirements for the
exact reconstruction of a quasi-short object, such as the head and heart. In our simulation, the well-known 3D
Shepp-Logan head phantom [28] was used. The phantom was
contained in a spherical region of radius 10 cm. We also assumed a virtual plane detector and set the distance from the detector array to the -axis () to zero. The detector array contained detector elements with each covering
.
When the X-ray source was moved along a turn of the composite-circling trajectory, 1200 cone-beam projections were equiangularly acquired.Similar to what we did for the
reconstruction in the saddle curve case, 258 starting points were first uniformly selected from the
interval .
From each , 545 chords were made with the end-point
parameter uniformly in the interval .
Furthermore, each chord contained 432 sampling points over a length 28.8 cm. Finally,
the reconstructed images were rebinned into a matrix in the natural
coordinate system. Beside, our method was
also evaluated with noisy datasets. We assumed
that photons were emitted by the X-ray source but only photons arrived at the detector element after
being attenuated in the object, obeying a Poisson distribution. The noise standard deviations in the reconstructed images were about and for and ,
respectively. Figures 6 and 7 illustrate
some typical image slices reconstructed from noise-free and noisy datasets
collected along our composite-circling trajectory, as well as the counterparts
from a saddle curve [13]. While the composite-circling
scanning is easier than a saddle curve in engineering implementation, there is
no evident difference between the images reconstructed from the data collected
along a composite-circling and a saddle curve because of their exactness. We
remark that the stripe artifacts in Figure 6 were introduced by the
interpolation involving phantom edges. This
type of artifacts disappeared when we
used a modified differentiable Shepp-Logan head phantom [29].
Figure 6
Reconstructed slices of the 3D Shepp-Logan phantom in the natural coordinate system with the
display window [1, 1.05]. The top slices were reconstructed from noise-free data collected along the proposed
composite-circling trajectory while the bottom ones were from a saddle curve [13]. The left and right slices
were cut at cm and cm, respectively. The two profiles were plotted along the white lines in each
slice.
Figure fig7
Same as Figure 6 but from noisy data with .
5. DISCUSSIONS AND CONCLUSIONS
To solve the quasi-short object problem,
we have proposed a family of saddle-like scanning trajectories but we have only
numerically evaluated the composite-circling mode with .
This does not mean that the case of the composite-circling mode is the optimal.
We are actively working to investigate the properties of the saddle-like curves,
and optimize the parameters and protocols.Although the generalized BPF method has been developed
for exact image reconstruction from data collected along a composite-circling trajectory,
the method is not efficient because of its shift-variant property. Recently,
Katsevich announced an important progress towards exact and efficient general
cone-beam reconstruction for two classes of scanning loci [30]. The first class
covers smooth and of positive curvature and torsion. The second type covers generalizes
circle-plus curves [31]. Inspired by his finding, we tend to believe that there
exists an exact and efficient algorithm for exact cone-beam composite-circling
reconstruction. We are working hard to
develop such an algorithm.We acknowledge that for cone-beam composite-circling, we would need to rotate an X-ray tube in a
plane facing a short object or have a rotating focal spot in the tube, which is
not a straightforward task. However, the
situation with saddle curve cone-beam scanning is even more difficult, since an
X-ray tube or focal spot must be moved back and forth rapidly along the -axis
for a high longitudinal sampling rate. Given the paramount importance of exact cone-beam cardiac CT and the
continued rapid development of the source and detector technology, our
objective to solve the quasi-short object problem optimally with saddle-like
cone-beam scanning curves is well justified. Even if neither cone-beam saddle curve scanning
nor composite-circling
will be implemented in the near
future, the use of a fixed focal spot in a rotating X-ray tube will be likely modified
or replaced soon with the use of distributed sources. We believe that in the next decade, advances
in distributed and other types of X-ray sources will define a new revolution in
CT, which is the hardware foundation entirely consistent with our ongoing research
on cone-beam saddle-like curve-based reconstruction algorithms. Therefore,
saddle-like curves, including saddle and composite-circling trajectories but
not limited to them, will become increasingly important for cardiac cone-beam
CT research and applications.Regarding the engineering implementation of our composite-scanning mode,
we recognize that the collimation problem must be effectively addressed [14].
Because the X-ray source, detector array, and collimators are mounted on
the same data acquisition system (DAS), we can omit the rotation of the whole DAS.
That is, the focal spot is circularly rotated in the plane parallel to the patient
motion direction, and we need to have a collimation design to reject most of scattered
photons for any focal spot position. During the scan, we can adjust the direction
and position of the detector array and associated collimators to keep the line connecting
the detector array center and the focal spot perpendicular to the detector plane
and make
all the collimators focus on the focal spot all the time. This can be mechanically done,
synchronized by the rotation of the focal spot. In this case, the focal spot rotation
plane and the detector plane are not parallel in general. Other designs for the same
purpose are possible in the same spirit of this invention.
Furthermore, our approach can also be adapted for inverse geometry based
cone-beam CT [14].In conclusion, we have developed a novel composite-circling mode and method for
solving the quasi-short
object problem exactly, which has better mechanical rotation stability and physiological
compatibility than saddle curve scanning.
Our generalized BPF method has been evaluated
that reconstructs images from cone-beam data collected along a composite-circling trajectory for the case .
The simulation results have demonstrated the correctness and merits of the
proposed composite-circling
mode and exact BPF reconstruction algorithm.
Authors: Baodong Liu; James Bennett; Ge Wang; Bruno De Man; Kai Zeng; Zhye Yin; Paul Fitzgerald; Hengyong Yu Journal: Med Phys Date: 2012-05 Impact factor: 4.071