Filtering point spread function in backprojection cone-beam CT and its applications in long object imaging

A local shift-variant Fourier model and experimental validation of circular cone-beam computed tomography artifacts

Large field of view cone-beam computed tomography (CBCT) is being achieved using circular source and detector trajectories. These circular trajectories are known to collect insufficient data for accurate image reconstruction. Although various descriptions of the missing information exist, the manifestation of this lack of data in reconstructed images is generally nonintuitive. One model predicts that the missing information corresponds to a shift-variant cone of missing frequency components. This description implies that artifacts depend on the imaging geometry, as well as the frequency content of the imaged object. In particular, objects with a large proportion of energy distributed over frequency bands that coincide with the missing cone will be most compromised. These predictions were experimentally verified by imaging small, localized objects (acrylic spheres, stacked disks) at varying positions in the object space and observing the frequency spectrums of the reconstructions. Measurements of the internal angle of the missing cone agreed well with theory, indicating a right circular cone for points on the rotation axis, and an oblique, circular cone elsewhere. In the former case, the largest internal angle with respect to the vertical axis corresponds to the (half) cone angle of the CBCT system (typically approximately 5 degrees - 7.5 degrees in IGRT). Object recovery was also found to be strongly dependent on the distribution of the object's frequency spectrum relative to the missing cone, as expected. The observed artifacts were also reproducible via removal of local frequency components, further supporting the theoretical model. Larger objects with differing internal structures (cellular polyurethane, solid acrylic) were also imaged and interpreted with respect to the previous results. Finally, small animal data obtained using a clinical CBCT scanner were observed for evidence of the missing cone. This study provides insight into the influence of incomplete data collection on the appearance of objects imaged in large field of view CBCT.

An approximate short scan helical FDK cone beam algorithm based on nutating curved surfaces satisfying the Tuy's condition

Traditionally, short scan helical FDK algorithms have been implemented based on horizontal transaxial slices. However, not every point on the horizontal transaxial slice satisfies Tuy's condition for the corresponding (pi+fan angle) segment of helix, which means that some points on the horizontal slices are incompletely sampled and are impossible to be exactly reconstructed. In this paper, we propose and implement an improved but still approximate short scan helical cone beam FDK algorithm based on nutating curved surfaces satisfying the Tuy's condition. This surface is defined by averaging PI surfaces emanating the initial and final source points of a (pi+fan angle) segment of helix. One of the key characteristics of the surface is that every point on it satisfies the Tuy's condition for the corresponding (pi+fan angle) segment of helix, which means that we can potentially reconstruct every point on the surface exactly. This difference makes the proposed algorithm deliver a better-reconstructed image quality while requiring a smaller detector area than that of traditional FDK methods based on horizontal transaxial slices. Another characteristic of the proposed surface is that every point within the helix belongs to one and only one such surface. Therefore, the location of the short scan segment for the reconstruction of a point in Cartesian coordinate could be precalculated and stored in a look-up table. This enables us to perform reconstruction directly on rectangular grids. We compare the performance of the improved FDK algorithm with that of a quasi-exact algorithm based on data combination technique. The simulation results show that the reconstructed image quality of these two methods is similar.

General reconstruction theory for multislice X-ray computed tomography with a gantry tilt

This paper discusses image reconstruction with a tilted gantry in multislice computed tomography (CT) with helical (spiral) data acquisition. The reconstruction problem with gantry tilt is shown to be transformable into the problem of reconstructing a virtual object from multislice CT data with no gantry tilt, for which various algorithms exist in the literature. The virtual object is related to the real object by a simple affine transformation that transforms the tilted helical trajectory of the X-ray source into a nontilted helix, and the real object can be computed from the virtual object using one-dimensional interpolation. However, the interpolation may be skipped since the reconstruction of the virtual object on a Cartesian grid provides directly nondistorted images of the real object on slices parallel to the tilted plane of the gantry. The theory is first presented without any specification of the detector geometry, then applied to the curved detector geometry of third-generation CT scanners with the use of Katsevich's formula for example. Results from computer-simulated data of the FORBILD thorax phantom are given in support of the theory.

Spiral scan long object reconstruction through PI line reconstruction

The response of a point object in a cone beam (CB) spiral scan is analysed. Based on the result, a reconstruction algorithm for long object imaging in spiral scan cone beam CT is developed. A region-of-interest (ROI) of the long object is scanned with a detector smaller than the ROI, and a portion of it can be reconstructed without contamination from overlaying materials. The top and bottom surfaces of the ROI are defined by two sets of PI lines near the two ends of the spiral path. With this novel definition of the top and bottom ROI surfaces and through the use of projective geometry, it is straightforward to partition the cone beam image into regions corresponding to projections of the ROI, the overlaying objects or both. This also simplifies computation at source positions near the spiral ends, and makes it possible to reduce radiation exposure near the spiral ends substantially through simple hardware collimation. Simulation results to validate the algorithm are presented.

Investigation of saddle trajectories for cardiac CT imaging in cone-beam geometry

This paper investigates cone-beam tomography for a wide class of x-ray source trajectories called saddles. In particular, a mathematical analysis of the number of intersections between a saddle and an arbitrary plane is given. This analysis demonstrates that axially truncated cone-beam projections acquired along a saddle can be used for exact reconstruction at any point in a large volume. The reconstruction can be achieved either using a new algorithm presented herein or using a formula recently introduced by Katsevich (2003 Int. J. Math. Math. Sci. 21 1305-21). The shape of the reconstructed volume and the properties of saddles make saddles attractive for cardiac imaging. Three examples of saddles are presented with a discussion of implementation on devices similar to modern C-arm systems and multislice CT scanners. Reconstruction with one of these saddles has been tested using computer-simulated data, with and without truncation. The imaged phantom for the truncated data is a FORBILD head phantom (representing the heart) that has been modified and embedded inside the FORBILD thorax phantom. The non-truncated data were generated by excluding the thorax. The reconstructed images demonstrate the accuracy of the mathematical results.

Experiments with the nonlinear and chaotic behaviour of the multiplicative algebraic reconstruction technique (MART) algorithm for computed tomography

Among the iterative reconstruction algorithms for tomography, the multiplicative algebraic reconstruction technique (MART) has two advantages that make it stand out from other algorithms: it confines the image (and therefore the projection data) to the convex hull of the patient, and it maximizes entropy. In this paper, we have undertaken a series of experiments to determine the importance of MART nonlinearity to image quality. Variants of MART were implemented aiming to exploit and exaggerate the nonlinear properties of the algorithm. We introduce the Power MART, Boxcar Averaging MART and Bouncing MART algorithms. Power MART is linked to the relaxation concept. Its behaviour is similar to that of the chaos of a logistic equation. There appears to be an antagonism between increasing nonlinearity and noise in the projection data. The experiments confirm our general observation that regularization as a means of solving simultaneous linear equations that are underdetermined is suboptimal: it does not necessarily select the correct image from the hyperplane of solutions, and so does not maximize the image quality:x-ray dose ratio. Our investigations prove that there is scope to optimize CT algorithms and thereby achieve greater dose reduction.

A simple derivation and analysis of a helical cone beam tomographic algorithm for long object imaging via a novel definition of region of interest

We derive and analyse a simple algorithm first proposed by Kudo et al (2001 Proc. 2001 Meeting on Fully 3D Image Reconstruction in Radiology and Nuclear Medicine (Pacific Grove, CA) pp 7-10) for long object imaging from truncated helical cone beam data via a novel definition of region of interest (ROI). Our approach is based on the theory of short object imaging by Kudo et al (1998 Phys. Med. Biol. 43 2885-909). One of the key findings in their work is that filtering of the truncated projection can be divided into two parts: one, finite in the axial direction, results from ramp filtering the data within the Tam window. The other, infinite in the z direction, results from unbounded filtering of ray sums over PI lines only. We show that for an ROI defined by PI lines emanating from the initial and final source positions on a helical segment, the boundary data which would otherwise contaminate the reconstruction of the ROI can be completely excluded. This novel definition of the ROI leads to a simple algorithm for long object imaging. The overscan of the algorithm is analytically calculated and it is the same as that of the zero boundary method. The reconstructed ROI can be divided into two regions: one is minimally contaminated by the portion outside the ROI, while the other is reconstructed free of contamination. We validate the algorithm with a 3D Shepp-Logan phantom and a disc phantom.

Exact helical reconstruction using native cone-beam geometries

This paper is about helical cone-beam reconstruction using the exact filtered backprojection formula recently suggested by Katsevich (2002a Phys. Med. Biol. 47 2583-97). We investigate how to efficiently and accurately implement Katsevich's formula for direct reconstruction from helical cone-beam data measured in two native geometries. The first geometry is the curved detector geometry of third-generation multi-slice CT scanners, and the second geometry is the flat detector geometry of C-arms systems and of most industrial cone-beam CT scanners. For each of these two geometries, we determine processing steps to be applied to the measured data such that the final outcome is an implementation of the Katsevich formula. These steps are first described using continuous-form equations, disregarding the finite detector resolution and the source position sampling. Next, techniques are presented for implementation of these steps with finite data sampling. The performance of these techniques is illustrated for the curved detector geometry of third-generation CT scanners, with 32, 64 and 128 detector rows. In each case, resolution and noise measurements are given along with reconstructions of the FORBILD thorax phantom.