Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAn Improved Method of Total Variation Superiorization Applied to Reconstruction in Proton Computed Tomography
61
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Previous work showed that total variation superiorization (TVS) improves reconstructed image quality in proton computed tomography (pCT). The structure of the TVS algorithm has evolved since then and this work investigated if this new algorithmic structure provides additional benefits to pCT image quality. Structural and parametric changes introduced to the original TVS algorithm included: (1) inclusion or exclusion of TV reduction requirement, (2) a variable number, $N$, of TV perturbation steps per feasibility-seeking iteration, and (3) introduction of a perturbation kernel $0<alpha<1$. The structural change of excluding the TV reduction requirement check tended to have a beneficial effect for $3le Nle 6$ and allows full parallelization of the TVS algorithm. Repeated perturbations per feasibility-seeking iterations reduced total variation (TV) and material dependent standard deviations for $3le Nle 6$. The perturbation kernel $alpha$, equivalent to $alpha=0.5$ in the original TVS algorithm, reduced TV and standard deviations as $alpha$ was increased beyond $alpha=0.5$, but negatively impacted reconstructed relative stopping power (RSP) values for $alpha>0.75$. The reductions in TV and standard deviations allowed feasibility-seeking with a larger relaxation parameter $lambda$ than previously used, without the corresponding increases in standard deviations experienced with the original TVS algorithm. This work demonstrates that the modifications related to the evolution of the original TVS algorithm provide benefits in terms of both pCT image quality and computational efficiency for appropriately chosen parameter values.
rate research
Read More
Computer tomography is one of the most promising new methods to image abnormal tissues inside the human body. Tomography is also used to position the patient accurately before radiation therapy. Hadron therapy for treating cancer has become one of the most advantageous and safe options. In order to fully utilize the advantages of hadron therapy, there is a necessity of performing radiography with hadrons as well. In this paper we present the development of a proton computed tomography system. Our second-generation proton tomography system consists of two upstream and two downstream trackers made up of fibers as active material and a range detector consisting of plastic scintillators. We present details of the detector system, readout electronics, and data acquisition system as well as the commissioning of the entire system. We also present preliminary results from the test beam of the range detector.
For conventional computed tomography (CT) image reconstruction tasks, the most popular method is the so-called filtered-back-projection (FBP) algorithm. In it, the acquired Radon projections are usually filtered first by a ramp kernel before back-projected to generate CT images. In this work, as a contrary, we realized the idea of image-domain backproject-filter (BPF) CT image reconstruction using the deep learning techniques for the first time. With a properly designed convolutional neural network (CNN), preliminary results demonstrate that it is feasible to reconstruct CT images with maintained high spatial resolution and accurate pixel values from the highly blurred back-projection image, i.e., laminogram. In addition, experimental results also show that this deconvolution-based CT image reconstruction network has the potential to reduce CT image noise (up to 20%), indicating that patient radiation dose may be reduced. Due to these advantages, this proposed CNN-based image-domain BPF type CT image reconstruction scheme provides promising prospects in generating high spatial resolution, low-noise CT images for future clinical applications.
Photoacoustic computed tomography (PACT) is an emerging computed imaging modality that exploits optical contrast and ultrasonic detection principles to form images of the absorbed optical energy density within tissue. If the object possesses spatially variant acoustic properties that are unaccounted for by the reconstruction method, the estimated image can contain distortions. While reconstruction methods have recently been developed to compensate for this effect, they generally require the objects acoustic properties to be known a priori. To circumvent the need for detailed information regarding an objects acoustic properties, we previously proposed a half-time reconstruction method for PACT. A half-time reconstruction method estimates the PACT image from a data set that has been temporally truncated to exclude the data components that have been strongly aberrated. However, this method can be improved upon when the approximate sizes and locations of isolated heterogeneous structures, such as bones or gas pockets, are known. To address this, we investigate PACT reconstruction methods that are based on a variable data truncation (VDT) approach. The VDT approach represents a generalization of the half-time approach, in which the degree of temporal truncation for each measurement is determined by the distance between the corresponding ultrasonic transducer location and the nearest known bone or gas void location. Computer-simulated and experimental data are employed to demonstrate the effectiveness of the approach in mitigating artifacts due to acoustic heterogeneities.
A qualitative comparison of total variation like penalties (total variation, Huber variant of total variation, total generalized variation, ...) is made in the context of global seismic tomography. Both penalized and constrained formulations of seismic recovery problems are treated. A number of simple iterative recovery algorithms applicable to these problems are described. The convergence speed of these algorithms is compared numerically in this setting. For the constrained formulation a new algorithm is proposed and its convergence is proven.
Algebraic models for the reconstruction problem in X-ray computed tomography (CT) provide a flexible framework that applies to many measurement geometries. For large-scale problems we need to use iterative solvers, and we need stopping rules for these methods that terminate the iterations when we have computed a satisfactory reconstruction that balances the reconstruction error and the influence of noise from the measurements. Many such stopping rules are developed in the inverse problems communities, but they have not attained much attention in the CT world. The goal of this paper is to describe and illustrate four stopping rules that are relevant for CT reconstructions.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
