Search PubMed⌕ Search

Biomedical subjects

R M Lewitt

Publications and source records attributed to R M Lewitt.

11 recordsLinked to original sources

2.5-D simultaneous multislice reconstruction by series expansion methods from Fourier-rebinned PET data.

True three-dimensional (3-D) volume reconstruction from fully 3-D data in positron emission tomography (PET) has only a limited clinical use because of its large computational burden. Fourier rebinning (FORE) of the fully 3-D data into a set of 2-D sinogram data decomposes the 3-D reconstruction process into multiple 2-D reconstructions of decoupled 2-D image slices, thus substantially decreasing the computational burden even in the case when the 2-D reconstructions are performed by an iterative reconstruction algorithm. On the other hand, the approximations involved in the rebinning combined with the decoupling of the image slices cause a certain reduction of image quality, especially when the signal-to-noise ratio of the data is low. We propose a 2.5-D Simultaneous Multislice Reconstruction approach, based on the series expansion principle, where the volume is represented by the superposition of 3-D spherically symmetric bell-shaped basis functions. It takes advantage of the time reduction due to the use of the FORE (2-D) data, instead of the original fully 3-D data, but at the same time uses a 3-D iterative reconstruction approach with 3-D basis functions. The same general approach can be applied to any reconstruction algorithm belonging to the class of series expansion methods (iterative or noniterative) using 3-D basis functions that span multiple slices, and can be used for any multislice sinogram or list mode data whether obtained by a special rebinning scheme or acquired directly by a PET scanner in the 2-D mode using septa. Our studies confirm that the proposed 2.5-D approach provides a considerable improvement in reconstruction quality, as compared to the standard 2-D reconstruction approach, while the reconstruction time is of the same order as that of the 2-D approach and is clinically practical even on a general-purpose computer.

Algorithms↗

Performance of the Fourier rebinning algorithm for PET with large acceptance angles.

The recently proposed Fourier rebinning (FORE) technique of 3D PET reconstruction is investigated over a wide range of axial acceptance angles. In this study we evaluate the performance of the FORE technique using spatial resolution, contrast and noise figures of merit and compare reconstruction performance of the FORE (followed by multislice 2D reconstruction) to the 3D-RP technique for large-acceptance-angle data (+/-26.25 degrees). Our results show that the FORE technique does not affect the transverse resolution. On the other hand the axial resolution using FORE deteriorates faster, compared with the 3D-RP, at large radii as the acceptance angle increases. Concerning the noise behaviour, we have found that filtering has better ability to suppress the noise in the FORE reconstruction, compared with the 3D-RP reconstruction, especially in the slices near the edge of the axial field of view. Overall, the combination of good performance and fast reconstruction time makes the FORE technique a practical choice for 3D PET applications.

Algorithms↗

Three-dimensional imaging characteristics of the HEAD PENN-PET scanner.

UNLABELLED: A volume-imaging PET scanner, without interplane septa, for brain imaging has been designed and built to achieve high performance, specifically in spatial resolution and sensitivity. The scanner is unique in its use of a single annular crystal of Nal(Tl), which allows a field of view (FOV) of 25.6 cm in both the transverse and axial directions. Data are reconstructed into an image matrix of 128(3) with (2 mm)3 voxels, using three-dimensional image reconstruction algorithms. METHODS: Point-source measurements are performed to determine spatial resolution over the scanner FOV, and cylindrical phantom distributions are used to determine the sensitivity, scatter fraction and counting rate performance of the system. A three-dimensional brain phantom and 18F-FDG patient studies are used to evaluate image quality with three-dimensional reconstruction algorithms. RESULTS: The system spatial resolution is measured to be 3.5 mm in both the transverse and axial directions, in the center of the FOV. The true sensitivity, using the standard NEMA phantom (6 liter), is 660 kcps/microCi/ml, after subtracting a scatter fraction of 34%. Due to deadtime effects, we measure a peak true counting rate, after scatter and randoms subtraction, of 100 kcps at 0.7 mCi for a smaller brain-sized (1.1 liter) phantom, and 70 kcps for a head-sized (2.5 liter) phantom at the same activity. A typical 18F-FDG clinical brain study requires only 2 mCi to achieve high statistics (100 million true events) with a scan time of 30 min. CONCLUSION: The HEAD PENN-PET scanner is based on a cost-effective design using Nal(Tl) and has been shown to achieve high performance for brain studies and pediatric whole-body studies. As a full-time three-dimensional imaging scanner with a very large axial acceptance angle, high sensitivity is achieved. The system becomes counting-rate limited as the activity is increased, but we achieve high image quality with a small injected dose. This is a significant advantage for clinical imaging, particularly for pediatric patients.

Brain↗

Alternatives to voxels for image representation in iterative reconstruction algorithms.

Spherically symmetric volume elements are alternatives to the more conventional voxels for the construction of volume images in the computer. The image representation, and the calculation of projections of it, are essential components of iterative algorithms for image reconstruction from projection data. A two-parameter family of spherical volume elements is described that allows control of the smoothness properties of the represented image, whereas conventional voxels are discontinuous. The rotational symmetry of the spherical elements leads to efficient calculation of projections of the represented image, as required in iterative reconstruction algorithms. For volume elements whose shape is ellipsoidal (rather than spherical) it is shown that efficient calculation of the projections is also possible by means of an image space transformation.

Algorithms↗

Multidimensional digital image representations using generalized Kaiser-Bessel window functions.

Inverse problems that require the solution of integral equations are inherent in a number of indirect imaging applications, such as computerized tomography. Numerical solutions based on discretization of the mathematical model of the imaging process, or on discretization of analytic formulas for iterative inversion of the integral equations, require a discrete representation of an underlying continuous image. This paper describes discrete image representations, in n-dimensional space, that are constructed by the superposition of shifted copies of a rotationally symmetric basis function. The basis function is constructed using a generalization of the Kaiser-Bessel window function of digital signal processing. The generalization of the window function involves going from one dimension to a rotationally symmetric function in n dimensions and going from the zero-order modified Bessel function of the standard window to a function involving the modified Bessel function of order m. Three methods are given for the construction, in n-dimensional space, of basis functions having a specified (finite) number of continuous derivatives, and formulas are derived for the Fourier transform, the x-ray transform, the gradient, and the Laplacian of these basis functions. Properties of the new image representations using these basis functions are discussed, primarily in the context of two-dimensional and three-dimensional image reconstruction from line-integral data by iterative inversion of the x-ray transform. Potential applications to three-dimensional image display are also mentioned.

Fourier Analysis↗

Evaluation of a preprocessing algorithm for truncated CT projections.

A preprocessing algorithm for completing truncated computed tomography (CT) projection data (so that reconstruction methods suitable for complete projection data can be applied) is experimentally investigated. The study is motivated primarily by the problem of patients who are too obese to fit into the fan beam of a rotate-only (third generation) scanner, and secondarily by dose reduction considerations. Four sets of patient data collected by a rotate-only scanner are used, and the reconstructions from the complete and truncated projection data are compared. It is illustrated that the preprocessing algorithm leads to qualitatively good images, since local variations are nearly identical in the reconstruction from the complete and from the truncated data. Quantitatively, the results are less encouraging; the exact values of CT numbers differ in the two reconstructions by a significant (although slowly varying) amount across the two reconstructed images.

Humans↗

Demonstration of a software package for the reconstruction of the dynamically changing structure of the human heart from cone beam x-ray projections.

The Dynamic Spatial Reconstructor (DSR) is a device constructed at the Biodynamics Research Unit of the Mayo Clinic for (among other things) the visualization of the beating heart inside the intact thorax. The device consists of 28 rotating X-ray sources arranged on a circular arc at 6 degrees intervals (total span 162 degrees) and a matching set of 28 imaging systems. The whole thorax of the patient is projected onto the two-dimensional screen of the imaging systems by cone beams of X rays from the sources. All of the X-ray sources are switched on and off within a total period of 10 milliseconds. The Medical Image Processing Group at the State University of New York at Buffalo has developed a software package for the design and evaluation of algorithms to be used by the DSR. In this paper we illustrate the operation of the package and a particular algorithm for the reconstruction of the dynamically changing structure of the heart from data collected by the DSR.

Computers↗

Computed tomography with fan beam geometry.

Data collection for computed tomography (CT), using a fan beam of radiation, is considered in detail. The manner in which the required projection data set is built up as scanning proceeds is demonstrated. It is shown that by offsetting the fan beam detector from its symmetrical position by a fraction of the element spacing, and by making measurements over 360 degrees, the spatial resolution of the detector may be increased by up to a factor of two. Results of simulations relating to an actual CT device under construction are presented.

Mathematics↗

A possible conformation for double-stranded polynucleotides.

A model is presented for double-stranded polynucleotides which involves side-by-side meshing of the two strands rather than double helical intertwining. The sugar-phosphate backbone has a twisted strip-like character, yet base-pairing of the Watson-Crick type is still possible. Structural features of the basic model are described and coordinates are presented for a representative example. The structure has, on the whole, reasonable sterochemical contacts, and can be shown to produce a fiber diffraction pattern with x-rays not unlike that of the B form of DNA.

DNA↗

Processing of incomplete measurement data in computed tomography.

Conventional approaches to computed tomography involve scanning the entire cross section and producing an image whose spatial and density resolution is uniform over its entire area. If the extent of each scan is restricted to the width of the lesion being investigated, then the x-ray dose is reduced, but a set of incomplete "truncated" projections is measured. Conversely, projections are "hollow" when their inner parts cannot be measured, e.g., when there is a metallic object within the body cross section. We present procedures for preprocessing incomplete projections so that images can be reconstructed from them using the convolution/back projection method.

Mathematics↗