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

Comparison of iterative reconstruction implementations for multislice helical CT

The most mature image reconstruction algorithms in multislice helical computed tomography are based on analytical and iterative methods. Over the past decades, several methods have been developed for iterative reconstructions that improve image quality by reducing noise and artifacts. In the regularization step of iterative reconstruction, noise can be significantly reduced, thereby making low-dose CT. The quality of the reconstructed image can be further improved by using model-based reconstructions. In these reconstructions, the main focus is on modeling the data acquisition process, including the behavior of the photon beams, the geometry of the system, etc. In this article, we propose two model-based reconstruction algorithms using a virtual detector for multislice helical CT. The aim of this study is to compare the effect of using a virtual detector on image quality for the two proposed algorithms with a model-based iterative reconstruction using the original detector model. Since the algorithms are implemented using multiple GPUs, the merging of separately reconstructed volumes can significantly affect image quality. This issue is often referred to as the "long object" problem, for which we also present a solution that plays an important role in the proposed reconstruction processes. The algorithms were evaluated using mathematical and physical phantoms, as well as patient cases. The SSIM, MS-SSIM and L1 metrics were utilized to evaluate the image quality of the mathematical phantom case. To demonstrate the effectiveness of the algorithms, we used the CatPhan 600 phantom. Additionally, anonymized patient scans were used to showcase the improvements in image quality on real scan data.

Accelerated 3D image reconstruction with a morphological pyramid and noise-power convergence criterion

Model-based iterative reconstruction (MBIR) for cone-beam CT (CBCT) offers better noise-resolution tradeoff and image quality than analytical methods for acquisition protocols with low x-ray dose or limited data, but with increased computational burden that poses a drawback to routine application in clinical scenarios. This work develops a comprehensive framework for acceleration of MBIR in the form of penalized weighted least squares optimized with ordered subsets separable quadratic surrogates. The optimization was scheduled on a set of stages forming a morphological pyramid varying in voxel size. Transition between stages was controlled with a convergence criterion based on the deviation between the mid-band noise power spectrum (NPS) measured on a homogeneous region of the evolving reconstruction and that expected for the converged image, computed with an analytical model that used projection data and the reconstruction parameters. A stochastic backprojector was developed by introducing a random perturbation to the sampling position of each voxel for each ray in the reconstruction within a voxel-based backprojector, breaking the deterministic pattern of sampling artifacts when combined with an unmatched Siddon forward projector. This fast, forward and backprojector pair were included into a multi-resolution reconstruction strategy to provide support for objects partially outside of the field of view. Acceleration from ordered subsets was combined with momentum accumulation stabilized with an adaptive technique that automatically resets the accumulated momentum when it diverges noticeably from the current iteration update. The framework was evaluated with CBCT data of a realistic abdomen phantom acquired on an imaging x-ray bench and with clinical CBCT data from an angiography robotic C-arm (Artis Zeego, Siemens Healthineers, Forchheim, Germany) acquired during a liver embolization procedure. Image fidelity was assessed with the structural similarity index (SSIM) computed with a converged reconstruction. The accelerated framework provided accurate reconstructions in 60 s (SSIM = 0.97) and as little as 27 s (SSIM = 0.94) for soft-tissue evaluation. The use of simple forward and backprojectors resulted in 9.3× acceleration. Accumulation of momentum provided extra ∼3.5× acceleration with stable convergence for 6-30 subsets. The NPS-driven morphological pyramid resulted in initial faster convergence, achieving similar SSIM with 1.5× lower runtime than the single-stage optimization. Acceleration of MBIR to provide reconstruction time compatible with clinical applications is feasible via architectures that integrate algorithmic acceleration with approaches to provide stable convergence, and optimization schedules that maximize convergence speed.

Impact of the non-negativity constraint in model-based iterative reconstruction from CT data

PURPOSE

Model-based iterative reconstruction is a promising approach to achieve dose reduction without affecting image quality in diagnostic x-ray computed tomography (CT). In the problem formulation, it is common to enforce non-negative values to accommodate the physical non-negativity of x-ray attenuation. Using this a priori information is believed to be beneficial in terms of image quality and convergence speed. However, enforcing non-negativity imposes limitations on the problem formulation and the choice of optimization algorithm. For these reasons, it is critical to understand the value of the non-negativity constraint. In this work, we present an investigation that sheds light on the impact of this constraint.

METHODS

We primarily focus our investigation on the examination of properties of the converged solution. To avoid any possibly confounding bias, the reconstructions are all performed using a provably converging algorithm started from a zero volume. To keep the computational cost manageable, an axial CT scanning geometry with narrow collimation is employed. The investigation is divided into five experimental studies that challenge the non-negativity constraint in various ways, including noise, beam hardening, parametric choices, truncation, and photon starvation. These studies are complemented by a sixth one that examines the effect of using ordered subsets to obtain a satisfactory approximate result within 50 iterations. All studies are based on real data, which come from three phantom scans and one clinical patient scan. The reconstructions with and without the non-negativity constraint are compared in terms of image similarity and convergence speed. In select cases, the image similarity evaluation is augmented with quantitative image quality metrics such as the noise power spectrum and closeness to a known ground truth.

RESULTS

For cases with moderate inconsistencies in the data, associated with noise and bone-induced beam hardening, our results show that the non-negativity constraint offers little benefit. By varying the regularization parameters in one of the studies, we observed that sufficient edge-preserving regularization tends to dilute the value of the constraint. For cases with strong data inconsistencies, the results are mixed: the constraint can be both beneficial and deleterious; in either case, however, the difference between using the constraint or not is small relative to the overall level of error in the image. The results with ordered subsets are encouraging in that they show similar observations. In terms of convergence speed, we only observed one major effect, in the study with data truncation; this effect favored the use of the constraint, but had no impact on our ability to obtain the converged solution without constraint.

CONCLUSIONS

Our results did not highlight the non-negativity constraint as being strongly beneficial for diagnostic CT imaging. Altogether, we thus conclude that in some imaging scenarios, the non-negativity constraint could be disregarded to simplify the optimization problem or to adopt other forward projection models that require complex optimization machinery to be used together with non-negativity.

Three-Dimensional Weighting in Cone Beam FBP Reconstruction and Its Transformation Over Geometries

GOALS

With substantially increased number of detector rows in multidetector CT (MDCT), axial scan with projection data acquired along a circular source trajectory has become the method-of-choice in increasing clinical applications. Recognizing the practical relevance of image reconstruction directly from the projection data acquired in the native cone beam (CB) geometry, especially in scenarios wherein the most achievable in-plane resolution is desirable, we present a three-dimensional (3-D) weighted CB-FBP algorithm in such geometry in this paper.

METHODS

We start the algorithm's derivation in the cone-parallel geometry. Via changing of variables, taking the Jacobian into account and making heuristic and empirical assumptions, we arrive at the formulas for 3-D weighted image reconstruction in the native CB geometry.

RESULTS

Using the projection data simulated by computer and acquired by an MDCT scanner, we evaluate and verify performance of the proposed algorithm for image reconstruction directly from projection data acquired in the native CB geometry.

CONCLUSION

The preliminary data show that the proposed algorithm performs as well as the 3-D weighted CB-FBP algorithm in the cone-parallel geometry.

SIGNIFICANCE

The proposed algorithm is anticipated to find its utility in extensive clinical and preclinical applications wherein the reconstruction of images in the native CB geometry, i.e., the geometry for data acquisition, is of relevance.

[Influence of projection data correction on digital breast tomosynthesis imaging]

OBJECTIVE

To investigate the effect of detector performance during digital breast tomography (DBT) projection data acquisition on reconstructed image quality.

METHODS

With reference to the traditional detector data correction method and the specific data acquisition pattern in DBT imaging, we utilized dark field correction, light field and its gain correction for processing the projection data collected by the detector. The reconstructed images were evaluated using iterative reconstruction method based on total generalized variation (TGV).

RESULTS

In physical breast phantom experiment, the proposed method resulted in a reduced Heel effect caused by nonuniform photon number. The reconstructed DBT images after correction showed obviously improved image quality especially in the details with a low contrast.

CONCLUSION

The dark field correction, light field and its gain correction process for DBT image reconstruction can improve the image quality.

BPF-type region-of-interest reconstruction for parallel translational computed tomography

The objective of this study is to present and test a new ultra-low-cost linear scan based tomography architecture. Similar to linear tomosynthesis, the source and detector are translated in opposite directions and the data acquisition system targets on a region-of-interest (ROI) to acquire data for image reconstruction. This kind of tomographic architecture was named parallel translational computed tomography (PTCT). In previous studies, filtered backprojection (FBP)-type algorithms were developed to reconstruct images from PTCT. However, the reconstructed ROI images from truncated projections have severe truncation artefact. In order to overcome this limitation, we in this study proposed two backprojection filtering (BPF)-type algorithms named MP-BPF and MZ-BPF to reconstruct ROI images from truncated PTCT data. A weight function is constructed to deal with data redundancy for multi-linear translations modes. Extensive numerical simulations are performed to evaluate the proposed MP-BPF and MZ-BPF algorithms for PTCT in fan-beam geometry. Qualitative and quantitative results demonstrate that the proposed BPF-type algorithms cannot only more accurately reconstruct ROI images from truncated projections but also generate high-quality images for the entire image support in some circumstances.

Reconstruction of 3D Regions-of-Interest from Data in Reduced Helical Cone-beam Scans

The suffciency conditions are derived for exact image reconstruction of a 3D ROI from projections acquired with a reduced helical scan over an angular range considerably smaller than that required by image reconstruction in, e.g., the conventional long object problem, for which the scanned angular range is often more than 2π. ROI reconstruction is investigated by a recently developed filtered-backprojection algorithm that can make use of data acquired with a reduced helical scan. Preliminary numerical studies demonstrate and validate the ROI reconstruction. This work may have significant practical implications because a reduced scan in CT often translates to reduced motion artifacts and reduced radiation dose delivered to the subject.

Sparse sampling in helical cone-beam CT perfect reconstruction algorithms

In the current paper we consider the Helical Cone Beam CT. This scanning method exposes the patient to large quantities of radiation and results in very large amounts of data being collected and stored. Both these facts are prime motivators for the development of an efficient, reduced rate, sampling pattern. We calculate bounds on the support in the frequency domain of the collected data and use these to suggest an efficient sampling pattern. A reduction of up to a factor of 2 in sampling rate is suggested. Indeed, we show that reconstruction quality is not affected by this reduction of sampling rates.

Accelerated statistical reconstruction for C-arm cone-beam CT using Nesterov's method

PURPOSE

To accelerate model-based iterative reconstruction (IR) methods for C-arm cone-beam CT (CBCT), thereby combining the benefits of improved image quality and/or reduced radiation dose with reconstruction times on the order of minutes rather than hours.

METHODS

The ordered-subsets, separable quadratic surrogates (OS-SQS) algorithm for solving the penalized-likelihood (PL) objective was modified to include Nesterov's method, which utilizes "momentum" from image updates of previous iterations to better inform the current iteration and provide significantly faster convergence. Reconstruction performance of an anthropomorphic head phantom was assessed on a benchtop CBCT system, followed by CBCT on a mobile C-arm, which provided typical levels of incomplete data, including lateral truncation. Additionally, a cadaveric torso that presented realistic soft-tissue and bony anatomy was imaged on the C-arm, and different projectors were assessed for reconstruction speed.

RESULTS

Nesterov's method provided equivalent image quality to OS-SQS while reducing the reconstruction time by an order of magnitude (10.0 ×) by reducing the number of iterations required for convergence. The faster projectors were shown to produce similar levels of convergence as more accurate projectors and reduced the reconstruction time by another 5.3 ×. Despite the slower convergence of IR with truncated C-arm CBCT, comparison of PL reconstruction methods implemented on graphics processing units showed that reconstruction time was reduced from 106 min for the conventional OS-SQS method to as little as 2.0 min with Nesterov's method for a volumetric reconstruction of the head. In body imaging, reconstruction of the larger cadaveric torso was reduced from 159 min down to 3.3 min with Nesterov's method.

CONCLUSIONS

The acceleration achieved through Nesterov's method combined with ordered subsets reduced IR times down to a few minutes. This improved compatibility with clinical workflow better enables broader adoption of IR in CBCT-guided procedures, with corresponding benefits in overcoming conventional limits of image quality at lower dose.

Extended ellipse-line-ellipse trajectory for long-object cone-beam imaging with a mounted C-arm system

Recent reports show that three-dimensional cone-beam (CB) imaging with a floor-mounted (or ceiling-mounted) C-arm system has become a valuable tool in interventional radiology. Currently, a circular short scan is used for data acquisition, which inevitably yields CB artifacts and a short coverage in the direction of the patient table. To overcome these two limitations, a more sophisticated data acquisition geometry is needed. This geometry should be complete in terms of Tuy's condition and should allow continuous scanning, while being compatible with the mechanical constraints of mounted C-arm systems. Additionally, the geometry should allow accurate image reconstruction from truncated data. One way to ensure such a feature is to adopt a trajectory that provides full R-line coverage within the field-of-view (FOV). An R-line is any segment of line that connects two points on a source trajectory, and the R-line coverage is the set of points that belong to an R-line. In this work, we propose a novel geometry called the extended ellipse-line-ellipse (ELE) for long-object imaging with a mounted C-arm system. This trajectory is built from modules consisting of two elliptical arcs connected by a line. We demonstrate that the extended ELE can be configured in many ways so that full R-line coverage is guaranteed. Both tight and relaxed parametric settings are presented. All results are supported by extensive mathematical proofs provided in appendices. Our findings make the extended ELE trajectory attractive for axially-extended FOV imaging in interventional radiology.

Axial Cone-Beam Reconstruction by Weighted BPF/DBPF and Orthogonal Butterfly Filtering

GOAL

The backprojection-filtration (BPF) and the derivative backprojection filtered (DBPF) algorithms, in which Hilbert filtering is the common algorithmic feature, are originally derived for exact helical reconstruction from cone-beam (CB) scan data and axial reconstruction from fan beam data, respectively. These two algorithms can be heuristically extended for image reconstruction from axial CB scan data, but induce severe artifacts in images located away from the central plane, determined by the circular source trajectory. We propose an algorithmic solution herein to eliminate the artifacts.

METHODS

The solution is an integration of three-dimensional (3-D) weighted axial CB-BPF/DBPF algorithm with orthogonal butterfly filtering, namely axial CB-BPF/DBPF cascaded with orthogonal butterfly filtering. Using the computer simulated Forbild head and thoracic phantoms that are rigorous in inspecting the reconstruction accuracy, and an anthropomorphic thoracic phantom with projection data acquired by a CT scanner, we evaluate the performance of the proposed algorithm.

RESULTS

Preliminary results show that the orthogonal butterfly filtering can eliminate the severe streak artifacts existing in the images reconstructed by the 3-D weighted axial CB-BPF/DBPF algorithm located at off-central planes.

CONCLUSION

Integrated with orthogonal butterfly filtering, the 3-D weighted CB-BPF/DBPF algorithm can perform at least as well as the 3-D weighted CB-FBP algorithm in image reconstruction from axial CB scan data.

SIGNIFICANCE

The proposed 3-D weighted axial CB-BPF/DBPF cascaded with orthogonal butterfly filtering can be an algorithmic solution for CT imaging in extensive clinical and preclinical applications.

Accelerating ordered subsets image reconstruction for X-ray CT using spatially nonuniform optimization transfer

Statistical image reconstruction algorithms in X-ray computed tomography (CT) provide improved image quality for reduced dose levels but require substantial computation time. Iterative algorithms that converge in few iterations and that are amenable to massive parallelization are favorable in multiprocessor implementations. The separable quadratic surrogate (SQS) algorithm is desirable as it is simple and updates all voxels simultaneously. However, the standard SQS algorithm requires many iterations to converge. This paper proposes an extension of the SQS algorithm that leads to spatially nonuniform updates. The nonuniform (NU) SQS encourages larger step sizes for the voxels that are expected to change more between the current and the final image, accelerating convergence, while the derivation of NU-SQS guarantees monotonic descent. Ordered subsets (OS) algorithms can also accelerate SQS, provided suitable "subset balance" conditions hold. These conditions can fail in 3-D helical cone-beam CT due to incomplete sampling outside the axial region-of-interest (ROI). This paper proposes a modified OS algorithm that is more stable outside the ROI in helical CT. We use CT scans to demonstrate that the proposed NU-OS-SQS algorithm handles the helical geometry better than the conventional OS methods and "converges" in less than half the time of ordinary OS-SQS.

Algorithm for hyperfast cone-beam spiral backprojection

Cone-beam spiral backprojection is computationally highly demanding. At first sight, the backprojection requirements are similar to those of cone-beam backprojection from circular scans such as it is performed in the widely used Feldkamp algorithm. However, there is an additional complication: the illumination of each voxel, i.e. the range of angles the voxel is seen by the X-ray cone is a complex function of the voxel position. The weight function has no analytically closed form and must be numerically determined. Storage of the weights is prohibitive since the amount of memory required equals the number of voxels per spiral rotation times the number of projections a voxel receives contributions and therefore is in the order of 10(9) to 10(11) floating point values for typical spiral scans. We propose a new algorithm that combines the spiral symmetry with the ability of today's 64 bit CPUs to store large amounts of precomputed weights. Using the spiral symmetry in this way allows to exploit data-level parallelism and thereby to achieve a very high level of vectorization. An additional postprocessing step rotates these slices back to normal images. Our new backprojection algorithm achieves up to 24.6 Giga voxel updates per second (GUPS) on our systems that are equipped with two standard Intel X5570 quad core CPUs (Intel Xeon 5500 platform, 2.93 GHz, Intel Corporation). This equals the reconstruction of 410 images per second assuming each slice consists of 512 x 512 pixels, receiving contributions from 512 projections.

High-performance iterative electron tomography reconstruction with long-object compensation using graphics processing units (GPUs)

Iterative reconstruction algorithms pose tremendous computational challenges for 3D Electron Tomography (ET). Similar to X-ray Computed Tomography (CT), graphics processing units (GPUs) offer an affordable platform to meet these demands. In this paper, we outline a CT reconstruction approach for ET that is optimized for the special demands and application setting of ET. It exploits the fact that ET is typically cast as a parallel-beam configuration, which allows the design of an efficient data management scheme, using a holistic sinogram-based representation. Our method produces speedups of about an order of magnitude over a previously proposed GPU-based ET implementation, on similar hardware, and completes an iterative 3D reconstruction of practical problem size within minutes. We also describe a novel GPU-amenable approach that effectively compensates for reconstruction errors resulting from the TEM data acquisition on (long) samples which extend the width of the parallel TEM beam. We show that the vignetting artifacts typically arising at the periphery of non-compensated ET reconstructions are completely eliminated when our method is employed.

Noise properties of chord-image reconstruction

Recently, there has been much progress in algorithm development for image reconstruction in cone-beam computed tomography (CT). Current algorithms, including the chord-based algorithms, now accept minimal data sets for obtaining images on volume regions-of-interest (ROIs) thereby potentially allowing for reduction of X-ray dose in diagnostic CT. As these developments are relatively new, little effort has been directed at investigating the response of the resulting algorithm implementations to physical factors such as data noise. In this paper, we perform an investigation on the noise properties of ROI images reconstructed by using chord-based algorithms for different scanning configurations. We find that, for the cases under study, the chord-based algorithms yield images with comparable quality. Additionally, it is observed that, in many situations, large data sets contain extraneous data that may not reduce the ROI-image variances.

A rebinned backprojection-filtration algorithm for image reconstruction in helical cone-beam CT

In the last few years, mathematically exact algorithms, including the backprojection-filtration (BPF) algorithm, have been developed for accurate image reconstruction in helical cone-beam CT. The BPF algorithm requires minimum data, and can reconstruct region-of-interest (ROI) images from data containing truncations. However, similar to other existing reconstruction algorithms for helical cone-beam CT, the BPF algorithm involves a backprojection with a spatially varying weighting factor, which is computationally demanding and, more importantly, can lead to undesirable numerical properties in reconstructed images. In this work, we develop a rebinned BPF algorithm in which the backprojection invokes no spatially varying weighting factor for accurate image reconstruction from helical cone-beam projections. This rebinned BPF algorithm is computationally more efficient and numerically more stable than the original BPF algorithm, while it also retains the nice properties of the original BPF algorithm such as minimum data requirement and ROI-image reconstruction from truncated data. We have also performed simulation studies to validate and evaluate the rebinned BPF algorithm.

Handling data redundancy in helical cone beam reconstruction with a cone-angle-based window function and its asymptotic approximation

A cone-angle-based window function is defined in this manuscript for image reconstruction using helical cone beam filtered backprojection (CB-FBP) algorithms. Rather than defining the window boundaries in a two-dimensional detector acquiring projection data for computed tomographic imaging, the cone-angle-based window function deals with data redundancy by selecting rays with the smallest cone angle relative to the reconstruction plane. To be computationally efficient, an asymptotic approximation of the cone-angle-based window function is also given and analyzed in this paper. The benefit of using such an asymptotic approximation also includes the avoidance of functional discontinuities that cause artifacts in reconstructed tomographic images. The cone-angle-based window function and its asymptotic approximation provide a way, equivalent to the Tam-Danielsson-window, for helical CB-FBP reconstruction algorithms to deal with data redundancy, regardless of where the helical pitch is constant or dynamically variable during a scan. By taking the cone-parallel geometry as an example, a computer simulation study is conducted to evaluate the proposed window function and its asymptotic approximation for helical CB-FBP reconstruction algorithm to handle data redundancy. The computer simulated Forbild head and thorax phantoms are utilized in the performance evaluation, showing that the proposed cone-angle-based window function and its asymptotic approximation can deal with data redundancy very well in cone beam image reconstruction from projection data acquired along helical source trajectories. Moreover, a numerical study carried out in this paper reveals that the proposed cone-angle-based window function is actually equivalent to the Tam-Danielsson-window, and rigorous mathematical proofs are being investigated.

Chord-based image reconstruction in cone-beam CT with a curved detector

Modern computed tomography (CT) scanners use cone-beam configurations for increasing volume coverage, improving x-ray-tube utilization, and yielding isotropic spatial resolution. Recently, there have been significant developments in theory and algorithms for exact image reconstruction from cone-beam projections. In particular, algorithms have been proposed for image reconstruction on chords; and advantages over the existing algorithms offered by the chord-based algorithms include the high flexibility of exact image reconstruction for general scanning trajectories and the capability of exact reconstruction of images within a region of interest from truncated data. These chord-based algorithms have been developed only for flat-panel detectors. Many cone-beam CT scanners employ curved detectors for important practical considerations. Therefore, in this work, we have derived chord-based algorithms for a curved detector so that they can be applied to reconstructing images directly from data acquired by use of a CT scanner with a curved detector. We have also conducted preliminary numerical studies to demonstrate and evaluate the reconstruction properties of the derived chord-based algorithms for curved detectors.

Tilted cone-beam reconstruction with row-wise fan-to-parallel rebinning

Reconstruction algorithms for cone-beam CT have been the focus of many studies. Several exact and approximate reconstruction algorithms were proposed for step-and-shoot and helical scanning trajectories to combat cone-beam related artefacts. In this paper, we present a new closed-form cone-beam reconstruction formula for tilted gantry data acquisition. Although several algorithms were proposed in the past to combat errors induced by the gantry tilt, none of the algorithms addresses the scenario in which the cone-beam geometry is first rebinned to a set of parallel beams prior to the filtered backprojection. We show that the image quality advantages of the rebinned parallel-beam reconstruction are significant, which makes the development of such an algorithm necessary. Because of the rebinning process, the reconstruction algorithm becomes more complex and the amount of iso-centre adjustment depends not only on the projection and tilt angles, but also on the reconstructed pixel location. In this paper, we first demonstrate the advantages of the row-wise fan-to-parallel rebinning and derive a closed-form solution for the reconstruction algorithm for the step-and-shoot and constant-pitch helical scans. The proposed algorithm requires the 'warping' of the reconstruction matrix on a view-by-view basis prior to the backprojection step. We further extend the algorithm to the variable-pitch helical scans in which the patient table travels at non-constant speeds. The algorithm was tested extensively on both the 16- and 64-slice CT scanners. The efficacy of the algorithm is clearly demonstrated by multiple experiments.

A combination-weighted Feldkamp-based reconstruction algorithm for cone-beam CT

The combination-weighted Feldkamp algorithm (CW-FDK) was developed and tested in a phantom in order to reduce cone-beam artefacts and enhance cranio-caudal reconstruction coverage in an attempt to improve image quality when utilizing cone-beam computed tomography (CBCT). Using a 256-slice cone-beam CT (256CBCT), image quality (CT-number uniformity and geometrical accuracy) was quantitatively evaluated in phantom and clinical studies, and the results were compared to those obtained with the original Feldkamp algorithm. A clinical study was done in lung cancer patients under breath holding and free breathing. Image quality for the original Feldkamp algorithm is degraded at the edge of the scan region due to the missing volume, commensurate with the cranio-caudal distance between the reconstruction and central planes. The CW-FDK extended the reconstruction coverage to equal the scan coverage and improved reconstruction accuracy, unaffected by the cranio-caudal distance. The extended reconstruction coverage with good image quality provided by the CW-FDK will be clinically investigated for improving diagnostic and radiotherapy applications. In addition, this algorithm can also be adapted for use in relatively wide cone-angle CBCT such as with a flat-panel detector CBCT.

View-independent reconstruction algorithms for cone beam CT with general saddle trajectory

In Yang et al (2006 Phys. Med. Biol. 51 1157-72), an exact filtered backprojection (FBP) reconstruction algorithm was proposed for cone beam tomography with saddle trajectory based on the seminal works of Pack and Noo (2005a Inverse Problems 21 1105-20; 2005b 8th Int. Meeting on Fully 3D Reconstruction in Radiology and Nuclear Medicine (Salt Lake City) ed F Noo, H Kudo and L G Zeng pp 287-90). However, the artefacts due to discretization and/or sampling errors in the reconstructed images by this method were still visible, especially when the pitch is large. In this paper, two view-independent (VI) algorithms, which are similar to the FDK-type algorithms (Feldkamp et al 1984 J. Opt. Soc. Am. A 1 612-19), are proposed for planar detector geometry. The first VI algorithm involves two filtered projections and a small additional term (two-dimensional (2D) Radon transform term). One of the filtered projections is obtained by ramp filtering (as in the FDK algorithm for circular trajectory) and the other one is obtained by Hilbert transform. The 2D Radon transform term is just like the term which was first derived by Hu (1996 Scanning 18 572-81) for a circular trajectory. The second VI algorithm involves only one filtered projection term, which is obtained by differentiation followed by Hilbert transform and the 2D Radon transform term. Both algorithms involve only one backprojection step with a weighting factor as in the FDK algorithm. The simulation studies show that the pixel values of the reconstructed images by the VI algorithms are more accurate than those by the original view differencing (VD) algorithm, the streak artefacts are also reduced, and their computational times are comparable to that of the original VD algorithm. We also generalize the concept of saddle trajectory and the corresponding reconstruction algorithm. The generalized algorithm is also theoretically exact, has a shift-invariant FBP structure, and does not depend on the concept of pi-line.

Formulation of four Katsevich algorithms in native geometry

We derive formulations of the four exact helical Katsevich algorithms in the native cylindrical detector geometry, which allow efficient implementation in modern computed tomography scanners with wide cone beam aperture. Also, we discuss some aspects of numerical implementation.

Region of interest reconstruction from truncated data in circular cone-beam CT

The circular scanning trajectory is one of the most widely adopted data-acquisition configurations in computed tomography (CT). The Feldkamp, Davis, Kress (FDK) algorithm and its various modifications have been developed for reconstructing approximately three-dimensional images from circular cone-beam data. When data contain transverse truncations, however, these algorithms may reconstruct images with significant truncation artifacts. It is of practical significance to develop algorithms that can reconstruct region-of-interest (ROI) images from truncated circular cone-beam data that are free of truncation artifacts and that have an accuracy comparable to that obtained from nontruncated cone-beam data. In this work, we have investigated and developed a backprojection-filtration (BPF)-based algorithm for ROI-image reconstruction from circular cone-beam data containing transverse truncations. Furthermore, we have developed a weighted BPF algorithm to exploit "redundant" information in data for improving image quality. In an effort to validate and evaluate the proposed BPF algorithms for circular cone-beam CT, we have performed numerical studies by using both computer-simulation data and experimental data acquired with a radiotherapy cone-beam CT system. Quantitative results in these studies demonstrate that the proposed BPF algorithms for circular cone-beam CT can reconstruct ROI images free of truncation artifacts.

Region-of-interest reconstruction of motion-contaminated data using a weighted backprojection filtration algorithm

The recently developed weighted backprojection filtration (WBPF) algorithm using data redundancy has capabilities that make this algorithm an attractive candidate for reconstructing images from motion-contaminated projection data. First, the WBPF algorithm is capable of reconstructing region-of-interest (ROI) images from reduced-scan fan-beam data, which have less data than the short-scan data required to reconstruct the entire field of view (FOV). Second, this algorithm can reconstruct ROI images from truncated data. Using phantom simulation studies, we demonstrate how these unique capabilities can be exploited to reduce the amount of motion-contaminated data used for reconstruction. In particular, we use examples from cardiac imaging to illustrate how off-center phantom positioning combined with phase-interval ROI reconstruction can result in the suppression of motion artifacts. In terms of temporal resolution, reduced-scan reconstruction with 45% of a full-scan dataset can be used to improve the temporal resolution of a short-scan reconstruction by 25.8% if ungated data are used. For data gated at 66 beats per minute, reduced-scan reconstruction with 45% of a full-scan dataset can be used to improve the temporal resolution of a short-scan reconstruction by 7.9%. As a result of our studies, we believe that the WBPF algorithm demonstrates the potential for reconstructing quality ROI images from motion-contaminated fan-beam data.

Exact BPF and FBP algorithms for nonstandard saddle curves

A hot topic in cone-beam CT research is exact cone-beam reconstruction from a general scanning trajectory. Particularly, a nonstandard saddle curve attracts attention, as this construct allows the continuous periodic scanning of a volume-of-interest (VOI). Here we evaluate two algorithms for reconstruction from data collected along a nonstandard saddle curve, which are in the filtered backprojection (FBP) and backprojection filtration (BPF) formats, respectively. Both the algorithms are implemented in a chord-based coordinate system. Then, a rebinning procedure is utilized to transform the reconstructed results into the natural coordinate system. The simulation results demonstrate that the FBP algorithm produces better image quality than the BPF algorithm, while both the algorithms exhibit similar noise characteristics.

A three-dimensional-weighted cone beam filtered backprojection (CB-FBP) algorithm for image reconstruction in volumetric CT—helical scanning

Based on the structure of the original helical FDK algorithm, a three-dimensional (3D)-weighted cone beam filtered backprojection (CB-FBP) algorithm is proposed for image reconstruction in volumetric CT under helical source trajectory. In addition to its dependence on view and fan angles, the 3D weighting utilizes the cone angle dependency of a ray to improve reconstruction accuracy. The 3D weighting is ray-dependent and the underlying mechanism is to give a favourable weight to the ray with the smaller cone angle out of a pair of conjugate rays but an unfavourable weight to the ray with the larger cone angle out of the conjugate ray pair. The proposed 3D-weighted helical CB-FBP reconstruction algorithm is implemented in the cone-parallel geometry that can improve noise uniformity and image generation speed significantly. Under the cone-parallel geometry, the filtering is naturally carried out along the tangential direction of the helical source trajectory. By exploring the 3D weighting's dependence on cone angle, the proposed helical 3D-weighted CB-FBP reconstruction algorithm can provide significantly improved reconstruction accuracy at moderate cone angle and high helical pitches. The 3D-weighted CB-FBP algorithm is experimentally evaluated by computer-simulated phantoms and phantoms scanned by a diagnostic volumetric CT system with a detector dimension of 64 x 0.625 mm over various helical pitches. The computer simulation study shows that the 3D weighting enables the proposed algorithm to reach reconstruction accuracy comparable to that of exact CB reconstruction algorithms, such as the Katsevich algorithm, under a moderate cone angle (4 degrees) and various helical pitches. Meanwhile, the experimental evaluation using the phantoms scanned by a volumetric CT system shows that the spatial resolution along the z-direction and noise characteristics of the proposed 3D-weighted helical CB-FBP reconstruction algorithm are maintained very well in comparison to the FDK-type algorithms. Moreover, the experimental evaluation by clinical data verifies that the proposed 3D-weighted CB-FBP algorithm for image reconstruction in volumetric CT under helical source trajectory meets the challenges posed by diagnostic applications of volumetric CT imaging.

Parallel Implementation of Katsevich's FBP Algorithm

For spiral cone-beam CT, parallel computing is an effective approach to resolving the problem of heavy computation burden. It is well known that the major computation time is spent in the backprojection step for either filtered-backprojection (FBP) or backprojected-filtration (BPF) algorithms. By the cone-beam cover method [1], the backprojection procedure is driven by cone-beam projections, and every cone-beam projection can be backprojected independently. Basing on this fact, we develop a parallel implementation of Katsevich's FBP algorithm. We do all the numerical experiments on a Linux cluster. In one typical experiment, the sequential reconstruction time is 781.3 seconds, while the parallel reconstruction time is 25.7 seconds with 32 processors.

A differentiable Shepp–Logan phantom and its applications in exact cone-beam CT

Recently, several exact cone-beam reconstruction algorithms, such as the generalized filtered-backprojection (FBP) and backprojection-filtration (BPF) methods, have been developed to solve the long object problem. Although the well-known 3D Shepp-Logan phantom (SLP) is often used to validate these algorithms, it is deficient due to the discontinuity of the SLP. In this paper, we first construct a differentiable polynomial function to approximate the unit rectangular function on [-1, 1]. Then, we use this function to obtain a differentiable ellipsoid phantom, whose x-ray transform is differentiable for any smooth scanning trajectory. Finally, we propose a differentiable Shepp-Logan phantom (DSLP) for numerical simulation of the exact cone-beam CT algorithms. Our numerical simulation shows that the reconstructed DSLP has a better image quality than the reconstructed SLP, and is complementary to the traditional SLP for evaluation of the exact cone-beam CT algorithms.

Theory and algorithms for image reconstruction on chords and within regions of interest

We introduce a formula for image reconstruction on a chord of a general source trajectory. We subsequently develop three algorithms for exact image reconstruction on a chord from data acquired with the general trajectory. Interestingly, two of the developed algorithms can accommodate data containing transverse truncations. The widely used helical trajectory and other trajectories discussed in literature can be interpreted as special cases of the general trajectory, and the developed theory and algorithms are thus directly applicable to reconstructing images exactly from data acquired with these trajectories. For instance, chords on a helical trajectory are equivalent to the n-PI-line segments. In this situation, the proposed algorithms become the algorithms that we proposed previously for image reconstruction on PI-line segments. We have performed preliminary numerical studies, which include the study on image reconstruction on chords of two-circle trajectory, which is nonsmooth, and on n-PI lines of a helical trajectory, which is smooth. Quantitative results of these studies verify and demonstrate the proposed theory and algorithms.

A three-dimensional weighted cone beam filtered backprojection (CB-FBP) algorithm for image reconstruction in volumetric CT under a circular source trajectory

The original FDK algorithm proposed for cone beam (CB) image reconstruction under a circular source trajectory has been extensively employed in medical and industrial imaging applications. With increasing cone angle, CB artefacts in images reconstructed by the original FDK algorithm deteriorate, since the circular trajectory does not satisfy the so-called data sufficiency condition (DSC). A few 'circular plus' trajectories have been proposed in the past to help the original FDK algorithm to reduce CB artefacts by meeting the DSC. However, the circular trajectory has distinct advantages over other scanning trajectories in practical CT imaging, such as head imaging, breast imaging, cardiac, vascular and perfusion applications. In addition to looking into the DSC, another insight into the CB artefacts existing in the original FDK algorithm is the inconsistency between conjugate rays that are 180 degrees apart in view angle (namely conjugate ray inconsistency). The conjugate ray inconsistency is pixel dependent, varying dramatically over pixels within the image plane to be reconstructed. However, the original FDK algorithm treats all conjugate rays equally, resulting in CB artefacts that can be avoided if appropriate weighting strategies are exercised. Along with an experimental evaluation and verification, a three-dimensional (3D) weighted axial cone beam filtered backprojection (CB-FBP) algorithm is proposed in this paper for image reconstruction in volumetric CT under a circular source trajectory. Without extra trajectories supplemental to the circular trajectory, the proposed algorithm applies 3D weighting on projection data before 3D backprojection to reduce conjugate ray inconsistency by suppressing the contribution from one of the conjugate rays with a larger cone angle. Furthermore, the 3D weighting is dependent on the distance between the reconstruction plane and the central plane determined by the circular trajectory. The proposed 3D weighted axial CB-FBP algorithm can be implemented in either the native CB geometry or the so-called cone-parallel geometry. By taking the cone-parallel geometry as an example, the experimental evaluation shows that, up to a moderate cone angle corresponding to a detector dimension of 64 x 0.625 mm, the CB artefacts can be substantially suppressed by the proposed algorithm, while advantages of the original FDK algorithm, such as the filtered backprojection algorithm structure, 1D ramp filtering and data manipulation efficiency, are maintained.

PI-line-based image reconstruction in helical cone-beam computed tomography with a variable pitch

Current applications of helical cone-beam computed tomography (CT) involve primarily a constant pitch where the translating speed of the table and the rotation speed of the source-detector remain constant. However, situations do exist where it may be more desirable to use a helical scan with a variable translating speed of the table, leading a variable pitch. One of such applications could arise in helical cone-beam CT fluoroscopy for the determination of vascular structures through real-time imaging of contrast bolus arrival. Most of the existing reconstruction algorithms have been developed only for helical cone-beam CT with constant pitch, including the backprojection-filtration (BPF) and filtered-backprojection (FBP) algorithms that we proposed previously. It is possible to generalize some of these algorithms to reconstruct images exactly for helical cone-beam CT with a variable pitch. In this work, we generalize our BPF and FBP algorithms to reconstruct images directly from data acquired in helical cone-beam CT with a variable pitch. We have also performed a preliminary numerical study to demonstrate and verify the generalization of the two algorithms. The results of the study confirm that our generalized BPF and FBP algorithms can yield exact reconstruction in helical cone-beam CT with a variable pitch. It should be pointed out that our generalized BPF algorithm is the only algorithm that is capable of reconstructing exactly region-of-interest image from data containing transverse truncations.

Image reconstruction in peripheral and central regions-of-interest and data redundancy

Algorithms have been developed for image reconstruction within a region-of-interest (ROI) from fan-beam data less than that required for reconstructing the entire image. However, these algorithms do not admit truncated data. In this work, we investigate exact ROI-image reconstruction from fan-beam data containing truncations by use of the so-called fan-beam backprojection-filtration (BPF) algorithm. We also generalize the fan-beam BPF algorithm to exploit redundant information inherent in the truncated fan-beam data. Because the parallel-beam scan can be interpreted as a special case of the fan-beam scan, based upon the fan-beam BPF algorithm, we derive a parallel-beam BPF algorithm for exactly reconstructing ROI images from truncated parallel-beam data. Furthermore, we investigate image reconstruction within two types of distinctive ROIs, which are referred to as the peripheral and central ROIs, respectively, from fan-beam data containing truncations and discuss their potential clinical applications. The results can readily be generalized to reconstructing 3D ROI images from data acquired in circular and helical cone-beam scan. They can also be extended to address ROI-image-reconstruction problems in parallel-, fan-, and cone-beam scans with general trajectories. The work not only has significant implications for clinical and animal-imaging applications of CT, but also may find applications in other imaging modalities.

Image reconstruction in regions-of-interest from truncated projections in a reduced fan-beam scan

In a reduced fan-beam scan, the scanned angular range is smaller than that in a short scan (i.e., a half-scan). In this work, we have developed a new algorithm, which is referred to as the backprojection-filtration (BPF) algorithm, for exact image reconstruction within ROIs from reduced-scan data containing truncations. Explicit conditions on data acquisition have also been derived for exact image reconstruction within an ROI. We have performed a preliminary quantitative study whose results demonstrated and verified the proposed fan-beam BPF algorithm and the derived conditions on data acquisition. The proposed BPF algorithm can have significant implications for clinical and animal CT imaging, therapy imaging, electron paramagnetic resonance imaging and other tomographic imaging because it allows for reconstruction from truncated data and for a potentially drastic reduction of radiation dose and/or of imaging time.

Filtered backprojection formula for exact image reconstruction from cone-beam data along a general scanning curve

Recently, Katsevich proved a filtered backprojection formula for exact image reconstruction from cone-beam data along a helical scanning locus, which is an important breakthrough since 1991 when the spiral cone-beam scanning mode was proposed. In this paper, we prove a generalized Katsevich's formula for exact image reconstruction from cone-beam data collected along a rather flexible curve. We will also give a general condition on filtering directions. Based on this condition, we suggest a natural choice of filtering directions, which is more convenient than Katsevich's choice and can be applied to general scanning curves. In the derivation, we use analytical techniques instead of geometric arguments. As a result, we do not need the uniqueness of the PI lines. In fact, our formula can be used to reconstruct images on any chord as long as a scanning curve runs from one endpoint of the chord to the other endpoint. This can be considered as a generalization of Orlov's classical theorem. Specifically, our formula can be applied to (i) nonstandard spirals of variable radii and pitches (with PI- or n-PI-windows), and (ii) saddlelike curves.

Fan-beam and cone-beam image reconstruction via filtering the backprojection image of differentiated projection data

In this paper, a new image reconstruction scheme is presented based on Tuy's cone-beam inversion scheme and its fan-beam counterpart. It is demonstrated that Tuy's inversion scheme may be used to derive a new framework for fanbeam and cone-beam image reconstruction. In this new framework, images are reconstructed via filtering the backprojection image of differentiated projection data. The new framework is mathematically exact and is applicable to a general source trajectory provided the Tuy data sufficiency condition is satisfied. By choosing a piece-wise constant function for one of the components in the factorized weighting function, the filtering kernel is one dimensional, viz. the filtering process is along a straight line. Thus, the derived image reconstruction algorithm is mathematically exact and efficient. In the cone-beam case, the derived reconstruction algorithm is applicable to a large class of source trajectories where the pi-lines or the generalized pi-lines exist. In addition, the new reconstruction scheme survives the super-short scan mode in both the fan-beam and cone-beam cases provided the data are not transversely truncated. Numerical simulations were conducted to validate the new reconstruction scheme for the fan-beam case.

A unified framework for exact cone-beam reconstruction formulas

In this paper, we present concise proofs of several recently developed exact cone-beam reconstruction methods in the Tuy inversion framework, including both filtered-backprojection and backprojection-filtration formulas in the cases of standard spiral, nonstandard spiral, and more general scanning loci. While a similar proof of the Katsevich formula was previously reported, we present a new proof of the Zou and Pan backprojection-filtration formula. Our proof combines both odd and even data extensions so that only the cone-beam transform itself is utilized in the backprojection-filtration inversion. More importantly, our formulation is valid for general smooth scanning curves, in agreement with an earlier paper from our group [Ye, Zhao, Yu, and Wang, Proc. SPIE 5535, 293-300 (Aug. 6 2004)]. As a consequence of that proof, we obtain a new inversion formula, which is in a two-dimensional filtering backprojection format. A possibility for generalization of the Katsevich filtered-backprojection reconstruction method is also discussed from the viewpoint of this framework.

Minimum data image reconstruction algorithms with shift-invariant filtering for helical, cone-beam CT

We derive accurate and efficient reconstruction algorithms for helical, cone-beam CT that employ shift-invariant filtering. Specifically, a new backprojection-filtration algorithm is developed, and a minimum data filtered-backprojection algorithm is derived. These reconstruction algorithms with shift-invariant filtering can accept data with transverse truncation, and hence allow for minimum data image reconstruction.

The frequency split method for helical cone-beam reconstruction

A new approximate method for the utilization of redundant data in helical cone-beam CT is presented. It is based on the observation that the original WEDGE method provides excellent image quality if only little more than 180 degrees data are used for back-projection, and that significant low-frequency artifacts appear if a larger amount of redundant data are used. This degradation is compensated by the frequency split method: The low-frequency part of the image is reconstructed using little more than 180 degrees of data, while the high frequency part is reconstructed using all data. The resulting algorithm shows no cone-beam artifacts in a simulation of a 64-row scanner. It is further shown that the frequency split method hardly degrades the signal-to-noise ratio of the reconstructed images and that it behaves robustly in the presence of motion.

A unified analysis of FBP-based algorithms in helical cone-beam and circular cone- and fan-beam scans

A circular scanning trajectory is and will likely remain a popular choice of trajectory in computed tomography (CT) imaging because it is easy to implement and control. Filtered-backprojection (FBP)-based algorithms have been developed previously for approximate and exact reconstruction of the entire image or a region of interest within the image in circular cone-beam and fan-beam cases. Recently, we have developed a 3D FBP-based algorithm for image reconstruction on PI-line segments in a helical cone-beam scan. In this work, we demonstrated that the 3D FBP-based algorithm indeed provided a rather general formulation for image reconstruction from divergent projections (such as cone-beam and fan-beam projections). On the basis of this formulation we derived new approximate or exact algorithms for image reconstruction in circular cone-beam or fan-beam scans, which can be interpreted as special cases of the helical scan. Existing algorithms corresponding to the derived algorithms were identified. We also performed a preliminary numerical study to verify our theoretical results in each of the cases. The results in the work can readily be generalized to other non-circular trajectories.

Partial volume and aliasing artefacts in helical cone-beam CT

A generalization of the quasi-exact algorithms of Kudo et al (2000 IEEE Trans. Med. Imaging 19 902-21) is developed that allows for data acquisition in a 'practical' frame for clinical diagnostic helical, cone-beam computed tomography (CT). The algorithm is investigated using data that model nonlinear partial volume averaging. This investigation leads to an understanding of aliasing artefacts in helical, cone-beam CT image reconstruction. An ad hoc scheme is proposed to mitigate artefacts due to the nonlinear partial volume and aliasing artefacts.

Impact of polychromatic x-ray sources on helical, cone-beam computed tomography and dual-energy methods

Recently, there has been much work devoted to developing accurate and efficient algorithms for image reconstruction in helical, cone-beam computed tomography (CT). Little attention, however, has been directed to the effect of physical factors on helical, cone-beam CT image reconstruction. This work investigates the effect of polychromatic x-rays on image reconstruction in helical, cone-beam computed tomography. A pre-reconstruction dual-energy technique is developed to reduce beam-hardening artefacts and enhance contrast in soft tissue.

Exact image reconstruction on PI-lines from minimum data in helical cone-beam CT

The development of accurate and efficient algorithms for image reconstruction from helical cone-beam projections remains a subject of active research. In the last few years, a number of quasi-exact and exact algorithms have been developed. Among them, the Katsevich algorithms are of filtered backprojection type and thus possess computational advantages over other existing exact algorithms. In this work, we propose an alternative approach to reconstructing exactly an image from helical cone-beam projections. Based on this approach, we develop an algorithm that requires less data than do the existing quasi-exact and exact algorithms, including the Katsevich algorithms. Our proposed algorithm is also of filtered backprojection type with one-dimensional filtering performed along a PI-line in image space. Therefore, it is (at least) computationally as efficient as the Katsevich algorithms. We have performed a preliminary numerical study to demonstrate and validate the proposed algorithm using computer-simulation data. The implication of the proposed approach and algorithm appears to be significant in that they can naturally address the long object problem as well as the super-short scan problem and, most importantly, in that they provide the opportunity to reconstruct images within any selected region of interest from minimum data, allowing the use of detector with a reduced size, the selection of a minimum number of rotation angles and thus the reduction of radiation dose delivered to the imaged subject.

A filtered backprojection algorithm for cone beam reconstructionusing rotational filtering under helical source trajectory

With the evolution from multi-detector-row CT to cone beam (CB) volumetric CT, maintaining reconstruction accuracy becomes more challenging. To combat the severe artifacts caused by a large cone angle in CB volumetric CT, three-dimensional reconstruction algorithms have to be utilized. In practice, filtered backprojection (FBP) reconstruction algorithms are more desirable due to their computational structure and image generation efficiency. One of the CB-FBP reconstruction algorithms is the well-known FDK algorithm that was originally derived for a circular x-ray source trajectory by heuristically extending its two-dimensional (2-D) counterpart. Later on, a general CB-FBP reconstruction algorithm was derived for noncircular, such as helical, source trajectories. It has been recognized that a filtering operation in the projection data along the tangential direction of a helical x-ray source trajectory can significantly improve the reconstruction accuracy of helical CB volumetric CT. However, the tangential filtering encounters latitudinal data truncation, resulting in degraded noise characteristics or data manipulation inefficiency. A CB-FBP reconstruction algorithm using one-dimensional rotational filtering across detector rows (namely CB-RFBP) is proposed in this paper. Although the proposed CB-RFBP reconstruction algorithm is approximate, it approaches the reconstruction accuracy that can be achieved by exact helical CB-FBP reconstruction algorithms for moderate cone angles. Unlike most exact CB-FBP reconstruction algorithms in which the redundant data are usually discarded, the proposed CB-RFBP reconstruction algorithm make use of all available projection data, resulting in significantly improved noise characteristics and dose efficiency. Moreover, the rotational filtering across detector rows not only survives the so-called long object problem, but also avoids latitudinal data truncation existing in other helical CB-FBP reconstruction algorithm in which a tangential filtering is carried out, providing better noise characteristics, dose efficiency and data manipulation efficiency.

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.