Marker-based C-arm self-calibration with unknown calibration pattern

BACKGROUND

Accurate tomographic reconstructions require the knowledge of the actual acquisition geometry. Many mobile C-arm CT scanners have poorly reproducible acquisition geometries and thus need acquisition-specific calibration procedures. Most of geometric self-calibration methods based on projection data either need prior information or are limited to the estimation of a low number of geometric calibration parameters. Other self-calibration methods generally use a calibration pattern with known geometry and are hardly implementable in practice for clinical applications.

PURPOSE

We present a three-step marker based self-calibration method which does not require the prior knowledge of the calibration pattern and thus enables the use of calibration patterns with arbitrary markers positions.

METHODS

The first step of the method aims at detecting the set of markers of the calibration pattern in each projection of the CT scan and is performed using the YOLO (You Only Look Once) Convolutional Neural Network. The projected marker trajectories are then estimated by a sequential projection-wise marker association scheme based on the Linear Assignment Problem which uses Kalman filters to predict the markers 2D positions in the projections. The acquisition geometry is finally estimated from the marker trajectories using the Bundle-adjustment algorithm.

RESULTS

The calibration method has been tested on realistic simulated images of the ICRP (International Commission on Radiological Protection) phantom, using calibration patterns with 10 and 20 markers. The backprojection error was used to evaluate the self-calibration method and exhibited sub-millimeter errors. Real images of two human knees with 10 and 30 markers calibration patterns were then used to perform a qualitative evaluation of the method, which showed a remarkable artifacts reduction and bone structures visibility improvement.

CONCLUSIONS

The proposed calibration method gave promising results that pave the way to patient-specific geometric self-calibrations in clinics.

A study of quantitative indicators for slice sorting in cine-mode 4DCT

The uncertainties of four-dimensional computed tomography (4DCT), also called as residual motion artefacts (RMA), induced from irregular respiratory patterns can degrade the quality of overall radiotherapy. This study aims to quantify and reduce those uncertainties. A comparative study on quantitative indicators for RMA was performed, and based on this, we proposed a new 4DCT sorting method that is applicable without disrupting the current clinical workflow. In addition to the default phase sorting strategy, both additional amplitude information from external surrogates and the quantitative metric for RMA, investigated in this study, were introduced. The comparison of quantitative indicators and the performance of the proposed sorting method were evaluated via 10 cases of breath-hold (BH) CT and 30 cases of 4DCT. It was confirmed that N-RMSD (normalised root-mean-square-deviation) was best matched to the visual standards of our institute’s regime, manual sorting method, and could accurately represent RMA. The performance of the proposed method to reduce 4DCT uncertainties was improved by about 18.8% in the averaged value of N-RMSD compared to the default phase sorting method. To the best of our knowledge, this is the first study that evaluates RMA indicators using both BHCT and 4DCT with visual-criteria-based manual sorting and proposes an improved 4DCT sorting strategy based on them.

Data sustained misalignment correction in microscopic cone beam CT via optimization under the Grangeat Epipolar consistency condition

PURPOSE

The misalignment correction in cone beam computed tomography (CBCT), which is usually carried out in an offline manner, is a difficult and tedious process. It becomes even more challenging in microscopic CBCT due to the much higher requirements on spatial resolution. In practice, however, an offline approach for misalignment correction may not be readily implementable, especially in the situations where either time is of the essence or the process needs to be carried out repetitively. Thus, an online self-calibration (i.e., data sustained misalignment correction without the involvement of specific alignment phantom) would be more practical. In this work, we investigate the data sustained misalignment correction in microscopic CBCT via optimization under the Grangeat Epipolar Consistence Condition and evaluate its performance via phantom and specimen studies.

METHODS

With the cost function defined according to the Grangeat Epipolar Consistency Condition (G-ECC) and by minimizing the cost function using the simplex-simulated annealing algorithm (SIMPSA), we evaluate and verify the G-ECC optimization-based online self-calibration method's performance. Performance is measured in sensitivity, robustness, and accuracy using the projection data of phantoms generated by computer simulation and botanical specimens acquired by a prototype microscopic CBCT.

RESULTS

The online data sustained misalignment correction in microscopic CBCT via G-ECC optimization works very well in sensitivity and robustness, in addition to its accuracy of 0.27%, 0.48%, and 0.34% relative errors, respectively, in obtaining the three geometric parameters that are the most critical to image reconstruction in CBCT. Quantitatively, the performance in meeting the requirements on spatial resolution is comparable to, if not better than, that of the offline misalignment correction method, in which a specific alignment phantom has to be used.

CONCLUSIONS

The G-ECC optimization-based online self-calibration approach provides a practical solution (as long as no latitudinal (lateral) data truncation occurs) for misalignment correction in microscopic CBCT, an application that demands high accuracy in geometric alignment for biological (cellular) imaging at super high spatial resolutions in the order of micrometers (2.1 µm).

Comparison of five one-step reconstruction algorithms for spectral CT

Over the last decade, dual-energy CT scanners have gone from prototypes to clinically available machines, and spectral photon counting CT scanners are following. They require a specific reconstruction process, consisting of two steps: material decomposition and tomographic reconstruction. Image-based methods perform reconstruction, then decomposition, while projection-based methods perform decomposition first, and then reconstruction. As an alternative, 'one-step inversion' methods have been proposed, which perform decomposition and reconstruction simultaneously. Unfortunately, one-step methods are typically slower than their two-step counterparts, and in most CT applications, reconstruction time is critical. This paper therefore proposes to compare the convergence speeds of five one-step algorithms. We adapted all these algorithms to solve the same problem: spectral photon-counting CT reconstruction from five energy bins, using a three materials decomposition basis and spatial regularization. The paper compares a Bayesian method which uses non-linear conjugate gradient for minimization (Cai et al 2013 Med. Phys. 40 111916-31), three methods based on quadratic surrogates (Long and Fessler 2014 IEEE Trans. Med. Imaging 33 1614-26, Weidinger et al 2016 Int. J. Biomed. Imaging 2016 1-15, Mechlem et al 2018 IEEE Trans. Med. Imaging 37 68-80), and a primal-dual method based on MOCCA, a modified Chambolle-Pock algorithm (Barber et al 2016 Phys. Med. Biol. 61 3784). Some of these methods have been accelerated by using μ-preconditioning, i.e. by performing all internal computations not with the actual materials the object is made of, but with carefully chosen linear combinations of those. In this paper, we also evaluated the impact of three different μ-preconditioners on convergence speed. Our experiments on simulated data revealed vast differences in the number of iterations required to reach a common image quality objective: Mechlem et al (2018 IEEE Trans. Med. Imaging 37 68-80) needed ten iterations, Cai et al (2013 Med. Phys. 40 111916-31), Long and Fessler (2014 IEEE Trans. Med. Imaging 33 1614-26) and Weidinger et al (2016 Int. J. Biomed. Imaging 2016 1-15) several hundreds, and Barber et al (2016 Phys. Med. Biol. 61 3784) several thousands. We also sum up other practical aspects, like memory footprint and the need to tune extra parameters.

Technical Note: Intrinsic raw data-based CT misalignment correction without redundant data

PURPOSE

CT image reconstruction requires accurate knowledge of the used geometry or image quality might be degraded by misalignment artifacts. To overcome this issue, an intrinsic method, that is, a method not requiring a dedicated calibration phantom, to perform a raw data-based misalignment correction for CT is proposed herein that does not require redundant data and hence is applicable to measurements with less than 180 ∘ plus fan-angle of data.

METHODS

The forward projection of a volume reconstructed from a misaligned geometry resembles the acquired raw data if no redundant data are used, that is, if less than 180 ∘ plus fan-angle are used for image reconstruction. Hence, geometric parameters cannot be deduced from such data by an optimization of the geometry-dependent raw data fidelity. We propose to use a nonlinear transform applied to the reconstructed volume to introduce inconsistencies in the raw data that can be employed to estimate geometric parameters using less than 180 ∘ plus fan-angle of data. The proposed method is evaluated using simulations of the FORBILD head phantom and using actual measurements of a contrast-enhanced scan of a mouse acquired using a micro-CT.

RESULTS

Noisy simulations and actual measurements demonstrate that the proposed method is capable of correcting for artifacts arising from a misaligned geometry without redundant data while ensuring raw data fidelity.

CONCLUSIONS

The proposed method extends intrinsic raw data-based misalignment correction methods to an angular range of 180 ∘ or less and is thus applicable to systems with a limited scan range.