Image reconstruction on PI-lines by use of filtered backprojection in helical cone-beam CT

Deep-Interior: A new pathway to interior tomographic image reconstruction via a weighted backprojection and deep learning

BACKGROUND

In recent years, deep learning strategies have been combined with either the filtered backprojection or iterative methods or the direct projection-to-image by deep learning only to reconstruct images. Some of these methods can be applied to address the interior reconstruction problems for centered regions of interest (ROIs) with fixed sizes. Developing a method to enable interior tomography with arbitrarily located ROIs with nearly arbitrary ROI sizes inside a scanning field of view (FOV) remains an open question.

PURPOSE

To develop a new pathway to enable interior tomographic reconstruction for arbitrarily located ROIs with arbitrary sizes using a single trained deep neural network model.

METHODS

The method consists of two steps. First, an analytical weighted backprojection reconstruction algorithm was developed to perform domain transform from divergent fan-beam projection data to an intermediate image feature space,B ( x ⃗ ) $B(\vec{x})$ , for an arbitrary size ROI at an arbitrary location inside the FOV. Second, a supervised learning technique was developed to train a deep neural network architecture to perform deconvolution to obtain the true imagef ( x ⃗ ) $f(\vec{x})$ from the new feature spaceB ( x ⃗ ) $B(\vec{x})$ . This two-step method is referred to as Deep-Interior for convenience. Both numerical simulations and experimental studies were performed to validate the proposed Deep-Interior method.

RESULTS

The results showed that ROIs as small as a diameter of 5 cm could be accurately reconstructed (similarity index 0.985 ± 0.018 on internal testing data and 0.940 ± 0.025 on external testing data) at arbitrary locations within an imaging object covering a wide variety of anatomical structures of different body parts. Besides, ROIs of arbitrary size can be reconstructed by stitching small ROIs without additional training.

CONCLUSION

The developed Deep-Interior framework can enable interior tomographic reconstruction from divergent fan-beam projections for short-scan and super-short-scan acquisitions for small ROIs (with a diameter larger than 5 cm) at an arbitrary location inside the scanning FOV with high quantitative reconstruction accuracy.

Differentiated Backprojection Domain Deep Learning for Conebeam Artifact Removal

Conebeam CT using a circular trajectory is quite often used for various applications due to its relative simple geometry. For conebeam geometry, Feldkamp, Davis and Kress algorithm is regarded as the standard reconstruction method, but this algorithm suffers from so-called conebeam artifacts as the cone angle increases. Various model-based iterative reconstruction methods have been developed to reduce the cone-beam artifacts, but these algorithms usually require multiple applications of computational expensive forward and backprojections. In this paper, we develop a novel deep learning approach for accurate conebeam artifact removal. In particular, our deep network, designed on the differentiated backprojection domain, performs a data-driven inversion of an ill-posed deconvolution problem associated with the Hilbert transform. The reconstruction results along the coronal and sagittal directions are then combined using a spectral blending technique to minimize the spectral leakage. Experimental results under various conditions confirmed that our method generalizes well and outperforms the existing iterative methods despite significantly reduced runtime complexity.

One network to solve all ROIs: Deep learning CT for any ROI using differentiated backprojection

PURPOSE

Computed tomography for the reconstruction of region of interest (ROI) has advantages in reducing the x-ray dose and the use of a small detector. However, standard analytic reconstruction methods such as filtered back projection (FBP) suffer from severe cupping artifacts, and existing model-based iterative reconstruction methods require extensive computations. Recently, we proposed a deep neural network to learn the cupping artifacts, but the network was not generalized well for different ROIs due to the singularities in the corrupted images. Therefore, there is an increasing demand for a neural network that works well for any ROI size.

METHOD

Two types of neural networks are designed. The first type learns ROI size-specific cupping artifacts from FBP images, whereas the second type network is for the inversion of the truncated Hilbert transform from the truncated differentiated backprojection (DBP) data. Their generalizabilities for different ROI sizes, pixel sizes, detector pitch and starting angles for a short scan are then investigated.

RESULTS

Experimental results show that the new type of neural networks significantly outperform existing iterative methods for all ROI sizes despite significantly lower runtime complexity. In addition, performance improvement is consistent across different acquisition scenarios.

CONCLUSIONS

Since the proposed method consistently surpasses existing methods, it can be used as a general CT reconstruction engine for many practical applications without compromising possible detector truncation.

Backprojection Filtration Image Reconstruction Approach for Reducing High-Density Object Artifacts in Digital Breast Tomosynthesis

While an accurate image reconstruction of digital breast tomosynthesis (DBT) is fundamentally impossible due to its limited data, the DBT is increasingly used in clinics for its rich image information at a relatively low dose. One of the dominant image artifacts in DBT that hinders a faithful diagnosis is high-density object artifact in conjunction with a limited angle problem. In this paper, we developed a very efficient method for reconstructing DBT images with much reduced high-density object artifacts. The method is based on backprojection filtration reconstruction algorithm, voting strategy, and image blending. Data derivatives were backprojected with appropriate weights to reduce ripple artifacts by use of the voting strategy. We generated another differentiated backprojection volume, where the edges of high-density objects are replaced by the background. After Hilbert transform, we blended the two images to reduce undershoot artifacts. Physical phantoms were scanned and we compared conventional filtered backprojection, filtered backprojection with weighted backprojection, and our proposed method. Ripple artifacts were dramatically suppressed and undershoot artifacts were also greatly suppressed in the proposed method.

Tensor framelet based iterative image reconstruction algorithm for low-dose multislice helical CT

In this study, we investigate the feasibility of improving the imaging quality for low-dose multislice helical computed tomography (CT) via iterative reconstruction with tensor framelet (TF) regularization. TF based algorithm is a high-order generalization of isotropic total variation regularization. It is implemented on a GPU platform for a fast parallel algorithm of X-ray forward band backward projections, with the flying focal spot into account. The solution algorithm for image reconstruction is based on the alternating direction method of multipliers or the so-called split Bregman method. The proposed method is validated using the experimental data from a Siemens SOMATOM Definition 64-slice helical CT scanner, in comparison with FDK, the Katsevich and the total variation (TV) algorithm. To test the algorithm performance with low-dose data, ACR and Rando phantoms were scanned with different dosages and the data was equally undersampled with various factors. The proposed method is robust for the low-dose data with 25% undersampling factor. Quantitative metrics have demonstrated that the proposed algorithm achieves superior results over other existing methods.

Light field reconstruction from projection modeling of focal stack

This paper aims to reconstruct the object-side light field from the focal stack focusing on different imaging planes. In the forward problem, the focal stack was modeled as projections of the light field. Based on projection modeling, both the filtered-backprojection(FBP) method and the Landweber iterative scheme of solving the inverse problem regarding light field reconstruction from focal stack were derived by applying the methods of computerized tomography(CT). The experimental results show that the high-precision light field can be reconstructed via FBP and Simultaneous-Algebraic-Reconstruction-Technique(SART) algorithm, and depth and surface of the scene can be reconstructed via the reconstructed light field.

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.

Half-Fan-Based Intensity-Weighted Region-of-Interest Imaging for Low-Dose Cone-Beam CT in Image-Guided Radiation Therapy

Objectives

With the increased use of computed tomography (CT) in clinics, dose reduction is the most important feature people seek when considering new CT techniques or applications. We developed an intensity-weighted region-of-interest (IWROI) imaging method in an exact half-fan geometry to reduce the imaging radiation dose to patients in cone-beam CT (CBCT) for image-guided radiation therapy (IGRT). While dose reduction is highly desirable, preserving the high-quality images of the ROI is also important for target localization in IGRT.

Methods

An intensity-weighting (IW) filter made of copper was mounted in place of a bowtie filter on the X-ray tube unit of an on-board imager (OBI) system such that the filter can substantially reduce radiation exposure to the outer ROI. In addition to mounting the IW filter, the lead-blade collimation of the OBI was adjusted to produce an exact half-fan scanning geometry for a further reduction of the radiation dose. The chord-based rebinned backprojection-filtration (BPF) algorithm in circular CBCT was implemented for image reconstruction, and a humanoid pelvis phantom was used for the IWROI imaging experiment.

Results

The IWROI image of the phantom was successfully reconstructed after beam-quality correction, and it was registered to the reference image within an acceptable level of tolerance. Dosimetric measurements revealed that the dose is reduced by approximately 61% in the inner ROI and by 73% in the outer ROI compared to the conventional bowtie filter-based half-fan scan.

Conclusions

The IWROI method substantially reduces the imaging radiation dose and provides reconstructed images with an acceptable level of quality for patient setup and target localization. The proposed half-fan-based IWROI imaging technique can add a valuable option to CBCT in IGRT applications.

A promising limited angular computed tomography reconstruction via segmentation based regional enhancement and total variation minimization

X-ray computed tomography (CT) is a powerful and common inspection technique used for the industrial non-destructive testing. However, large-sized and heavily absorbing objects cause the formation of artifacts because of either the lack of specimen penetration in specific directions or the acquisition of data from only a limited angular range of views. Although the sparse optimization-based methods, such as the total variation (TV) minimization method, can suppress artifacts to some extent, reconstructing the images such that they converge to accurate values remains difficult because of the deficiency in continuous angular data and inconsistency in the projections. To address this problem, we use the idea of regional enhancement of the true values and suppression of the illusory artifacts outside the region to develop an efficient iterative algorithm. This algorithm is based on the combination of regional enhancement of the true values and TV minimization for the limited angular reconstruction. In this algorithm, the segmentation approach is introduced to distinguish the regions of different image knowledge and generate the support mask of the image. A new regularization term, which contains the support knowledge to enhance the true values of the image, is incorporated into the objective function. Then, the proposed optimization model is solved by variable splitting and the alternating direction method efficiently. A compensation approach is also designed to extract useful information from the initial projections and thus reduce false segmentation result and correct the segmentation support and the segmented image. The results obtained from comparing both simulation studies and real CT data set reconstructions indicate that the proposed algorithm generates a more accurate image than do the other reconstruction methods. The experimental results show that this algorithm can produce high-quality reconstructed images for the limited angular reconstruction and suppress the illusory artifacts caused by the deficiency in valid data.

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.

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.

L0 constrained sparse reconstruction for multi-slice helical CT reconstruction

In this paper, we present a Bayesian maximum a posteriori method for multi-slice helical CT reconstruction based on an L0-norm prior. It makes use of a very low number of projections. A set of surrogate potential functions is used to successively approximate the L0-norm function while generating the prior and to accelerate the convergence speed. Simulation results show that the proposed method provides high quality reconstructions with highly sparse sampled noise-free projections. In the presence of noise, the reconstruction quality is still significantly better than the reconstructions obtained with L1-norm or L2-norm priors.

Edge-preserving sectional image reconstruction in optical scanning holography

Optical scanning holography (OSH) enables us to capture the three-dimensional information of an object, and a post-processing step known as sectional image reconstruction allows us to view its two-dimensional cross-section. Previous methods often produce reconstructed images that have blurry edges. In this paper, we argue that the hologram's two-dimensional Fourier transform maps into a semi-spherical surface in the three-dimensional frequency domain of the object, a relationship akin to the Fourier diffraction theorem used in diffraction tomography. Thus, the sectional image reconstruction task is an ill-posed inverse problem, and here we make use of the total variation regularization with a nonnegative constraint and solve it with a gradient projection algorithm. Both simulated and experimental holograms are used to verify that edge-preserving reconstruction is achieved, and the axial distance between sections is reduced compared with previous regularization methods.

Filtered region of interest cone-beam rotational angiography

PURPOSE

Cone-beam rotational angiography (CBRA) is widely used in the modern clinical settings. In a number of procedures, the area of interest is often considerably smaller than the field of view (FOV) of the detector, subjecting the patient to potentially unnecessary x-ray dose. The authors therefore propose a filter-based method to reduce the dose in the regions of low interest, while supplying high image quality in the region of interest (ROI).

METHODS

For such procedures, the authors propose a method of filtered region of interest (FROI)-CBRA. In the authors' approach, a gadolinium filter with a circular central opening is placed into the x-ray beam during image acquisition. The central region is imaged with high contrast, while peripheral regions are subjected to a substantial lower intensity and dose through beam filtering. The resulting images contain a high contrast/intensity ROI, as well as a low contrast/intensity peripheral region, and a transition region in between. To equalize the two regions' intensities, the first projection of the acquisition is performed with and without the filter in place. The equalization relationship, based on Beer's law, is established through linear regression using corresponding filtered and nonfiltered data. The transition region is equalized based on radial profiles.

RESULTS

Evaluations in 2D and 3D show no visible difference between conventional FROI-CBRA projection images and reconstructions in the ROI. CNR evaluations show similar image quality in the ROI, with a reduced CNR in the reconstructed peripheral region. In all filtered projection images, the scatter fraction inside the ROI was reduced. Theoretical and experimental dose evaluations show a considerable dose reduction; using a ROI half the original FOV reduces the dose by 60% for the filter thickness of 1.29 mm.

CONCLUSIONS

These results indicate the potential of FROI-CBRA to reduce the dose to the patient while supplying the physician with the desired image detail inside the ROI.

A BPF-FBP tandem algorithm for image reconstruction in reverse helical cone-beam CT

PURPOSE

Reverse helical cone-beam computed tomography (CBCT) is a scanning configuration for potential applications in image-guided radiation therapy in which an accurate anatomic image of the patient is needed for image-guidance procedures. The authors previously developed an algorithm for image reconstruction from nontruncated data of an object that is completely within the reverse helix. The purpose of this work is to develop an image reconstruction approach for reverse helical CBCT of a long object that extends out of the reverse helix and therefore constitutes data truncation.

METHODS

The proposed approach comprises of two reconstruction steps. In the first step, a chord-based backprojection-filtration (BPF) algorithm reconstructs a volumetric image of an object from the original cone-beam data. Because there exists a chordless region in the middle of the reverse helix, the image obtained in the first step contains an unreconstructed central-gap region. In the second step, the gap region is reconstructed by use of a Pack-Noo-formula-based filteredback-projection (FBP) algorithm from the modified cone-beam data obtained by subtracting from the original cone-beam data the reprojection of the image reconstructed in the first step.

RESULTS

The authors have performed numerical studies to validate the proposed approach in image reconstruction from reverse helical cone-beam data. The results confirm that the proposed approach can reconstruct accurate images of a long object without suffering from data-truncation artifacts or cone-angle artifacts.

CONCLUSIONS

They developed and validated a BPF-FBP tandem algorithm to reconstruct images of a long object from reverse helical cone-beam data. The chord-based BPF algorithm was utilized for converting the long-object problem into a short-object problem. The proposed approach is applicable to other scanning configurations such as reduced circular sinusoidal trajectories.

Region of Interest Imaging for a General Trajectory with the Rebinned BPF Algorithm

The back-projection-filtration (BPF) algorithm has been applied to image reconstruction for cone-beam configurations with general source trajectories. The BPF algorithm can reconstruct 3-D region-of-interest (ROI) images from data containing truncations. However, like many other existing algorithms for cone-beam configurations, the BPF algorithm involves a back-projection with a spatially varying weighting factor, which can result in the non-uniform noise levels in reconstructed images and increased computation time. In this work, we propose a BPF algorithm to eliminate the spatially varying weighting factor by using a rebinned geometry for a general scanning trajectory. This proposed BPF algorithm has an improved noise property, while retaining the advantages of the original BPF algorithm such as minimum data requirement.

Region-of-interest image reconstruction with intensity weighting in circular cone-beam CT for image-guided radiation therapy

Imaging plays a vital role in radiation therapy and with recent advances in technology considerable emphasis has been placed on cone-beam CT (CBCT). Attaching a kV x-ray source and a flat panel detector directly to the linear accelerator gantry has enabled progress in target localization techniques, which can include daily CBCT setup scans for some treatments. However, with an increasing number of CT scans there is also an increasing concern for patient exposure. An intensity-weighted region-of-interest (IWROI) technique, which has the potential to greatly reduce CBCT dose, in conjunction with the chord-based backprojection-filtration (BPF) reconstruction algorithm, has been developed and its feasibility in clinical use is demonstrated in this article. A nonuniform filter is placed in the x-ray beam to create regions of two different beam intensities. In this manner, regions outside the target area can be given a reduced dose but still visualized with a lower contrast to noise ratio. Image artifacts due to transverse data truncation, which would have occurred in conventional reconstruction algorithms, are avoided and image noise levels of the low- and high-intensity regions are well controlled by use of the chord-based BPF reconstruction algorithm. The proposed IWROI technique can play an important role in image-guided radiation therapy.

Exact Weighted-FBP Algorithm for Three-Orthogonal-Circular Scanning Reconstruction

Recently, 3D image fusion reconstruction using a FDK algorithm along three-orthogonal circular isocentric orbits has been proposed. On the other hand, we know that 3D image reconstruction based on three-orthogonal circular isocentric orbits is sufficient in the sense of Tuy data sufficiency condition. Therefore the datum obtained from three-orthogonal circular isocentric orbits can derive an exact reconstruction algorithm. In this paper, an exact weighted-FBP algorithm with three-orthogonal circular isocentric orbits is derived by means of Katsevich's equations of filtering lines based on a circle trajectory and a modified weighted form of Tuy's reconstruction scheme.

A filtered backprojection algorithm for triple-source helical cone-beam CT

Multisource cone-beam computed tomography (CT) is an attractive approach of choice for superior temporal resolution, which is critically important for cardiac imaging and contrast enhanced studies. In this paper, we present a filtered-backprojection (FBP) algorithm for triple-source helical cone-beam CT. The algorithm is both exact and efficient. It utilizes data from three inter-helix PI-arcs associated with the inter-helix PI-lines and the minimum detection windows defined for the triple-source configuration. The proof of the formula is based on the geometric relations specific to triple-source helical cone-beam scanning. Simulation results demonstrate the validity of the reconstruction algorithm. This algorithm is also extended to a multisource version for (2N + 1)-source helical cone-beam CT. With parallel computing, the proposed FBP algorithms can be significantly faster than our previously published multisource backprojection-filtration algorithms. Thus, the FBP algorithms are promising in applications of triple-source helical cone-beam CT.

Exact image reconstruction for a circle and line trajectory with a gantry tilt

We investigate image reconstruction with a circle and line trajectory with a tilted gantry. We derive new equations for reconstruction from the line data, such as equations of filtering lines, range of filtering lines and range of the line scan. We analyze the detector requirements and show that the line scan does not impose extra requirements on the cylindrical detector size with our algorithm, that is, the axial truncation of the filtering lines does not occur. We discuss full-scan and short-scan versions of the algorithm. Evaluation of our algorithm uses simulated and real 256-slice data.

Region-of-interest image reconstruction in circular cone-beam microCT

Cone-beam microcomputed tomography (microCT) is one of the most popular choices for small animal imaging which is becoming an important tool for studying animal models with transplanted diseases. Region-of-interest (ROI) imaging techniques in CT, which can reconstruct an ROI image from the projection data set of the ROI, can be used not only for reducing imaging-radiation exposure to the subject and scatters to the detector but also for potentially increasing spatial resolution of the reconstructed images. Increasing spatial resolution in microCT images can facilitate improved accuracy in many assessment tasks. A method proposed previously for increasing CT image spatial resolution entails the exploitation of the geometric magnification in cone-beam CT. Due to finite detector size, however, this method can lead to data truncation for a large geometric magnification. The Feldkamp-Davis-Kress (FDK) algorithm yields images with artifacts when truncated data are used, whereas the recently developed backprojection filtration (BPF) algorithm is capable of reconstructing ROI images without truncation artifacts from truncated cone-beam data. We apply the BPF algorithm to reconstructing ROI images from truncated data of three different objects acquired by our circular cone-beam microCT system. Reconstructed images by use of the FDK and BPF algorithms from both truncated and nontruncated cone-beam data are compared. The results of the experimental studies demonstrate that, from certain truncated data, the BPF algorithm can reconstruct ROI images with quality comparable to that reconstructed from nontruncated data. In contrast, the FDK algorithm yields ROI images with truncation artifacts. Therefore, an implication of the studies is that, when truncated data are acquired with a configuration of a large geometric magnification, the BPF algorithm can be used for effective enhancement of the spatial resolution of a ROI image.

Computerized tomography technique for reconstruction of obstructed phase data in shearography

Shearography is an interferometric method that overcomes several limitations of holography by eliminating the reference beam. It greatly simplifies the optical setup and has much higher tolerance to environmental disturbances. Consequently, the technique has received considerable industrial acceptance, particularly for nondestructive testing. Shearography, however, is generally not applicable to the measurement of an obstructed area, as the area to be measured must be accessible to both illumination and imaging. We present an algorithm based on the principle of tomography that permits the reconstruction of the unavailable phase distribution in an obstructed area from the measured boundary phase distribution. In the process, a set of imaginary rays is projected from many different directions across the area. For each ray, integration of the phase directional derivative along the ray is equal to the phase difference between the boundary points intercepted by the ray. Therefore, a set of linear equations can be established by considering the multiple rays. Each equation expresses the unknown phase derivatives in the obstructed area in terms of the measured boundary phase. Solution of the set of simultaneous equations yields the unknown phase distribution in the blind area. While its applications to shearography are demonstrated, the technique is potentially applicable to all full-field optical measurement techniques such as holography, speckle interferometry, classical interferometry, thermography, moiré, photoelasticity, and speckle correlation techniques.

Even more inversion formulas for the 2D Radon Transform of functions of compact and convex support

In 2004, Clackdoyle and Noo published a class of inversion formulas for the 2D Radon Transform which depends on the known radius of support of the unknown function. In this work, we extend this class of inversion formulas from functions of circular support to functions with any compact and convex support. We point out the potential benefits of these new inversion formulas in the context of reconstruction from truncated projections. A preliminary implementation of these new inversion formulas is also presented.

Motion compensated fan-beam reconstruction for nonrigid transformation

We develop an approximate fan-beam algorithm to reconstruct an object with time-dependent nonrigid transformation such as the heart. The method is in the form of derivative backprojection filtering with compensation of affine transformations on a local basis. Computer simulations showed the proposed method significantly reduces image artifact due to nonrigid motion. Therefore, with very little motion artifact, the proposed method allowed us to reconstruct images from projections over about one motion cycle, resulting in reduced image noise level down to 40% of the current level.

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.

Local cone-beam tomography image reconstruction on chords

We develop reconstruction algorithms for local cone-beam tomography for use with generalized scanning trajectories. The algorithms are grounded theoretically in a recently developed chord-based theory for exact image reconstruction and principles of lambda tomography. Being chord based, they are distinct mathematically and conceptually from conventional local tomography reconstruction algorithms. The salient feature of our algorithms is that they permit reconstruction of discontinuities in the profiles of the object function along chords. By consideration of all possible chords, a 3D image that describes the locations of object discontinuities can be reconstructed. Results from microlocal analysis are applied for understanding the object features that can be reconstructed stably by use of the algorithms. A computer-simulation study is conducted to demonstrate the algorithms and compare their performance with an existing 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.

A cone-beam tomography system with a reduced size planar detector: a backprojection-filtration reconstruction algorithm as well as numerical and practical experiments

In a traditional cone-beam computed tomography (CT) system, the cost of product and computation is very high. In this paper, we develop a transversely truncated cone-beam X-ray CT system with a reduced-size detector positioned off-center, in which X-ray beams only cover half of the object. The existing filtered backprojection (FBP) or backprojection-filtration (BPF) algorithms are not directly applicable in this new system. Hence, we develop a BPF-type direct backprojection algorithm. Different from the traditional rebinning methods, our algorithm directly backprojects the pretreated projection data without rebinning. This makes the algorithm compact and computationally more efficient. Because of avoiding interpolation errors of rebinning process, higher spatial resolution is obtained. Finally, some numerical simulations and practical experiments are done to validate the proposed algorithm and compare with rebinning algorithm.

Approximate and exact cone-beam reconstruction with standard and non-standard spiral scanning

The long object problem is practically important and theoretically challenging. To solve the long object problem, spiral cone-beam CT was first proposed in 1991, and has been extensively studied since then. As a main feature of the next generation medical CT, spiral cone-beam CT has been greatly improved over the past several years, especially in terms of exact image reconstruction methods. Now, it is well established that volumetric images can be exactly and efficiently reconstructed from longitudinally truncated data collected along a rather general scanning trajectory. Here we present an overview of some key results in this area.

Algebraic and analytic reconstruction methods for dynamic tomography

In this work, we discuss algebraic and analytic approaches for dynamic tomography. We present a framework of dynamic tomography for both algebraic and analytic approaches. We finally present numerical experiments.

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.

A BPF-type algorithm for CT with a curved PI detector

Helical cone-beam CT is used widely nowadays because of its rapid scan speed and efficient utilization of x-ray dose. Recently, an exact reconstruction algorithm for helical cone-beam CT was proposed (Zou and Pan 2004a Phys. Med. Biol. 49 941-59). The algorithm is referred to as a backprojection-filtering (BPF) algorithm. This BPF algorithm for a helical cone-beam CT with a flat-panel detector (FPD-HCBCT) requires minimum data within the Tam-Danielsson window and can naturally address the problem of ROI reconstruction from data truncated in both longitudinal and transversal directions. In practical CT systems, detectors are expensive and always take a very important position in the total cost. Hence, we work on an exact reconstruction algorithm for a CT system with a detector of the smallest size, i.e., a curved PI detector fitting the Tam-Danielsson window. The reconstruction algorithm is derived following the framework of the BPF algorithm. Numerical simulations are done to validate our algorithm in this study.

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.

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.

A reconstruction algorithm for helical CT imaging on PI-planes

In this paper, a Feldkamp type approximate reconstruction algorithm is presented for helical cone-beam Computed Tomography. To effectively suppress artifacts due to large cone angle scanning, it is proposed to reconstruct the object point-wisely on unique customized tilted PI-planes which are close to the data collecting helices of the corresponding points. Such a reconstruction scheme can considerably suppress the artifacts in the cone-angle scanning. Computer simulations show that the proposed algorithm can provide improved imaging performance compared with the existing approximate cone-beam reconstruction algorithms.

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.

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.

EnPiT: filtered back-projection algorithm for helical CT using an n-Pi acquisition

In this paper, we formulate a reconstruction algorithm for an n-Pi acquisition, where n can be any positive odd integer. The algorithm is a generalization of the method presented in (Bontus et al. 2003). It is based on the results obtained by Katsevich (2004). For the algorithm, different sets of filter-lines have to be defined. We describe the variation of these lines along the detector in some detail, before we discuss, how the method gives all Radon-plane contributions the correct weighting. The different sets of filter-lines are all contained within the n-Pi window, such that a practical realization is possible. Reconstruction results, which we present in the final section, show convincing image quality.

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.