Search

Computed tomography (CT) has been developed as a nondestructive technique for observing minute internal images in samples. It has been difficult to obtain photorealistic (clean or clear) CT images due to various unwanted artifacts generated during the CT scanning process, along with the limitations of back-projection algorithms. Recently, an iterative optimization algorithm has been developed that uses an entire sinogram to reduce errors caused by artifacts. In this paper, we introduce a new quantum algorithm for reconstructing CT images. This algorithm can be used with any type of light source as long as the projection is defined. Assuming an experimental sinogram produced by a Radon transform, to find the CT image of this sinogram, we express the CT image as a combination of qubits. After acquiring the Radon transform of the undetermined CT image, we combine the actual sinogram and the optimized qubits. The global energy optimization value used here can determine the value of qubits through a gate model quantum computer or quantum annealer. In particular, the new algorithm can also be used for cone-beam CT image reconstruction and for medical imaging. [ABSTRACT FROM AUTHOR]

Background: Iterative reconstruction for cone-beam computed tomography (CBCT) has been applied to improve image quality and reduce radiation dose. In a case where an object's actual projection is larger than a flat panel detector, CBCT images contain truncated data or incomplete projections, which degrade image quality inside the field of view (FOV). In this work, we propose truncation effect reduction for fast iterative reconstruction in CBCT imaging. Methods: The volume matrix size of the FOV and the height of projection images were extrapolated to a suitable size. These extended projections were reconstructed by fast iterative reconstruction. Moreover, a smoothing parameter for noise regularization in iterative reconstruction was modified to reduce the accumulated error while processing. The proposed work was evaluated by image quality measurements and compared with conventional filtered backprojection (FBP). To validate the proposed method, we used a head phantom for evaluation and preliminarily tested on a human dataset. Results: In the experimental results, the reconstructed images from the head phantom showed enhanced image quality. In addition, fast iterative reconstruction can be run continuously while maintaining a consistent mean-percentage-error value for many iterations. The contrast-to-noise ratio of the soft-tissue images was improved. Visualization of low contrast in the ventricle and soft-tissue images was much improved compared to those from FBP using the same dose index of 5 mGy. Conclusions: Our proposed method showed satisfactory performance to reduce the truncation effect, especially inside the FOV with better image quality for soft-tissue imaging. The convergence of fast iterative reconstruction tends to be stable for many iterations. [ABSTRACT FROM AUTHOR]

Iodine contrast agent is widely used in liver cancer radiotherapy at CT simulation stage to enhance detectability of tumor. However, its application in cone beam CT (CBCT) for image guidance before treatment delivery is still limited because of poor image quality and excessive dose of contrast agent during multiple treatment fractions. We previously developed a multienergy element-resolved (MEER) CBCT framework that included x-ray projection data acquisition on a conventional CBCT platform in a kVp-switching model and a dictionary-based image reconstruction algorithm that simultaneously reconstructed x-ray attenuation images at each kilovoltage peak (kVp), an electron density image, and elemental composition images. In this study, we investigated feasibility using MEER-CBCT for low-concentration iodine contrast agent visualization. We performed simulation and experimental studies using a phantom with inserts containing water and different concentrations of iodine solution and the MEER-CBCT scan with 600 projections in a full gantry rotation, in which the kVp level sequentially changed among 80, 100, and 120 kVps. We included iodine material in the dictionary of the reconstruction algorithm. We analyzed iodine detectability as quantified by contrast-to-noise ratio (CNR) and compared results with those of CBCT images reconstructed by the standard filter back projection (FBP) method with 600 projections. MEER-CBCT achieved similar contrast enhancement as FBP method but significantly higher CNR. At 2.5% iodine solution concentration, FBP method achieved 170 HU enhancement and CNR of 2.0, considered the standard CNR for successful tumor visualization. MEER-CBCT achieved the same CNR but at ~6.3 times lower iodine concentration of 0.4%. [ABSTRACT FROM AUTHOR]

Data truncation is a common problem in computed tomography (CT). Truncation causes cupping artifacts inside the field-of-view (FOV) and anatomical structures missing outside the FOV. Deep learning has achieved impressive results in CT reconstruction from limited data. However, its robustness is still a concern for clinical applications. Although the image quality of learning-based compensation schemes may be inadequate for clinical diagnosis, they can provide prior information for more accurate extrapolation than conventional heuristic extrapolation methods. With extrapolated projection, a conventional image reconstruction algorithm can be applied to obtain a final reconstruction. In this work, a general plug-and-play (PnP) method for truncation correction is proposed based on this idea, where various deep learning methods and conventional reconstruction algorithms can be plugged in. Such a PnP method integrates data consistency for measured data and learned prior image information for truncated data. This shows to have better robustness and interpretability than deep learning only. To demonstrate the efficacy of the proposed PnP method, two state-of-the-art deep learning methods, FBPConvNet and Pix2pixGAN, are investigated for truncation correction in cone-beam CT in noise-free and noisy cases. Their robustness is evaluated by showing false negative and false positive lesion cases. With our proposed PnP method, false lesion structures are corrected for both deep learning methods. For FBPConvNet, the root-mean-square error (RMSE) inside the FOV can be improved from 92HU to around 30HU by PnP in the noisy case. Pix2pixGAN solely achieves better image quality than FBPConvNet solely for truncation correction in general. PnP further improves the RMSE inside the FOV from 42HU to around 27HU for Pix2pixGAN. The efficacy of PnP is also demonstrated on real clinical head data. [ABSTRACT FROM AUTHOR]

CT scan by use of a beam-filter placed between the x-ray source and the patient allows a single-scan low-dose dual-energy imaging with a minimal hardware modification to the existing CT systems. We have earlier demonstrated the feasibility of such imaging method with a multi-slit beam-filter reciprocating along the direction perpendicular to the CT rotation axis in a cone-beam CT system. However, such method would face mechanical challenges when the beam-filter is supposed to cooperate with a fast-rotating gantry in a diagnostic CT system. In this work, we propose a new scanning method and associated image reconstruction algorithm that can overcome these challenges. We propose to slide a beam-filter that has multi-slit structure with its slits being at a slanted angle with the CT gantry rotation axis during a scan. A streaky pattern would show up in the sinogram domain as a result. Using a notch filter in the Fourier domain of the sinogram, we removed the streaks and reconstructed an image by use of the filtered-backprojection algorithm. The remaining image artifacts were suppressed by applying ${l}_{{0}}$ norm based smoothing. Using this image as a prior, we have reconstructed low- and high-energy CT images in the iterative reconstruction framework. An image-based material decomposition then followed. We conducted a simulation study to test its feasibility using the XCAT phantom and also an experimental study using the Catphan phantom, a head phantom, an iodine-solution phantom, and a monkey in anesthesia, and showed its successful performance in image reconstruction and in material decomposition. [ABSTRACT FROM AUTHOR]

The recent application of Fourier Based Iterative Reconstruction Method (FIRM) has made it possible to achieve high-quality 2D images from a fan beam Computed Tomography (CT) scan with a limited number of projections in a fast manner. The proposed methodology in this article is designed to provide 3D Radon space in linogram fashion to facilitate the use of FIRM with cone beam projections (CBP) for the reconstruction of 3D images in a sparse view angles Cone Beam CT (CBCT). For this reason, in the first phase, the 3D Radon space is generated using CBP data after discretization and optimization of the famous Grangeat’s formula. The method used in this process involves fast Pseudo Polar Fourier transform (PPFT) based on 2D and 3D Discrete Radon Transformation (DRT) algorithms with no wraparound effects. In the second phase, we describe reconstruction of the objects with available Radon values, using direct inverse of 3D PPFT. The method presented in this section eliminates noises caused by interpolation from polar to Cartesian space and exhibits no thorn, V-shaped and wrinkle artifacts. This method reduces the complexity to O(n3 log n) for images of size $ {{\mathrm {n}}\times {\mathrm {n}} \times {\mathrm {n}}}$. The Cone to Radon conversion (Cone2Radon) Toolbox in the first phase and MATLAB/Python toolbox in the second phase were tested on three digital phantoms and experiments demonstrate fast and accurate cone beam image reconstruction due to proposed modifications in all three stages of Grangeat’s method. [ABSTRACT FROM AUTHOR]

A single-scan dual-energy low-dose cone-beam CT (CBCT) imaging technique that exploits a multi-slit filter is proposed in this paper. The multi-slit filter installed between the x-ray source and the scanned object is reciprocated during a scan. The x-ray beams through the slits would generate relatively low-energy x-ray projection data, while the filtered beams would make high-energy projection data. An iterative image reconstruction algorithm that uses an adaptive-steepest-descent method to minimize image total-variation under the constraint of data fidelity was applied to reconstructing the image from the low-energy projection data. Since the high-energy projection data suffer from a substantially high noise level due to the beam filtration, we have developed a new algorithm that exploits the joint sparsity between the low- and high-energy CT images for image reconstruction of the high-energy CT image. The proposed image reconstruction algorithm uses a gradient magnitude image (GMI) of the low-energy CT image by regularizing the difference of GMIs of the low- and high-energy CT images to be minimized. The feasibility of the proposed technique has been demonstrated by the use of various phantoms in the experimental CBCT setup. Furthermore, based on the proposed dual-energy imaging, a material differentiation was performed and its potential utility has been shown. The proposed imaging technique produced promising results for its potential application to a low-dose single-scan dual-energy CBCT. [ABSTRACT FROM PUBLISHER]

This paper presents the architecture of a software platform implemented in C++, for the purpose of testing and evaluation of reconstruction algorithms in X-ray imaging. The fundamental elements of the platform are classes, tightened together in a logical hierarchy. Real world objects as an X-ray source or a at detector can be defined and implemented as instances of corresponding classes. Various operations (e.g. 3D transformations, loading, saving, filtering of images, creation of planar or curved objects of various dimensions) have been incorporated in the software tool as class methods, as well. The user can easily set up any arrangement of the imaging chain objects in 3D space and experiment with many different trajectories and configurations. Selected 3D volume reconstructions using simulated data acquired in specific scanning trajectories are used as a demonstration of the tool. The platform is considered as a basic tool for future investigations of new reconstruction methods in combination with various scanning configurations. [ABSTRACT FROM AUTHOR]

Among many of the image reconstruction techniques; the Feldkamp-Davis-Kress (FDK) is considered the most practical algorithm that used in clinical cone-beam Computed Tomography (CT) technology. In this paper, we present a full memory-aware management optimization scheme to reconstruct high-resolution volumes for a large number of X-Ray images as projections based on an efficient GPU acceleration technique. The proposed optimization technique is a scheme for FDK acceleration, that sheds new light on 4 new strategies: (1) Overcome limited device memory by evaluating different four configurations to migrate input and output data in the CPU/GPU system, (2) Reduce data transfer time during the FDK execution by using a Unified Memory (UM) model with data prefetching feature during reconstruction for data migration between host and device, (3) Accelerate the bottleneck algorithm back-projection as a result of computation mitigation, and (4) Optimize projection data layout that led to better device memory access and overcomes memory latency problem before processing and computing on GPU. The experimental results based on the proposed method show that it took 21.17 sec and 101.76 sec to reconstruct high-resolution 1024 3 , 2048 3 - voxel volume from 1800 projection of 1024 2 and 2048 2 -pixel respectively. The performance resulted from our optimization technique considered on-the-fly reconstruction (real-time), which means it can process 85 projections per second for high-resolution volumes from a large number of projections to achieve accuracy and resolution for reconstructed volume. In the term of speedup, the proposed method can achieve 1.72 speedup to reconstruct the low-resolution volume 512 3 , 1.82 speedup for 1024 3 volume and 1.70 s p e e d u p f o r 2048 3 for highest resolution volumes over baseline implementation and optimized over previous reconstruction methods based on FDK. [ABSTRACT FROM AUTHOR]

Cone-beam dental CT can provide high-precision 3D images of the teeth and surrounding bones. From the 3D CT images, 3D models, also called digital impressions, can be computed for CAD/CAM-based fabrication of dental restorations or orthodontic devices. However, the cone-beam angle-dependent artifacts, mostly caused by the incompleteness of the projection data acquired in the circular cone-beam scan geometry, can induce significant errors in the 3D models. Using a micro-CT, we acquired CT projection data of plaster cast models at several different cone-beam angles, and we investigated the dependency of the model errors on the cone-beam angle in comparison with the reference models obtained from the optical scanning of the plaster models. For the 3D CT image reconstruction, we used the conventional Feldkamp algorithm and the combined half-scan image reconstruction algorithm to investigate the dependency of the model errors on the image reconstruction algorithm. We analyzed the mean of positive deviations and the mean of negative deviations of the surface points on the CT-image-derived 3D models from the reference model, and we compared them between the two image reconstruction algorithms. It has been found that the model error increases as the cone-beam angle increases in both algorithms. However, the model errors are smaller in the combined half-scan image reconstruction when the cone-beam angle is as large as 10 degrees. [ABSTRACT FROM AUTHOR]

This paper studies the problem of efficiently tuning the hyper-parameters in penalised least-squares reconstruction for XCT. Discovered through the lens of the Compressed Sensing paradigm, penalisation functionals such as Total Variation types of norms, form an essential tool for enforcing structure in inverse problems, a key feature in the case where the number of projections is small as compared to the size of the object to recover. In this paper, we propose a novel hyper-parameter selection approach for total variation (TV)-based reconstruction algorithms, based on a boosting type machine learning procedure initially proposed by Freund and Shapire and called Hedge. The proposed approach is able to select a set of hyper-parameters producing better reconstruction than the traditional Cross-Validation approach, with reduced computational effort. Traditional reconstruction methods based on penalisation can be made more efficient using boosting type methods from machine learning. [ABSTRACT FROM AUTHOR]