Analysis of an exact inversion algorithm for spiral cone-beam CT

Stabilizing deep tomographic reconstruction: Part B. Convergence analysis and adversarial attacks

Due to lack of the kernel awareness, some popular deep image reconstruction networks are unstable. To address this problem, here we introduce the bounded relative error norm (BREN) property, which is a special case of the Lipschitz continuity. Then, we perform a convergence study consisting of two parts: (1) a heuristic analysis on the convergence of the analytic compressed iterative deep (ACID) scheme (with the simplification that the CS module achieves a perfect sparsification), and (2) a mathematically denser analysis (with the two approximations: [1] AT is viewed as an inverse A- 1 in the perspective of an iterative reconstruction procedure and [2] a pseudo-inverse is used for a total variation operator H). Also, we present adversarial attack algorithms to perturb the selected reconstruction networks respectively and, more importantly, to attack the ACID workflow as a whole. Finally, we show the numerical convergence of the ACID iteration in terms of the Lipschitz constant and the local stability against noise.

Stabilizing deep tomographic reconstruction: Part A. Hybrid framework and experimental results

A recent PNAS paper reveals that several popular deep reconstruction networks are unstable. Specifically, three kinds of instabilities were reported: (1) strong image artefacts from tiny perturbations, (2) small features missed in a deeply reconstructed image, and (3) decreased imaging performance with increased input data. Here, we propose an analytic compressed iterative deep (ACID) framework to address this challenge. ACID synergizes a deep network trained on big data, kernel awareness from compressed sensing (CS)-inspired processing, and iterative refinement to minimize the data residual relative to real measurement. Our study demonstrates that the ACID reconstruction is accurate, is stable, and sheds light on the converging mechanism of the ACID iteration under a bounded relative error norm assumption. ACID not only stabilizes an unstable deep reconstruction network but also is resilient against adversarial attacks to the whole ACID workflow, being superior to classic sparsity-regularized reconstruction and eliminating the three kinds of instabilities.

Physics-based iterative reconstruction for dual-source and flying focal spot computed tomography

PURPOSE

For single-source helical Computed Tomography (CT), both Filtered-Back Projection (FBP) and statistical iterative reconstruction have been investigated. However, for dual-source CT with flying focal spot (DS-FFS CT), a statistical iterative reconstruction that accurately models the scanner geometry and acquisition physics remains unknown to researchers. Therefore, our purpose is to present a novel physics-based iterative reconstruction method for DS-FFS CT and assess its image quality.

METHODS

Our algorithm uses precise physics models to reconstruct from the native cone-beam geometry and interleaved dual-source helical trajectory of a DS-FFS CT. To do so, we construct a noise physics model to represent data acquisition noise and a prior image model to represent image noise and texture. In addition, we design forward system models to compute the locations of deflected focal spots, the dimension, and sensitivity of voxels and detector units, as well as the length of intersection between x-rays and voxels. The forward system models further represent the coordinated movement between the dual sources by computing their x-ray coverage gaps and overlaps at an arbitrary helical pitch. With the above models, we reconstruct images by an advanced Consensus Equilibrium (CE) numerical method to compute the maximum a posteriori estimate to a joint optimization problem that simultaneously fits all models.

RESULTS

We compared our reconstruction with Siemens ADMIRE, which is the clinical standard hybrid iterative reconstruction (IR) method for DS-FFS CT, in terms of spatial resolution, noise profile, and image artifacts through both phantoms and clinical scan datasets. Experiments show that our reconstruction has a higher spatial resolution, with a Task-Based Modulation Transfer Function (MTF_task ) consistently higher than the clinical standard hybrid IR. In addition, our reconstruction shows a reduced magnitude of image undersampling artifacts than the clinical standard.

CONCLUSIONS

By modeling a precise geometry and avoiding data rebinning or interpolation, our physics-based reconstruction achieves a higher spatial resolution and fewer image artifacts with smaller magnitude than the clinical standard hybrid IR.

Dynamical machine learning volumetric reconstruction of objects' interiors from limited angular views

Limited-angle tomography of an interior volume is a challenging, highly ill-posed problem with practical implications in medical and biological imaging, manufacturing, automation, and environmental and food security. Regularizing priors are necessary to reduce artifacts by improving the condition of such problems. Recently, it was shown that one effective way to learn the priors for strongly scattering yet highly structured 3D objects, e.g. layered and Manhattan, is by a static neural network [Goy et al. Proc. Natl. Acad. Sci. 116, 19848-19856 (2019)]. Here, we present a radically different approach where the collection of raw images from multiple angles is viewed analogously to a dynamical system driven by the object-dependent forward scattering operator. The sequence index in the angle of illumination plays the role of discrete time in the dynamical system analogy. Thus, the imaging problem turns into a problem of nonlinear system identification, which also suggests dynamical learning as a better fit to regularize the reconstructions. We devised a Recurrent Neural Network (RNN) architecture with a novel Separable-Convolution Gated Recurrent Unit (SC-GRU) as the fundamental building block. Through a comprehensive comparison of several quantitative metrics, we show that the dynamic method is suitable for a generic interior-volumetric reconstruction under a limited-angle scheme. We show that this approach accurately reconstructs volume interiors under two conditions: weak scattering, when the Radon transform approximation is applicable and the forward operator well defined; and strong scattering, which is nonlinear with respect to the 3D refractive index distribution and includes uncertainty in the forward operator.

High-energy, high-resolution, fly-scan X-ray phase tomography

High energy X-ray phase contrast tomography is tremendously beneficial to the study of thick and dense materials with poor attenuation contrast. Recently, the X-ray speckle-based imaging technique has attracted widespread interest because multimodal contrast images can now be retrieved simultaneously using an inexpensive wavefront modulator and a less stringent experimental setup. However, it is time-consuming to perform high resolution phase tomography with the conventional step-scan mode because the accumulated time overhead severely limits the speed of data acquisition for each projection. Although phase information can be extracted from a single speckle image, the spatial resolution is deteriorated due to the use of a large correlation window to track the speckle displacement. Here we report a fast data acquisition strategy utilising a fly-scan mode for near field X-ray speckle-based phase tomography. Compared to the existing step-scan scheme, the data acquisition time can be significantly reduced by more than one order of magnitude without compromising spatial resolution. Furthermore, we have extended the proposed speckle-based fly-scan phase tomography into the previously challenging high X-ray energy region (120 keV). This development opens up opportunities for a wide range of applications where exposure time and radiation dose are critical.

An inversion of the conical Radon transform arising in the Compton camera with helical movement

Since the Compton camera was first introduced, various types of conical Radon transforms have been examined. Here, we derive the inversion formula for the conical Radon transform, where the cone of integration moves along a curve in three-dimensional space such as a helix. Along this three-dimensional curve, a detailed inversion formula for helical movement will be treated for Compton imaging in this paper. The inversion formula includes Hilbert transform and Radon transform. For the inversion of Compton imaging with helical movement, it is necessary to invert Hilbert transform with respect to the inner product between the vertex and the central axis of the cone of the Compton camera. However, the inner product function is not monotone. Thus, we should replace the Hilbert transform by the Riemann-Stieltjes integral over a certain monotone function related with the inner product function. We represent the Riemann-Stieltjes integral as a conventional Riemann integral over a countable union of disjoint intervals, whose end points can be computed using the Newton method. For the inversion of Radon transform, three dimensional filtered backprojection is used. For the numerical implementation, we analytically compute the Hilbert transform and Radon transform of the characteristic function of finite balls. Numerical test is given, when the density function is given by a characteristic function of a ball or three overlapping balls.

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.

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.

On the data acquisition, image reconstruction, cone beam artifacts, and their suppression in axial MDCT and CBCT - A review

PURPOSE

In the clinic, computed tomography (CT) has evolved into an essential modality for diagnostic imaging by multidetector row CT (MDCT) and image guided intervention by cone beam CT (CBCT). Recognizing the increasing importance of axial MDCT/CBCT in clinical and preclinical applications, and the existence of CB artifacts in MDCT/CBCT images, we provide a review of CB artifacts' root causes, rendering mechanisms and morphology, and possible solutions for elimination and/or reduction of the artifacts.

METHODS

By examining the null space in Radon and Fourier domain, the root cause of CB artifacts (i.e., data insufficiency) in axial MDCT/CBCT is analytically investigated, followed by a review of the data sufficiency conditions and the "circle +" source trajectories. The rendering mechanisms and morphology of CB artifacts in axial MDCT/CBCT and their special cases (e.g., half/short scan and full scan with latitudinally displaced detector) are then analyzed, followed by a survey of the potential solutions to suppress the artifacts. The phenomenon of imaged zone indention and its variation over FBP, BPF/DBPF, two-pass and iterative CB reconstruction algorithms and/or schemes are discussed in detail.

RESULTS

An interdomain examination of the null space provides an insightful understanding of the root cause of CB artifacts in axial MDCT/CBCT. The decomposition of CB artifacts rendering mechanisms facilitates understanding of the artifacts' behavior under different conditions and the potential solutions to suppress them. An inspection of the imaged zone intention phenomenon provides guidance on the design and implementation of CB image reconstruction algorithms and schemes for CB artifacts suppression in axial MDCT/CBCT.

CONCLUSIONS

With increasing importance of axial MDCT/CBCT in clinical and preclinical applications, this review article can update the community with in-depth information and clarification on the latest progress in dealing with CB artifacts and thus increase clinical/preclinical confidence.

Task-based statistical image reconstruction for high-quality cone-beam CT

Task-based analysis of medical imaging performance underlies many ongoing efforts in the development of new imaging systems. In statistical image reconstruction, regularization is often formulated in terms to encourage smoothness and/or sharpness (e.g. a linear, quadratic, or Huber penalty) but without explicit formulation of the task. We propose an alternative regularization approach in which a spatially varying penalty is determined that maximizes task-based imaging performance at every location in a 3D image. We apply the method to model-based image reconstruction (MBIR-viz., penalized weighted least-squares, PWLS) in cone-beam CT (CBCT) of the head, focusing on the task of detecting a small, low-contrast intracranial hemorrhage (ICH), and we test the performance of the algorithm in the context of a recently developed CBCT prototype for point-of-care imaging of brain injury. Theoretical predictions of local spatial resolution and noise are computed via an optimization by which regularization (specifically, the quadratic penalty strength) is allowed to vary throughout the image to maximize local task-based detectability index ([Formula: see text]). Simulation studies and test-bench experiments were performed using an anthropomorphic head phantom. Three PWLS implementations were tested: conventional (constant) penalty; a certainty-based penalty derived to enforce constant point-spread function, PSF; and the task-based penalty derived to maximize local detectability at each location. Conventional (constant) regularization exhibited a fairly strong degree of spatial variation in [Formula: see text], and the certainty-based method achieved uniform PSF, but each exhibited a reduction in detectability compared to the task-based method, which improved detectability up to ~15%. The improvement was strongest in areas of high attenuation (skull base), where the conventional and certainty-based methods tended to over-smooth the data. The task-driven reconstruction method presents a promising regularization method in MBIR by explicitly incorporating task-based imaging performance as the objective. The results demonstrate improved ICH conspicuity and support the development of high-quality CBCT systems.

Sinogram restoration in computed tomography with an edge-preserving penalty

PURPOSE

With the goal of producing a less computationally intensive alternative to fully iterative penalized-likelihood image reconstruction, our group has explored the use of penalized-likelihood sinogram restoration for transmission tomography. Previously, we have exclusively used a quadratic penalty in our restoration objective function. However, a quadratic penalty does not excel at preserving edges while reducing noise. Here, we derive a restoration update equation for nonquadratic penalties. Additionally, we perform a feasibility study to extend our sinogram restoration method to a helical cone-beam geometry and clinical data.

METHODS

A restoration update equation for nonquadratic penalties is derived using separable parabolic surrogates (SPS). A method for calculating sinogram degradation coefficients for a helical cone-beam geometry is proposed. Using simulated data, sinogram restorations are performed using both a quadratic penalty and the edge-preserving Huber penalty. After sinogram restoration, Fourier-based analytical methods are used to obtain reconstructions, and resolution-noise trade-offs are investigated. For the fan-beam geometry, a comparison is made to image-domain SPS reconstruction using the Huber penalty. The effects of varying object size and contrast are also investigated. For the helical cone-beam geometry, we investigate the effect of helical pitch (axial movement/rotation). Huber-penalty sinogram restoration is performed on 3D clinical data, and the reconstructed images are compared to those generated with no restoration.

RESULTS

We find that by applying the edge-preserving Huber penalty to our sinogram restoration methods, the reconstructed image has a better resolution-noise relationship than an image produced using a quadratic penalty in the sinogram restoration. However, we find that this relatively straightforward approach to edge preservation in the sinogram domain is affected by the physical size of imaged objects in addition to the contrast across the edge. This presents some disadvantages of this method relative to image-domain edge-preserving methods, although the computational burden of the sinogram-domain approach is much lower. For a helical cone-beam geometry, we found applying sinogram restoration in 3D was reasonable and that pitch did not make a significant difference in the general effect of sinogram restoration. The application of Huber-penalty sinogram restoration to clinical data resulted in a reconstruction with less noise while retaining resolution.

CONCLUSIONS

Sinogram restoration with the Huber penalty is able to provide better resolution-noise performance than restoration with a quadratic penalty. Additionally, sinogram restoration with the Huber penalty is feasible for helical cone-beam CT and can be applied to clinical data.

CT Scanning Imaging Method Based on a Spherical Trajectory

In industrial computed tomography (CT), the mismatch between the X-ray energy and the effective thickness makes it difficult to ensure the integrity of projection data using the traditional scanning model, because of the limitations of the object's complex structure. So, we have developed a CT imaging method that is based on a spherical trajectory. Considering an unrestrained trajectory for iterative reconstruction, an iterative algorithm can be used to realise the CT reconstruction of a spherical trajectory for complete projection data only. Also, an inclined circle trajectory is used as an example of a spherical trajectory to illustrate the accuracy and feasibility of this new scanning method. The simulation results indicate that the new method produces superior results for a larger cone-beam angle, a limited angle and tabular objects compared with traditional circle trajectory scanning.

Cone beam computed tomography scanning and diagnosis for dental implants

Cone beam computed tomography (CBCT) has become an important new technology for oral and maxillofacial surgery practitioners. CBCT provides improved office-based diagnostic capability and applications for surgical procedures, such as CT guidance through the use of computer-generated drill guides. A thorough knowledge of the basic science of CBCT as well as the ability to interpret the images correctly and thoroughly is essential to current practice.

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.

Interesting detector shapes for third generation CT scanners

PURPOSE

To discuss options in designing detector shapes in third generation CT and to quantify potential cost savings for compact third generation CT systems, and to extend the work from two-dimensional fan-beam CT to three-dimensional cone-beam CT for circular, sequential, and spiral scan trajectories.

METHODS

Third generation CT scanners typically comprise detectors which are flat or whose shape is the segment of a cylinder or a sphere that is focused onto the focal spot of the x-ray source. There appear to be two design criteria that favor this choice of detector shape. One is the possibility of performing fan-beam and cone-beam filtered backprojection in the native geometry (without rebinning) and the other criterion could be to enable the early use of focused antiscatter grids. It is less known, however, that other detector shapes may also have these properties. While these designs have been evaluated for 2D CT from a theoretical standpoint more than one decade ago the authors revisit and generalize these considerations, extend them to 3D circular, sequential, and spiral cone-beam CT and propose an optimal design in terms of detector costs while keeping image quality constant. Their considerations and conclusions are based on considering the sampling density of the x-rays, including the effects of finite focal spot and finite detector element size. Proposing image reconstruction algorithms or numerically evaluating the results by reconstructing simulated projection data is not within the scope of this work.

RESULTS

If the detector arc is curved to be nearly concentric with the circle describing the edge of the field of measurement significantly less detector area and detector pixels are required compared to today's third generation CT systems where the detector arc is centered about the focal spot. Combined with a detector that just covers the spiral Tam window cost savings of 60% or more are possible in compact CT systems. In terms of practicability the new designs appear to be nearly as easy to realize as today's third generation systems.

CONCLUSIONS

Compact CT systems, which require the focal spot to be mounted close to the edge of the field of measurement, may significantly benefit from using detector shapes other than the typical equiangular detector that is focused onto the focal spot.

The meaning of interior tomography

The classic imaging geometry for computed tomography is for the collection of un-truncated projections and the reconstruction of a global image, with the Fourier transform as the theoretical foundation that is intrinsically non-local. Recently, interior tomography research has led to theoretically exact relationships between localities in the projection and image spaces and practically promising reconstruction algorithms. Initially, interior tomography was developed for x-ray computed tomography. Then, it was elevated to have the status of a general imaging principle. Finally, a novel framework known as 'omni-tomography' is being developed for a grand fusion of multiple imaging modalities, allowing tomographic synchrony of diversified features.

Modelling the physics in the iterative reconstruction for transmission computed tomography

There is an increasing interest in iterative reconstruction (IR) as a key tool to improve quality and increase applicability of x-ray CT imaging. IR has the ability to significantly reduce patient dose; it provides the flexibility to reconstruct images from arbitrary x-ray system geometries and allows one to include detailed models of photon transport and detection physics to accurately correct for a wide variety of image degrading effects. This paper reviews discretization issues and modelling of finite spatial resolution, Compton scatter in the scanned object, data noise and the energy spectrum. The widespread implementation of IR with a highly accurate model-based correction, however, still requires significant effort. In addition, new hardware will provide new opportunities and challenges to improve CT with new modelling.

Modelling the physics in the iterative reconstruction for transmission computed tomography

There is an increasing interest in iterative reconstruction (IR) as a key tool to improve quality and increase applicability of x-ray CT imaging. IR has the ability to significantly reduce patient dose; it provides the flexibility to reconstruct images from arbitrary x-ray system geometries and allows one to include detailed models of photon transport and detection physics to accurately correct for a wide variety of image degrading effects. This paper reviews discretization issues and modelling of finite spatial resolution, Compton scatter in the scanned object, data noise and the energy spectrum. The widespread implementation of IR with a highly accurate model-based correction, however, still requires significant effort. In addition, new hardware will provide new opportunities and challenges to improve CT with new modelling.

A general framework and review of scatter correction methods in x-ray cone-beam computerized tomography. Part 1: Scatter compensation approaches

Since scattered radiation in cone-beam volume CT implies severe degradation of CT images by quantification errors, artifacts, and noise increase, scatter suppression is one of the main issues related to image quality in CBCT imaging. The aim of this review is to structurize the variety of scatter suppression methods, to analyze the common structure, and to develop a general framework for scatter correction procedures. In general, scatter suppression combines hardware techniques of scatter rejection and software methods of scatter correction. The authors emphasize that scatter correction procedures consist of the main components scatter estimation (by measurement or mathematical modeling) and scatter compensation (deterministic or statistical methods). The framework comprises most scatter correction approaches and its validity also goes beyond transmission CT. Before the advent of cone-beam CT, a lot of papers on scatter correction approaches in x-ray radiography, mammography, emission tomography, and in Megavolt CT had been published. The opportunity to avail from research in those other fields of medical imaging has not yet been sufficiently exploited. Therefore additional references are included when ever it seems pertinent. Scatter estimation and scatter compensation are typically intertwined in iterative procedures. It makes sense to recognize iterative approaches in the light of the concept of self-consistency. The importance of incorporating scatter compensation approaches into a statistical framework for noise minimization has to be underscored. Signal and noise propagation analysis is presented. A main result is the preservation of differential-signal-to-noise-ratio (dSNR) in CT projection data by ideal scatter correction. The objective of scatter compensation methods is the restoration of quantitative accuracy and a balance between low-contrast restoration and noise reduction. In a synopsis section, the different deterministic and statistical methods are discussed with respect to their properties and applications. The current paper is focused on scatter compensation algorithms. The multitude of scatter estimation models will be dealt with in a separate paper.

Cone-Beam CT with a Flat-Panel Detector: From Image Science to Image-Guided Surgery

The development of large-area flat-panel x-ray detectors (FPDs) has spurred investigation in a spectrum of advanced medical imaging applications, including tomosynthesis and cone-beam CT (CBCT). Recent research has extended image quality metrics and theoretical models to such applications, providing a quantitative foundation for the assessment of imaging performance as well as a general framework for the design, optimization, and translation of such technologies to new applications. For example, cascaded systems models of Fourier domain metrics, such as noise-equivalent quanta (NEQ), have been extended to these modalities to describe the propagation of signal and noise through the image acquisition and reconstruction chain and to quantify the factors that govern spatial resolution, image noise, and detectability. Moreover, such models have demonstrated basic agreement with human observer performance for a broad range of imaging conditions and imaging tasks. These developments in image science have formed a foundation for the knowledgeable development and translation of CBCT to new applications in image-guided interventions - for example, CBCT implemented on a mobile surgical C-arm for intraoperative 3D imaging. The ability to acquire high-quality 3D images on demand during surgical intervention overcomes conventional limitations of surgical guidance in the context of preoperative images alone. A prototype mobile C-arm developed in academic-industry partnership demonstrates CBCT with low radiation dose, sub-mm spatial resolution, and soft-tissue visibility potentially approaching that of diagnostic CT. Integration of the 3D imaging system with real-time tracking, deformable registration, endoscopic video, and 3D visualization offers a promising addition to the surgical arsenal in interventions ranging from head-and-neck / skull base surgery to spine, orthopaedic, thoracic, and abdominal surgeries. Cadaver studies show the potential for significant boosts in surgical performance under CBCT guidance, and early clinical trials demonstrate feasibility, workflow, and image quality within the surgical theatre.

A note on computing the derivative at a constant direction

The derivative at constant direction is frequently used in inversion of cone-beam data. Several algorithms for computing the derivative have been proposed in the literature. The best algorithm to date has been proposed recently by Noo et al (2007 Phys. Med. Biol. 52 5393-414). In this note we propose a new, simple and efficient formula for computing the derivative. Numerical experiments with helical CT show that our formula and the one of Noo et al provide fairly similar spatial resolution and noise stability, even though the new formula is more efficient and easier to implement.

Will medical visualisation tools meet medical user requirements in the future?

This paper describes state-of-the-art medical visualisation and discusses the need for a research agenda that focuses on the development of the next generation of medical acquisition and visualisation tools, emphasising the fact that these tools must be based on medical user requirement and workflow studies as well as on new technical developments.

Filtered Backprojection Reconstruction with Depth-Dependent Filtering

A direct filtered-backprojection (FBP) reconstruction algorithm is presented for circular cone-beam computed tomography (CB-CT) that allows the filter operation to be applied efficiently with shift-variant band-pass characteristics on the kernel function. Our algorithm is derived from the ramp-filter based FBP method of Feldkamp et al. and obtained by decomposing the ramp filtering into a convolution involving the Hilbert kernel (global operation) and a subsequent differentiation operation (local operation). The differentiation is implemented as a finite difference of two (Hilbert filtered) data samples and carried out as part of the backprojection step. The spacing between the two samples, which defines the low-pass characteristics of the filter operation, can thus be selected individually for each point in the image volume. We here define the sample spacing to follow the magnification of the divergent-beam geometry and thus obtain a novel, depth-dependent filtering algorithm for circular CB-CT. We evaluate this resulting algorithm using computer-simulated CB data and demonstrate that our algorithm yields results where spatial resolution and image noise are distributed much more uniformly over the field-of-view, compared to Feldkamp's approach.

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.

Exact Efficient Handling of Interrupted Illumination in Helical Cone-Beam Computed Tomography with Arbitrary Pitch

We present a theoretically-exact and stable computed tomography (CT) reconstruction algorithm that is capable of handling interrupted illumination and therefore of using all measured data at arbitrary pitch. This algorithm is based on a differentiated backprojection (DBP) on M-lines. First, we discuss the problem of interrupted illumination and how it affects the DBP. Then we show that it is possible to take advantage of some properties of the DBP to compensate for the effects of interrupted illumination in a mathematically exact way. From there, we have developed an efficient algorithm which we have successfully implemented. We show encouraging preliminary results using both computer-simulated data and real data. Our results show that our method is capable of achieving a substantial reduction of image noise when decreasing the helix pitch compared with the maximum pitch case. We conclude that the proposed algorithm defines for the first time a theoretically-exact and stable reconstruction method that is capable of beneficially using all measured data at arbitrary pitch.

3D analytic cone-beam reconstruction for multiaxial CT acquisitions

A conventional 3rd generation Computed Tomography (CT) system with a single circular source trajectory is limited in terms of longitudinal scan coverage since extending the scan coverage beyond 40 mm results in significant cone-beam artifacts. A multiaxial CT acquisition is achieved by combining multiple sequential 3rd generation axial scans or by performing a single axial multisource CT scan with multiple longitudinally offset sources. Data from multiple axial scans or multiple sources provide complementary information. For full-scan acquisitions, we present a window-based 3D analytic cone-beam reconstruction algorithm by tessellating data from neighboring axial datasets. We also show that multi-axial CT acquisition can extend the axial scan coverage while minimizing cone-beam artifacts. For half-scan acquisitions, one cannot take advantage of conjugate rays. We propose a cone-angle dependent weighting approach to combine multi-axial half-scan data. We compute the relative contribution from each axial dataset to each voxel based on the X-ray beam collimation, the respective cone-angles, and the spacing between the axial scans. We present numerical experiments to demonstrate that the proposed techniques successfully reduce cone-beam artifacts at very large volumetric coverage.

Accurate helical cone-beam CT reconstruction with redundant data

We present a new image reconstruction algorithm for helical cone-beam computed tomography (CT). This algorithm is designed for data collected at or near maximum pitch, and provides a theoretically exact and stable reconstruction while beneficially using all measured data. The main operations involved are a differentiated backprojection and a finite-support Hilbert transform inversion. These operations are applied onto M-lines, and the beneficial use of all measured data is gained from averaging three volumes reconstructed each with a different choice of M-lines. The technique is overall similar to that presented by one of the authors in a previous publication, but operates volume-wise, instead of voxel-wise, which yields a significantly more efficient reconstruction procedure. The algorithm is presented in detail. Also, preliminary results from computer-simulated data are provided to demonstrate the numerical stability of the algorithm, the beneficial use of redundant data and the ability to process data collected with an angular flying focal spot.

Optimized reconstruction algorithm for helical CT with fractional pitch between 1PI and 3PI

We propose an approximate approach to use redundant data outside the 1PI window within the exact Katsevich reconstruction framework. The proposed algorithm allows a flexible selection of the helical pitch, which is useful for clinical applications. Our idea is an extension of the one proposed by KOhler, Bontus, and Koken (2006). It is based on optimizing the contribution weights of convolution families used in exact Katsevich 3PI algorithms, so that the total weight of each Radon plane is as close to 1 as possible. Optimization is based on solving a least squares problem subject to linear constrains. Numerical evaluation shows good noise and artifact reduction properties of the proposed algorithm.

Cone-beam technique for 64-MDCT of lung: image quality comparison with stepwise (step-and-shoot) technique

OBJECTIVE

The purpose of this study was to use phantom and patient data acquired with 64-MDCT to compare the image quality and characteristics of helical high-resolution CT images obtained with cone-beam reconstruction with those of stepwise high-resolution CT images obtained with fan-beam reconstruction.

SUBJECTS AND METHODS

We reconstructed helical high-resolution CT images with cone-beam technique and stepwise high-resolution CT images with fan-beam technique. In the phantom study, we measured high-contrast spatial resolution and image noise using a phantom. Streak artifact was evaluated by five radiologists using the phantom. In the clinical phase of the study, two radiologists independently evaluated high-resolution helical and stepwise CT images of the lung fields of 30 patients with diffuse lung disease. Using a 3-point ordinal scale, the radiologists assessed the sharpness of peripheral vessels and interlobular fissures, artifacts, and graininess in the lung fields; overall image quality; and the sharpness of the contour of the left ventricle.

RESULTS

In high-contrast spatial resolution, the contrast curves in each spatial frequency were similar on the helical and stepwise images. In the clinical study, there was no statistically significant difference between helical and stepwise images with respect to sharpness of the contour of the left ventricle, peripheral vessels, or interlobular fissures (p>0.05). With respect to streak artifacts and graininess in the lung fields, helical images received a significantly higher quality grade than did stepwise images (p<0.05).

CONCLUSION

Our phantom and clinical evaluation showed that the quality of high-resolution CT images of the lung obtained with helical scanning was comparable with the quality of stepwise scans.

Reconstruction from uniformly attenuated SPECT projection data using the DBH method

An algorithm was developed for the 2-D reconstruction of truncated and nontruncated uniformly attenuated data acquired from single photon emission computed tomography (SPECT). The algorithm is able to reconstruct data from half-scan (180 ( degrees ) ) and short-scan (180 ( degrees ) +fan angle) acquisitions for parallel- and fan-beam geometries, respectively, as well as data from full-scan (360 ( degrees )) acquisitions. The algorithm is a derivative, backprojection, and Hilbert transform (DBH) method, which involves the backprojection of differentiated projection data followed by an inversion of the finite weighted Hilbert transform. The kernel of the inverse weighted Hilbert transform is solved numerically using matrix inversion. Numerical simulations confirm that the DBH method provides accurate reconstructions from half-scan and short-scan data, even when there is truncation. However, as the attenuation increases, finer data sampling is required.

A three-dimensional statistical approach to improved image quality for multislice helical CT

Multislice helical computed tomography scanning offers the advantages of faster acquisition and wide organ coverage for routine clinical diagnostic purposes. However, image reconstruction is faced with the challenges of three-dimensional cone-beam geometry, data completeness issues, and low dosage. Of all available reconstruction methods, statistical iterative reconstruction (IR) techniques appear particularly promising since they provide the flexibility of accurate physical noise modeling and geometric system description. In this paper, we present the application of Bayesian iterative algorithms to real 3D multislice helical data to demonstrate significant image quality improvement over conventional techniques. We also introduce a novel prior distribution designed to provide flexibility in its parameters to fine-tune image quality. Specifically, enhanced image resolution and lower noise have been achieved, concurrently with the reduction of helical cone-beam artifacts, as demonstrated by phantom studies. Clinical results also illustrate the capabilities of the algorithm on real patient data. Although computational load remains a significant challenge for practical development, superior image quality combined with advancements in computing technology make IR techniques a legitimate candidate for future clinical applications.

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.

3D weighting in cone beam image reconstruction algorithms: ray-driven vs. pixel-driven

A 3D weighting scheme have been proposed previously to reconstruct images at both helical and axial scans in stat-of-the-art volumetric CT scanners for diagnostic imaging. Such a 3D weighting can be implemented in the manner of either ray-driven or pixel-drive, depending on the available computation resources. An experimental study is conducted in this paper to evaluate the difference between the ray-driven and pixel-driven implementations of the 3D weighting from the perspective of image quality, while their computational complexity is analyzed theoretically. Computer simulated data and several phantoms, such as the helical body phantom and humanoid chest phantom, are employed in the experimental study, showing that both the ray-driven and pixel-driven 3D weighting provides superior image quality for diagnostic imaging in clinical applications. With the availability of image reconstruction engine at increasing computational power, it is believed that the pixel-driven 3D weighting will be dominantly employed in state-of-the-art volumetric CT scanners over clinical applications.

Computing reconstruction kernels for circular 3-D cone beam tomography

In this paper, we present techniques for deriving inversion algorithms in 3-D computer tomography. To this end, we introduce the mathematical model and apply a general strategy, the so-called approximate inverse, for deriving both exact and numerical inversion formulas. Using further approximations, we derive a 2-D shift-invariant filter for circular-orbit cone-beam imaging. Results from real data are presented.

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 new scheme for view-dependent data differentiation in fan-beam and cone-beam computed tomography

In computed tomography, analytical fan-beam (FB) and cone-beam (CB) image reconstruction often involves a view-dependent data differentiation. The implementation of this differentiation step is critical in terms of resolution and image quality. In this work, we present a new differentiation scheme that is robust to changes in the data acquisition geometry and to coarse view sampling. Our scheme was compared to two previously suggested methods, which we call the direct scheme and the chain-rule scheme. Image reconstructions were performed from computer-simulated data of the Shepp-Logan phantom, the FORBILD thorax phantom and a modified FORBILD head phantom. For FB reconstruction, we investigated three acquisition geometries: a circular, an ellipse-shaped and a square-shaped trajectory. For CB reconstruction, the circle-plus-line trajectory was considered. Image comparison showed that the new scheme performs consistently well when varying the scenario, in both FB and CB geometry, unlike the other two schemes.

Fan-beam filtered-backprojection reconstruction without backprojection weight

In this paper, we address the problem of two-dimensional image reconstruction from fan-beam data acquired along a full 2pi scan. Conventional approaches that follow the filtered-backprojection (FBP) structure require a weighted backprojection with the weight depending on the point to be reconstructed and also on the source position; this weight appears only in the case of divergent beam geometries. Compared to reconstruction from parallel-beam data, the backprojection weight implies an increase in computational effort and is also thought to have some negative impacts on noise properties of the reconstructed images. We demonstrate here that direct FBP reconstruction from full-scan fan-beam data is possible with no backprojection weight. Using computer-simulated, realistic fan-beam data, we compared our novel FBP formula with no backprojection weight to the use of an FBP formula based on equal weighting of all data. Comparisons in terms of signal-to-noise ratio, spatial resolution and computational efficiency are presented. These studies show that the formula we suggest yields images with a reduced noise level, at almost identical spatial resolution. This effect increases quickly with the distance from the center of the field of view, from 0% at the center to 20% less noise at 20 cm, and to 40% less noise at 25 cm. Furthermore, the suggested method is computationally less demanding and reduces computation time with a gain that was found to vary between 12% and 43% on the computers used for evaluation.

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.

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.

Evaluation of the spatial resolution characteristics of a cone-beam breast CT scanner

The purpose of this study was to examine the spatial resolution of a prototype pendant-geometry cone-beam breast computed tomography (CT) system. Modulation transfer functions (MTFs) of the reconstructed image in the coronal (x and y) plane were computed as a function of the cone angle, the radial distance from the axis of rotation, the size of the reconstruction matrix, the back-projection filter used, and the number of projections acquired for the reconstruction. The results show that the cone angle and size of the reconstruction matrix have minimal impact on the MTF, while the MTF degraded radially from the axis of rotation (from 0.76 at 2.6 mm from axis of rotation down to 0.37 at 76.9 mm from axis of rotation at f=0.5 mm(-1)). The Ramp reconstruction filter increases the MTF near the axis of rotation relative to the Shepp-Logan filter, while an increase in the number of projections from 500 to 1000 increased the MTF near the periphery of the reconstructed image. The MTF in the z direction (anterior-posterior direction) was also evaluated. The z-direction MTF values tend to be higher when compared to the coronal MTF (0.85 at f =0.5 mm(-1)), and tend to be very constant throughout the coronal plane direction. The results suggest that an increase in the MTF for the prototype breast CT system is possible by optimizing various scanning and reconstruction parameters.