Limits...
Analysis of iterative region-of-interest image reconstruction for x-ray computed tomography.

Sidky EY, Kraemer DN, Roth EG, Ullberg C, Reiser IS, Pan X - J Med Imaging (Bellingham) (2014)

Bottom Line: In order to characterize this optimization problem, we apply it to computer-simulated two-dimensional fan-beam CT data, using both ideal noiseless data and realistic data containing a level of noise comparable to that of the breast CT application.The proposed method is demonstrated for both complete field-of-view and ROI imaging.To demonstrate the potential utility of the proposed ROI imaging method, it is applied to actual CT scanner data.

View Article: PubMed Central - PubMed

Affiliation: University of Chicago, Department of Radiology, 5841 South Maryland Avenue, Chicago, Illinois 60637, United States.

ABSTRACT

One of the challenges for iterative image reconstruction (IIR) is that such algorithms solve an imaging model implicitly, requiring a complete representation of the scanned subject within the viewing domain of the scanner. This requirement can place a prohibitively high computational burden for IIR applied to x-ray computed tomography (CT), especially when high-resolution tomographic volumes are required. In this work, we aim to develop an IIR algorithm for direct region-of-interest (ROI) image reconstruction. The proposed class of IIR algorithms is based on an optimization problem that incorporates a data fidelity term, which compares a derivative of the estimated data with the available projection data. In order to characterize this optimization problem, we apply it to computer-simulated two-dimensional fan-beam CT data, using both ideal noiseless data and realistic data containing a level of noise comparable to that of the breast CT application. The proposed method is demonstrated for both complete field-of-view and ROI imaging. To demonstrate the potential utility of the proposed ROI imaging method, it is applied to actual CT scanner data.

No MeSH data available.


Kernel used in specifying the derivative filter  for different values of , the standard deviation of the Gaussian smoothing.
© Copyright Policy
Related In: Results  -  Collection


getmorefigures.php?uid=PMC4326078&req=5

f1: Kernel used in specifying the derivative filter for different values of , the standard deviation of the Gaussian smoothing.

Mentions: To completely specify Eq. (11) for the following CT simulations, we select a particular form of . As required, is chosen to be purely antisymmetric and it represents convolution with a 21-point kernel. This kernel is generated by smoothing an antisymmetric differencing kernel with a Gaussian of standard deviation measured in detector bin units. The smoothing of the finite differencing kernel is useful for controlling noise texture in the reconstructed images. The kernel is shown in Fig. 1 for different values of .


Analysis of iterative region-of-interest image reconstruction for x-ray computed tomography.

Sidky EY, Kraemer DN, Roth EG, Ullberg C, Reiser IS, Pan X - J Med Imaging (Bellingham) (2014)

Kernel used in specifying the derivative filter  for different values of , the standard deviation of the Gaussian smoothing.
© Copyright Policy
Related In: Results  -  Collection

Show All Figures
getmorefigures.php?uid=PMC4326078&req=5

f1: Kernel used in specifying the derivative filter for different values of , the standard deviation of the Gaussian smoothing.
Mentions: To completely specify Eq. (11) for the following CT simulations, we select a particular form of . As required, is chosen to be purely antisymmetric and it represents convolution with a 21-point kernel. This kernel is generated by smoothing an antisymmetric differencing kernel with a Gaussian of standard deviation measured in detector bin units. The smoothing of the finite differencing kernel is useful for controlling noise texture in the reconstructed images. The kernel is shown in Fig. 1 for different values of .

Bottom Line: In order to characterize this optimization problem, we apply it to computer-simulated two-dimensional fan-beam CT data, using both ideal noiseless data and realistic data containing a level of noise comparable to that of the breast CT application.The proposed method is demonstrated for both complete field-of-view and ROI imaging.To demonstrate the potential utility of the proposed ROI imaging method, it is applied to actual CT scanner data.

View Article: PubMed Central - PubMed

Affiliation: University of Chicago, Department of Radiology, 5841 South Maryland Avenue, Chicago, Illinois 60637, United States.

ABSTRACT

One of the challenges for iterative image reconstruction (IIR) is that such algorithms solve an imaging model implicitly, requiring a complete representation of the scanned subject within the viewing domain of the scanner. This requirement can place a prohibitively high computational burden for IIR applied to x-ray computed tomography (CT), especially when high-resolution tomographic volumes are required. In this work, we aim to develop an IIR algorithm for direct region-of-interest (ROI) image reconstruction. The proposed class of IIR algorithms is based on an optimization problem that incorporates a data fidelity term, which compares a derivative of the estimated data with the available projection data. In order to characterize this optimization problem, we apply it to computer-simulated two-dimensional fan-beam CT data, using both ideal noiseless data and realistic data containing a level of noise comparable to that of the breast CT application. The proposed method is demonstrated for both complete field-of-view and ROI imaging. To demonstrate the potential utility of the proposed ROI imaging method, it is applied to actual CT scanner data.

No MeSH data available.