An interaction based CT reconstruction algorithm for blocked projection data in a dynamic ICT system

2012 ◽  
Author(s):  
Ming Chang ◽  
Yongshun Xiao ◽  
Zhiqiang Chen ◽  
Xin Jin
Keyword(s):  
Reconstruction Algorithm ◽  
Projection Data ◽  
Ct Reconstruction ◽  
Ict System

A new weighting scheme for arc based circle cone-beam CT reconstruction

2021 ◽  
pp. 1-19
Author(s):  
Wei Wang ◽  
Xiang-Gen Xia ◽  
Chuanjiang He ◽  
Zemin Ren ◽  
Jian Lu
Keyword(s):  
Characteristic Function ◽  
Weighting Function ◽  
Cone Beam Ct ◽  
Reconstruction Algorithm ◽  
Cone Beam ◽  
Characteristic Functions ◽  
Projection Data ◽  
Ct Reconstruction ◽  
Scanning Angle ◽  
Beam Geometry

In this paper, we present an arc based fan-beam computed tomography (CT) reconstruction algorithm by applying Katsevich’s helical CT image reconstruction formula to 2D fan-beam CT scanning data. Specifically, we propose a new weighting function to deal with the redundant data. Our weighting function ϖ ( x _ , λ ) is an average of two characteristic functions, where each characteristic function indicates whether the projection data of the scanning angle contributes to the intensity of the pixel x _ . In fact, for every pixel x _ , our method uses the projection data of two scanning angle intervals to reconstruct its intensity, where one interval contains the starting angle and another contains the end angle. Each interval corresponds to a characteristic function. By extending the fan-beam algorithm to the circle cone-beam geometry, we also obtain a new circle cone-beam CT reconstruction algorithm. To verify the effectiveness of our method, the simulated experiments are performed for 2D fan-beam geometry with straight line detectors and 3D circle cone-beam geometry with flat-plan detectors, where the simulated sinograms are generated by the open-source software “ASTRA toolbox.” We compare our method with the other existing algorithms. Our experimental results show that our new method yields the lowest root-mean-square-error (RMSE) and the highest structural-similarity (SSIM) for both reconstructed 2D and 3D fan-beam CT images.

Computed tomography reconstruction on distributed storage using hybrid regularization approach

2019 ◽  
Vol 33 (06) ◽  
pp. 1950063 ◽  
Author(s):  
Shailendra Tiwari ◽  
Kavkirat Kaur ◽  
Yadunath Pathak ◽  
Shivendraa Shivani ◽  
Kuldeep Kaur
Keyword(s):  
Computed Tomography ◽  
Gaussian Noise ◽  
Distributed Storage ◽  
Hybrid Approach ◽  
Computational Cost ◽  
Reconstruction Algorithm ◽  
Noise Robustness ◽  
Projection Data ◽  
Reconstruction Method ◽  
Ct Reconstruction

Computed Tomography (CT) is considered as a significant imaging tool for clinical diagnoses. Due to low-dose radiation in CT, the projection data is highly affected by Gaussian noise which may lead to blurred images, staircase effect, loss of basic fine structure and detailed information. Therefore, there is a demand for an approach that can eliminate noise and can provide high-quality images. To achieve this objective, this paper presents a new statistical image reconstruction method by proposing a suitable regularization approach. The proposed regularization is a hybrid approach of Complex Diffusion and Shock filter as a prior term. To handle the problem of prominent Gaussian noise as well as ill-posedness, the proposed hybrid regularization is further combined with the standard Maximum Likelihood Expectation Maximization (MLEM) reconstruction algorithm in an iterative manner and has been referred to as the proposed CT-Reconstruction (CT-R) algorithm here after. Besides, considering the large sizes of image data sets for medical imaging, distributed storage for images have been employed on Hadoop Distributed File System (HDFS) and the proposed MLEM algorithms have been deployed for improved performance.The proposed method has been evaluated on both the simulated and real test phantoms. The final results are compared with the other standard methods and it is observed that the proposed method has many desirable properties such as better noise robustness, less computational cost and enhanced denoising effect.

scholarly journals A CT Reconstruction Algorithm Based on Non-Aliasing Contourlet Transform and Compressive Sensing

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Lu-zhen Deng ◽  
Peng Feng ◽  
Mian-yi Chen ◽  
Peng He ◽  
Quang-sang Vo ◽  
...  
Keyword(s):  
Compressive Sensing ◽  
Iteration Process ◽  
Reconstruction Algorithm ◽  
Ct Images ◽  
Contourlet Transform ◽  
Projection Data ◽  
Reconstruction Technique ◽  
Reconstruction Method ◽  
Ct Reconstruction ◽  
Split Bregman

Compressive sensing (CS) theory has great potential for reconstructing CT images from sparse-views projection data. Currently, total variation (TV-) based CT reconstruction method is a hot research point in medical CT field, which uses the gradient operator as the sparse representation approach during the iteration process. However, the images reconstructed by this method often suffer the smoothing problem; to improve the quality of reconstructed images, this paper proposed a hybrid reconstruction method combining TV and non-aliasing Contourlet transform (NACT) and using the Split-Bregman method to solve the optimization problem. Finally, the simulation results show that the proposed algorithm can reconstruct high-quality CT images from few-views projection using less iteration numbers, which is more effective in suppressing noise and artefacts than algebraic reconstruction technique (ART) and TV-based reconstruction method.

scholarly journals An Approximate Cone Beam Reconstruction Algorithm for Gantry-Tilted CT Using Tangential Filtering

2006 ◽  
Vol 2006 ◽  
pp. 1-8
Author(s):  
Ming Yan ◽  
Cishen Zhang ◽  
Hongzhu Liang
Keyword(s):  
Image Reconstruction ◽  
Cone Angle ◽  
Three Dimensional ◽  
Ct Scanning ◽  
Reconstruction Algorithm ◽  
Tangential Direction ◽  
Approximate Algorithm ◽  
Projection Data ◽  
Ct Reconstruction ◽  
Fdk Algorithm

FDK algorithm is a well-known 3D (three-dimensional) approximate algorithm for CT (computed tomography) image reconstruction and is also known to suffer from considerable artifacts when the scanning cone angle is large. Recently, it has been improved by performing the ramp filtering along the tangential direction of the X-ray source helix for dealing with the large cone angle problem. In this paper, we present an FDK-type approximate reconstruction algorithm for gantry-tilted CT imaging. The proposed method improves the image reconstruction by filtering the projection data along a proper direction which is determined by CT parameters and gantry-tilted angle. As a result, the proposed algorithm for gantry-tilted CT reconstruction can provide more scanning flexibilities in clinical CT scanning and is efficient in computation. The performance of the proposed algorithm is evaluated with turbell clock phantom and thorax phantom and compared with FDK algorithm and a popular 2D (two-dimensional) approximate algorithm. The results show that the proposed algorithm can achieve better image quality for gantry-tilted CT image reconstruction.

scholarly journals A CT Reconstruction Algorithm Based on L1/2Regularization

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mianyi Chen ◽  
Deling Mi ◽  
Peng He ◽  
Luzhen Deng ◽  
Biao Wei
Keyword(s):  
Reconstruction Algorithm ◽  
Ct Images ◽  
Projection Data ◽  
Reconstruction Technique ◽  
Ct Reconstruction ◽  
Split Bregman ◽  
Reconstruction Methods ◽  
Significant Research ◽  
Regularization Operator

Computed tomography (CT) reconstruction with low radiation dose is a significant research point in current medical CT field. Compressed sensing has shown great potential reconstruct high-quality CT images from few-view or sparse-view data. In this paper, we use the sparser L1/2regularization operator to replace the traditional L1regularization and combine the Split Bregman method to reconstruct CT images, which has good unbiasedness and can accelerate iterative convergence. In the reconstruction experiments with simulation and real projection data, we analyze the quality of reconstructed images using different reconstruction methods in different projection angles and iteration numbers. Compared with algebraic reconstruction technique (ART) and total variance (TV) based approaches, the proposed reconstruction algorithm can not only get better images with higher quality from few-view data but also need less iteration numbers.

Convergence and stability analysis of the half thresholding based few-view CT reconstruction

2020 ◽  
Vol 28 (6) ◽  
pp. 829-847
Author(s):  
Hua Huang ◽  
Chengwu Lu ◽  
Lingli Zhang ◽  
Weiwei Wang
Keyword(s):  
Noise Suppression ◽  
Reconstructed Image ◽  
Reference Image ◽  
Projection Data ◽  
Ct Reconstruction ◽  
Reconstruction Algorithms ◽  
Ill Posed ◽  
Thresholding Algorithm ◽  
The Stability ◽  
Well Posed

AbstractThe projection data obtained using the computed tomography (CT) technique are often incomplete and inconsistent owing to the radiation exposure and practical environment of the CT process, which may lead to a few-view reconstruction problem. Reconstructing an object from few projection views is often an ill-posed inverse problem. To solve such problems, regularization is an effective technique, in which the ill-posed problem is approximated considering a family of neighboring well-posed problems. In this study, we considered the {\ell_{1/2}} regularization to solve such ill-posed problems. Subsequently, the half thresholding algorithm was employed to solve the {\ell_{1/2}} regularization-based problem. The convergence analysis of the proposed method was performed, and the error bound between the reference image and reconstructed image was clarified. Finally, the stability of the proposed method was analyzed. The result of numerical experiments demonstrated that the proposed method can outperform the classical reconstruction algorithms in terms of noise suppression and preserving the details of the reconstructed image.

scholarly journals CT reconstruction algorithm based on truncated TV

2021 ◽  
Vol 1920 (1) ◽  
pp. 012036
Author(s):  
Hongyan Shi ◽  
Aidi Wu ◽  
Shidi Yang ◽  
Dongjiang Ji
Keyword(s):  
Reconstruction Algorithm ◽  
Ct Reconstruction

scholarly journals X-RAY CT Reconstruction by using Spatially Non Homogeneous ICD Optimization

2019 ◽  
Vol 8 (6S3) ◽  
pp. 2043-2046
Keyword(s):  
Search Algorithm ◽  
Computational Cost ◽  
Selection Criterion ◽  
Closed Form Solution ◽  
Helical Ct ◽  
Reconstruction Algorithm ◽  
Form Solution ◽  
Ct Reconstruction ◽  
Practical Applications ◽  
Voxel Selection

Recent applications of conventional iterative coordinate descent (ICD) algorithms to multislice helical CT reconstructions have shown that conventional ICD can greatly improve image quality by increasing resolution as well as reducing noise and some artifacts. However, high computational cost and long reconstruction times remain as a barrier to the use of conventional algorithm in the practical applications. Among the various iterative methods that have been studied for conventional, ICD has been found to have relatively low overall computational requirements due to its fast convergence. This paper presents a fast model-based iterative reconstruction algorithm using spatially nonhomogeneous ICD (NH-ICD) optimization. The NH-ICD algorithm speeds up convergence by focusing computation where it is most needed. The NH-ICD algorithm has a mechanism that adaptively selects voxels for update. First, a voxel selection criterion VSC determines the voxels in greatest need of update. Then a voxel selection algorithm VSA selects the order of successive voxel updates based upon the need for repeated updates of some locations, while retaining characteristics for global convergence. In order to speed up each voxel update, we also propose a fast 3-D optimization algorithm that uses a quadratic substitute function to upper bound the local 3-D objective function, so that a closed form solution can be obtained rather than using a computationally expensive line search algorithm. The experimental results show that the proposed method accelerates the reconstructions by roughly a factor of three on average for typical 3-D multislice geometries.

Sign in / Sign up

Export Citation Format

Share Document