Three-dimensional Iterative Reconstruction Algorithms With Attenuation And Geometric Point Response Correction

2005 ◽  
Author(s):  
G.L. Zeng ◽  
G.T. Gullberg ◽  
J.A. Terry ◽  
B.M.W. Tsui
Keyword(s):  
Iterative Reconstruction ◽  
Three Dimensional ◽  
Reconstruction Algorithms ◽  
Geometric Point ◽  
Response Correction

Three dimensional deblurring of transmitted-light brightfield micrographs

1993 ◽  
Vol 51 ◽  
pp. 564-565
Author(s):  
Santosh Bhattacharyya
Keyword(s):  
Image Reconstruction ◽  
Three Dimensional ◽  
Transmitted Light ◽  
Reconstruction Algorithms ◽  
3D Image Reconstruction ◽  
Structural Details ◽  
Spread Function ◽  
Early Testing ◽  
Linearized Model ◽  
Image Reconstruction Algorithms

Three dimensional microscopic structures play an important role in the understanding of various biological and physiological phenomena. Structural details of neurons, such as the density, caliber and volumes of dendrites, are important in understanding physiological and pathological functioning of nervous systems. Even so, many of the widely used stains in biology and neurophysiology are absorbing stains, such as horseradish peroxidase (HRP), and yet most of the iterative, constrained 3D optical image reconstruction research has concentrated on fluorescence microscopy. It is clear that iterative, constrained 3D image reconstruction methodologies are needed for transmitted light brightfield (TLB) imaging as well. One of the difficulties in doing so, in the past, has been in determining the point spread function of the system.We have been developing several variations of iterative, constrained image reconstruction algorithms for TLB imaging. Some of our early testing with one of them was reported previously. These algorithms are based on a linearized model of TLB imaging.

scholarly journals Evaluation of Algebraic Iterative Image Reconstruction Methods for Tetrahedron Beam Computed Tomography Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-14
Author(s):  
Joshua Kim ◽  
Huaiqun Guan ◽  
David Gersten ◽  
Tiezhi Zhang
Keyword(s):  
Computed Tomography ◽  
Iterative Reconstruction ◽  
Cone Angle ◽  
Iterative Algorithms ◽  
Projection Data ◽  
Reconstruction Algorithms ◽  
Reconstruction Methods ◽  
Large Cone Angle ◽  
Using Data ◽  
Dual Detector

Tetrahedron beam computed tomography (TBCT) performs volumetric imaging using a stack of fan beams generated by a multiple pixel X-ray source. While the TBCT system was designed to overcome the scatter and detector issues faced by cone beam computed tomography (CBCT), it still suffers the same large cone angle artifacts as CBCT due to the use of approximate reconstruction algorithms. It has been shown that iterative reconstruction algorithms are better able to model irregular system geometries and that algebraic iterative algorithms in particular have been able to reduce cone artifacts appearing at large cone angles. In this paper, the SART algorithm is modified for the use with the different TBCT geometries and is tested using both simulated projection data and data acquired using the TBCT benchtop system. The modified SART reconstruction algorithms were able to mitigate the effects of using data generated at large cone angles and were also able to reconstruct CT images without the introduction of artifacts due to either the longitudinal or transverse truncation in the data sets. Algebraic iterative reconstruction can be especially useful for dual-source dual-detector TBCT, wherein the cone angle is the largest in the center of the field of view.

Sign in / Sign up

Export Citation Format

Share Document