Cone-beam filtered-backprojection algorithm for truncated helical data

Quasi-exact filtered backprojection algorithm for long-object problem in helical cone-beam tomography

Exact reconstruction from axially truncated cone-beam projections acquired with a helical vertex path is a challenging problem for which solutions are currently under investigation by some researchers. This paper deals with a difficult class of this problem called the long-object problem. Its purpose is to reconstruct a central region of interest (ROI) of a long object when the helical path extends only a little bit above and below the ROI. By extending the authors' recent approach based on the triangular decomposition of the Grangeat formula, we derive quasi-exact reconstruction algorithms whose overall structure is of filtered backprojection (FBP) style. Unlike the previous similar approaches to the long-object problem, the proposed FBP algorithms do not require additional two circular scans at the ends of the helical path. Furthermore, the algorithms require a significantly smaller detector area and achieve improved image quality even for a large pitch compared with the approximate Feldkamp algorithms. One drawback of the proposed algorithms is the computational time, which is much longer than for the Feldkamp algorithms. We show some simulation results to demonstrate the performances of the proposed algorithms.

Exact (spiral + circles) scan region-of-interest cone beam reconstruction via backprojection

We present a (spiral + circles) scan cone beam reconstruction algorithm in which image reconstruction proceeds via backprojection in the object space. In principle, the algorithm can reconstruct sectional region-of-interest (ROI) in a long object. The approach is a generalization of the cone beam backprojection technique developed by Kudo and Saito in two aspects: the resource-demanding normalization step in the Kudo and Saito's algorithm is eliminated through the technique of data combination that we published earlier, and the elimination of the restriction that the detector be big enough to capture the entire cone beam projection of the ROI. Restricting the projection data to the appropriate angular range required by data combination can be accomplished by a masking process. Because of the simplification resulting from the elimination of the normalization step, the most time-consuming operations of the algorithm can be approximated by the efficient step of line-by-line ramp filtering the cone beam image in the direction of the scan path, plus a correction image. The correction image, which can be computed exactly, is needed because data combination is not properly matched at the mask boundary when ramp filtering is involved. Empirical two-dimensional (2-D) point spread function (PSF) is developed to improve matching with the correction image which is computed with finite samplings. The use of transition region to further improve matching is introduced. The results of testing the algorithm on simulated phantoms are presented.

Exact radon rebinning algorithm for the long object problem in helical cone-beam CT

This paper addresses the long object problem in helical cone-beam computed tomography. We present the PHI-method, a new algorithm for the exact reconstruction of a region-of-interest (ROI) of a long object from axially truncated data extending only slightly beyond the ROI. The PHI-method is an extension of the Radon-method, published by Kudo, Noo, and Defrise in issue 43 of journal Physics in Medicine and Biology. The key novelty of the PHI-method is the introduction of a virtual object fpsi(x) for each value of the azimuthal angle psi in the image space, with each virtual object having the property of being equal to the true object f(x) in some ROI omegam. We show that, for each psi, one can calculate exact Radon data corresponding to the two-dimensional (2-D) parallel-beam projection of fpsi(x) onto the meridian plane of angle psi. Given an angular range of length pi of such parallel-beam projections, the ROI omegam can be exactly reconstructed because f(x) is identical to fpsi(x) in Omegam. Simulation results are given for both the Radon-method and the PHI-method indicating that 1) for the case of short objects, the Radon- and PHI-methods produce comparable image quality, 2) for the case of long objects, the PHI-method delivers the same image quality as in the short object case, while the Radon-method fails, and 3) the image quality produced by the PHI-method is similar for a large range of pitch values.

A solution to the long-object problem in helical cone-beam tomography

This paper presents a new algorithm for the long-object problem in helical cone-beam (CB) computerized tomography (CT). This problem consists in reconstructing a region-of-interest (ROI) bounded by two given transaxial slices, using axially truncated CB projections corresponding to a helix segment long enough to cover the ROI, but not long enough to cover the whole axial extent of the object. The new algorithm is based on a previously published method, referred to as CB-FBP (Kudo et al 1998 Phys. Med. Biol. 43 2885-909), which is suitable for quasi-exact reconstruction when the helix extends well beyond the support of the object. We first show that the CB-FBP algorithm simplifies dramatically, and furthermore constitutes a solution to the long-object problem, when the object under study has line integrals which vanish along all PI-lines. (A PI line is a line which connects two points of the helix separated by less than one pitch.) Exploiting a geometric property of the helix, we then show how the image can be expressed as the sum of two images, where the first image can be reconstructed from the measured CB projections by a simple backprojection procedure, and the second image has zero PI-line integrals and hence can be reconstructed using the simplified CB-FBP algorithm. The resulting method is a quasi-exact solution to the long-object problem, called the ZB method. We present its implementation and illustrate its performance using simulated CB data of the 3D Shepp phantom and of a more challenging head-like phantom.

3D cone-beam CT reconstruction for circular trajectories

3D reconstruction from 2D projections obtained along a single circular source trajectory is most commonly done using an algorithm due to Feldkamp, Davis and Kress. In this paper we propose an alternative approach based on a cone-beam to parallel-beam rebinning step, a corresponding rebinning step into a rectangular virtual detector plane and a filtered backprojection. This approach yields an improved image quality reflected by a decreased low-intensity drop which is well known for 3D reconstruction from projection data obtained along circular trajectories. At the same time the computational complexity is lower than in Feldkamp's original approach. Based on this idea, a hybrid 3D cone-beam reconstruction method is formulated that enlarges the reconstruction volume in its dimension along the rotation axis of the cone-beam CT system. This enlargement is achieved by applying different reconstruction conditions for each voxel. An optimal ratio between the reconstructible and irradiated volume of the scanned object is achieved.

Single-slice rebinning method for helical cone-beam CT

In this paper, we present reconstruction results from helical cone-beam CT data, obtained using a simple and fast algorithm, which we call the CB-SSRB algorithm. This algorithm combines the single-slice rebinning method of PET imaging with the weighting schemes of spiral CT algorithms. The reconstruction is approximate but can be performed using 2D multislice fan-beam filtered backprojection. The quality of the results is surprisingly good, and far exceeds what one might expect, even when the pitch of the helix is large. In particular, with this algorithm comparable quality is obtained using helical cone-beam data with a normalized pitch of 10 to that obtained using standard spiral CT reconstruction with a normalized pitch of 2.