PubMed Health⌕ Search

Biomedical subjects

Emil Y Sidky

Publications and source records attributed to Emil Y Sidky.

9 recordsLinked to original sources

Region of interest reconstruction from truncated data in circular cone-beam CT.

The circular scanning trajectory is one of the most widely adopted data-acquisition configurations in computed tomography (CT). The Feldkamp, Davis, Kress (FDK) algorithm and its various modifications have been developed for reconstructing approximately three-dimensional images from circular cone-beam data. When data contain transverse truncations, however, these algorithms may reconstruct images with significant truncation artifacts. It is of practical significance to develop algorithms that can reconstruct region-of-interest (ROI) images from truncated circular cone-beam data that are free of truncation artifacts and that have an accuracy comparable to that obtained from nontruncated cone-beam data. In this work, we have investigated and developed a backprojection-filtration (BPF)-based algorithm for ROI-image reconstruction from circular cone-beam data containing transverse truncations. Furthermore, we have developed a weighted BPF algorithm to exploit "redundant" information in data for improving image quality. In an effort to validate and evaluate the proposed BPF algorithms for circular cone-beam CT, we have performed numerical studies by using both computer-simulation data and experimental data acquired with a radiotherapy cone-beam CT system. Quantitative results in these studies demonstrate that the proposed BPF algorithms for circular cone-beam CT can reconstruct ROI images free of truncation artifacts.

Algorithms↗

Minimum data image reconstruction algorithms with shift-invariant filtering for helical, cone-beam CT.

We derive accurate and efficient reconstruction algorithms for helical, cone-beam CT that employ shift-invariant filtering. Specifically, a new backprojection-filtration algorithm is developed, and a minimum data filtered-backprojection algorithm is derived. These reconstruction algorithms with shift-invariant filtering can accept data with transverse truncation, and hence allow for minimum data image reconstruction.

Algorithms↗

Image reconstruction in regions-of-interest from truncated projections in a reduced fan-beam scan.

In a reduced fan-beam scan, the scanned angular range is smaller than that in a short scan (i.e., a half-scan). In this work, we have developed a new algorithm, which is referred to as the backprojection-filtration (BPF) algorithm, for exact image reconstruction within ROIs from reduced-scan data containing truncations. Explicit conditions on data acquisition have also been derived for exact image reconstruction within an ROI. We have performed a preliminary quantitative study whose results demonstrated and verified the proposed fan-beam BPF algorithm and the derived conditions on data acquisition. The proposed BPF algorithm can have significant implications for clinical and animal CT imaging, therapy imaging, electron paramagnetic resonance imaging and other tomographic imaging because it allows for reconstruction from truncated data and for a potentially drastic reduction of radiation dose and/or of imaging time.

Algorithms↗

Feasibility of half-data image reconstruction in 3-D reflectivity tomography with a spherical aperture.

Reflectivity tomography is an imaging technique that seeks to reconstruct certain acoustic properties of a weakly scattering object. Besides being applicable to pure ultrasound imaging techniques, the reconstruction theory of reflectivity tomography is also pertinent to hybrid imaging techniques such as thermoacoustic tomography. In this work, assuming spherical scanning apertures, redundancies in the three-dimensional (3-D) reflectivity tomography data function are identified and formulated mathematically. These data redundancies are used to demonstrate that knowledge of the measured data function over half of its domain uniquely specifies the 3-D object function. This indicates that, in principle, exact image reconstruction can be performed using a "half-scan" data function, which corresponds to temporally untruncated measurements acquired on a hemi-spherical aperture, or using a "half-time" data function, which corresponds to temporally truncated measurements acquired on the entire spherical aperture. Both of these minimal scanning configurations have important biological imaging applications. An iterative reconstruction method is utilized for reconstruction of a simulated 3-D object from noiseless and noisy half-scan and half-time data functions.

Algorithms↗

Reconstruction of 3D regions-of-interest from data in reduced helical cone-beam scans.

The sufficiency conditions are derived for exact image reconstruction of a 3D ROI from projections acquired with a reduced helical scan over an angular range considerably smaller than that required by image reconstruction in, e.g., the conventional long object problem, for which the scanned angular range is often more than 2pi. ROI reconstruction is investigated by a recently developed filtered-backprojection algorithm that can make use of data acquired with a reduced helical scan. Preliminary numerical studies demonstrate and validate the ROI reconstruction. This work may have significant practical implications because a reduced scan in CT often translates to reduced motion artifacts and reduced radiation dose delivered to the subject.

Algorithms↗

Theory and algorithms for image reconstruction on chords and within regions of interest.

We introduce a formula for image reconstruction on a chord of a general source trajectory. We subsequently develop three algorithms for exact image reconstruction on a chord from data acquired with the general trajectory. Interestingly, two of the developed algorithms can accommodate data containing transverse truncations. The widely used helical trajectory and other trajectories discussed in literature can be interpreted as special cases of the general trajectory, and the developed theory and algorithms are thus directly applicable to reconstructing images exactly from data acquired with these trajectories. For instance, chords on a helical trajectory are equivalent to the n-PI-line segments. In this situation, the proposed algorithms become the algorithms that we proposed previously for image reconstruction on PI-line segments. We have performed preliminary numerical studies, which include the study on image reconstruction on chords of two-circle trajectory, which is nonsmooth, and on n-PI lines of a helical trajectory, which is smooth. Quantitative results of these studies verify and demonstrate the proposed theory and algorithms.

Algorithms↗

Impact of polychromatic x-ray sources on helical, cone-beam computed tomography and dual-energy methods.

Recently, there has been much work devoted to developing accurate and efficient algorithms for image reconstruction in helical, cone-beam computed tomography (CT). Little attention, however, has been directed to the effect of physical factors on helical, cone-beam CT image reconstruction. This work investigates the effect of polychromatic x-rays on image reconstruction in helical, cone-beam computed tomography. A pre-reconstruction dual-energy technique is developed to reduce beam-hardening artefacts and enhance contrast in soft tissue.

Algorithms↗

Partial volume and aliasing artefacts in helical cone-beam CT.

A generalization of the quasi-exact algorithms of Kudo et al (2000 IEEE Trans. Med. Imaging 19 902-21) is developed that allows for data acquisition in a 'practical' frame for clinical diagnostic helical, cone-beam computed tomography (CT). The algorithm is investigated using data that model nonlinear partial volume averaging. This investigation leads to an understanding of aliasing artefacts in helical, cone-beam CT image reconstruction. An ad hoc scheme is proposed to mitigate artefacts due to the nonlinear partial volume and aliasing artefacts.

Algorithms↗

Short-scan SPECT imaging with non-uniform attenuation and 3D distance-dependent spatial resolution.

Image quality and quantitative accuracy in single-photon emission computed tomography (SPECT) can be degraded by, e.g., the effects of photon attenuation and finite spatial resolution. It is generally considered that adequate compensation for such effects on SPECT images requires data acquired over 2 pi. Recently, using the existing consistency condition on the data function, Noo and Wagner (2001 Inverse Problems 17 1357-72) have shown analytically that data acquired over only pi can be used to correct completely for the effect of uniform attenuation in SPECT. It remains unknown, however, whether data acquired only over pi in SPECT with non-uniform attenuation and/or 3D distance-dependent spatial resolution (DDSR) contain complete information for accurate image reconstruction. In this work, we develop a heuristic perspective, which is referred to as the potato peeler perspective to show conceptually that data in SPECT with non-uniform attenuation and/or 3D DDSR acquired over 2 pi contain redundant information and that such information can be used to reduce the scanning angle in SPECT. Specifically, we show heuristically that, in SPECT with only non-uniform attenuation, the scanning angle can be reduced from 2 pi to pi and that, in SPECT with both non-uniform attenuation and DDSR with a physically realistic form, the scanning angle can be reduced from 2 pi to pi in a practical sense. We conduct computer simulation studies, and the results from these studies corroborate the observations obtained based upon the heuristic potato peeler perspective.

Algorithms↗