Search PubMed⌕ Search

Biomedical subjects

Jeffrey A Fessler

Publications and source records attributed to Jeffrey A Fessler.

At least 19 recordsLinked to original sources

Iterative RF pulse design for multidimensional, small-tip-angle selective excitation.

The excitation k-space perspective on small-tip-angle selective excitation has facilitated RF pulse designs in a range of MR applications. In this paper, k-space-based design of multidimensional RF pulses is formulated as a quadratic optimization problem, and solved efficiently by the iterative conjugate-gradient (CG) algorithm. Compared to conventional design approaches, such as the conjugate-phase (CP) method, the new design approach is beneficial in several regards. It generally produces more accurate excitation patterns. The improvement is particularly significant when k-space is undersampled, and it can potentially shorten pulse lengths. A prominent improvement in accuracy is also observed when large off-resonance gradients are present. A further boost in excitation accuracy can be accomplished in regions of interest (ROIs) if they are specified together with "don't-care" regions. The density compensation function (DCF) is no longer required. In addition, regularization techniques allow control over integrated and peak pulse power.

Algorithms↗

Conjugate phase MRI reconstruction with spatially variant sample density correction.

A new image reconstruction method to correct for the effects of magnetic field inhomogeneity in non-Cartesian sampled magnetic resonance imaging (MRI) is proposed. The conjugate phase reconstruction method, which corrects for phase accumulation due to applied gradients and magnetic field inhomogeneity, has been commonly used for this case. This can lead to incomplete correction, in part, due to the presence of gradients in the field inhomogeneity function. Based on local distortions to the k-space trajectory from these gradients, a spatially variant sample density compensation function is introduced as part of the conjugate phase reconstruction. This method was applied to both simulated and experimental spiral imaging data and shown to produce more accurate image reconstructions. Two approaches for fast implementation that allow the use of fast Fourier transforms are also described. The proposed method is shown to produce fast and accurate image reconstructions for spiral sampled MRI.

Algorithms↗

Respiratory motion estimation from slowly rotating x-ray projections: theory and simulation.

Understanding the movement of tumors caused by respiratory motion is very important for conformal radiatherapy. However, respiratory motion is very difficult to study by conventional x-ray CT imaging since object motion causes inconsistent projection views, leading to artifacts in reconstructed images. We propose to estimate the parameters of a nonrigid, free breathing motion model from a set of projection views of the thorax that are acquired using a slowly rotating cone-beam CT scanner. This approach involves deforming a motion-free reference thorax volume according to the estimated parameters and comparing its projections to the corresponding measured projection views. The parameters are optimized by minimizing a regularized squared error cost function. Simulation results with a fan-beam geometry show good agreement between the estimated motion and the true motion, which supports the potential of this approach for estimating four-dimensional (three-dimensional spatial + temporal) respiratory motion.

Algorithms↗

Pragmatic fully 3D image reconstruction for the MiCES mouse imaging PET scanner.

We present a pragmatic approach to image reconstruction for data from the micro crystal elements system (MiCES) fully 3D mouse imaging positron emission tomography (PET) scanner under construction at the University of Washington. Our approach is modelled on fully 3D image reconstruction used in clinical PET scanners, which is based on Fourier rebinning (FORE) followed by 2D iterative image reconstruction using ordered-subsets expectation-maximization (OSEM). The use of iterative methods allows modelling of physical effects (e.g., statistical noise, detector blurring, attenuation, etc), while FORE accelerates the reconstruction process by reducing the fully 3D data to a stacked set of independent 2D sinograms. Previous investigations have indicated that non-stationary detector point-spread response effects, which are typically ignored for clinical imaging, significantly impact image quality for the MiCES scanner geometry. To model the effect of non-stationary detector blurring (DB) in the FORE+OSEM(DB) algorithm, we have added a factorized system matrix to the ASPIRE reconstruction library. Initial results indicate that the proposed approach produces an improvement in resolution without an undue increase in noise and without a significant increase in the computational burden. The impact on task performance, however, remains to be evaluated.

Animals↗

Dynamic field map estimation using a spiral-in/spiral-out acquisition.

The long readout times of single-shot acquisitions and the high field strengths desired for functional MRI (fMRI) using blood oxygenation level-dependent (BOLD) contrast make functional scans sensitive to magnetic field inhomogeneity. If it is not corrected during image reconstruction, field inhomogeneity can cause geometric distortions in the images when Cartesian k-space trajectories are used or blurring with spiral acquisitions. Many traditional methods to correct for field inhomogeneity distortions rely on a static field map measured with the use of images that are themselves distorted. In this work, we employ a regularized least-squares approach to jointly estimate both the undistorted image and field map at each acquisition using a spiral-in/spiral-out pulse sequence. Simulation and phantom studies show that this method is accurate and stable over a time series. Human functional studies show that the jointly estimated field map may be more accurate than standard field map estimates in the presence of respiration-induced phase oscillations, leading to better detection of functional activation. The proposed method measures a dynamic field map that accurately tracks magnetic field drift and respiration-induced phase oscillations during the course of a functional study.

Brain↗

Compensation for nonuniform resolution using penalized-likelihood reconstruction in space-variant imaging systems.

Imaging systems that form estimates using a statistical approach generally yield images with nonuniform resolution properties. That is, the reconstructed images possess resolution properties marked by space-variant and/or anisotropic responses. We have previously developed a space-variant penalty for penalized-likelihood (PL) reconstruction that yields nearly uniform resolution properties. We demonstrated how to calculate this penalty efficiently and apply it to an idealized positron emission tomography (PET) system whose geometric response is space-invariant. In this paper, we demonstrate the efficient calculation and application of this penalty to space-variant systems. (The method is most appropriate when the system matrix has been precalculated.) We apply the penalty to a large field of view PET system where crystal penetration effects make the geometric response space-variant, and to a two-dimensional single photon emission computed tomography system whose detector responses are modeled by a depth-dependent Gaussian with linearly varying full-width at half-maximum. We perform a simulation study comparing reconstructions using our proposed PL approach with other reconstruction methods and demonstrate the relative resolution uniformity, and discuss tradeoffs among estimators that yield nearly uniform resolution. We observe similar noise performance for the PL and post-smoothed maximum-likelihood (ML) approaches with carefully matched resolution, so choosing one estimator over another should be made on other factors like computational complexity and convergence rates of the iterative reconstruction. Additionally, because the postsmoothed ML and the proposed PL approach can outperform one another in terms of resolution uniformity depending on the desired reconstruction resolution, we present and discuss a hybrid approach adopting both a penalty and post-smoothing.

Algorithms↗

Iterative tomographic image reconstruction using Fourier-based forward and back-projectors.

Iterative image reconstruction algorithms play an increasingly important role in modern tomographic systems, especially in emission tomography. With the fast increase of the sizes of the tomographic data, reduction of the computation demands of the reconstruction algorithms is of great importance. Fourier-based forward and back-projection methods have the potential to considerably reduce the computation time in iterative reconstruction. Additional substantial speed-up of those approaches can be obtained utilizing powerful and cheap off-the-shelf fast Fourier transform (FFT) processing hardware. The Fourier reconstruction approaches are based on the relationship between the Fourier transform of the image and Fourier transformation of the parallel-ray projections. The critical two steps are the estimations of the samples of the projection transform, on the central section through the origin of Fourier space, from the samples of the transform of the image, and vice versa for back-projection. Interpolation errors are a limitation of Fourier-based reconstruction methods. We have applied min-max optimized Kaiser-Bessel interpolation within the nonuniform FFT (NUFFT) framework and devised ways of incorporation of resolution models into the Fourier-based iterative approaches. Numerical and computer simulation results show that the min-max NUFFT approach provides substantially lower approximation errors in tomographic forward and back-projection than conventional interpolation methods. Our studies have further confirmed that Fourier-based projectors using the NUFFT approach provide accurate approximations to their space-based counterparts but with about ten times faster computation, and that they are viable candidates for fast iterative image reconstruction.

Algorithms↗

Emission image reconstruction for randoms-precorrected PET allowing negative sinogram values.

Most positron emission tomography (PET) emission scans are corrected for accidental coincidence (AC) events by real-time subtraction of delayed-window coincidences, leaving only the randoms-precorrected data available for image reconstruction. The real-time randoms precorrection compensates in mean for AC events but destroys the Poisson statistics. The exact log-likelihood for randoms-precorrected data is inconvenient, so practical approximations are needed for maximum likelihood or penalized-likelihood image reconstruction. Conventional approximations involve setting negative sinogram values to zero, which can induce positive systematic biases, particularly for scans with low counts per ray. We propose new likelihood approximations that allow negative sinogram values without requiring zero-thresholding. With negative sinogram values, the log-likelihood functions can be nonconcave, complicating maximization; nevertheless, we develop monotonic algorithms for the new models by modifying the separable paraboloidal surrogates and the maximum-likelihood expectation-maximization (ML-EM) methods. These algorithms ascend to local maximizers of the objective function. Analysis and simulation results show that the new shifted Poisson (SP) model is nearly free of systematic bias yet keeps low variance. Despite its simpler implementation, the new SP performs comparably to the saddle-point model which has shown the best performance (as to systematic bias and variance) in randoms-precorrected PET emission reconstruction.

Algorithms↗

Intensity-based image registration using robust correlation coefficients.

The ordinary sample correlation coefficient is a popular similarity measure for aligning images from the same or similar modalities. However, this measure can be sensitive to the presence of "outlier" objects that appear in one image but not the other, such as surgical instruments, the patient table, etc., which can lead to biased registrations. This paper describes an intensity-based image registration technique that uses a robust correlation coefficient as a similarity measure. Relative to the ordinary sample correlation coefficient, the proposed similarity measure reduces the influence of outliers. We also compared the performance of the proposed method with the mutual information-based method. The robust correlation-based method should be useful for image registration in radiotherapy (KeV to MeV X-ray images) and image-guided surgery applications. We have investigated the properties of the proposed method by theoretical analysis, computer simulations, a phantom experiment, and with functional magnetic resonance imaging data.

Algorithms↗

Efficient calculation of resolution and covariance for penalized-likelihood reconstruction in fully 3-D SPECT.

Resolution and covariance predictors have been derived previously for penalized-likelihood estimators. These predictors can provide accurate approximations to the local resolution properties and covariance functions for tomographic systems given a good estimate of the mean measurements. Although these predictors may be evaluated iteratively, circulant approximations are often made for practical computation times. However, when numerous evaluations are made repeatedly (as in penalty design or calculation of variance images), these predictors still require large amounts of computing time. In Stayman and Fessler (2000), we discussed methods for precomputing a large portion of the predictor for shift-invariant system geometries. In this paper, we generalize the efficient procedure discussed in Stayman and Fessler (2000) to shift-variant single photon emission computed tomography (SPECT) systems. This generalization relies on a new attenuation approximation and several observations on the symmetries in SPECT systems. These new general procedures apply to both two-dimensional and fully three-dimensional (3-D) SPECT models, that may be either precomputed and stored, or written in procedural form. We demonstrate the high accuracy of the predictions based on these methods using a simulated anthropomorphic phantom and fully 3-D SPECT system. The evaluation of these predictors requires significantly less computation time than traditional prediction techniques, once the system geometry specific precomputations have been made.

Abdomen↗

Penalized-likelihood image reconstruction for digital holography.

Conventional numerical reconstruction for digital holography using a filter applied in the spatial-frequency domain to extract the primary image may yield suboptimal image quality because of the loss in high-frequency components and interference from other undesirable terms of a hologram. We propose a new numerical reconstruction approach using a statistical technique. This approach reconstructs the complex field of the object from the real-valued hologram intensity data. Because holographic image reconstruction is an ill-posed problem, our statistical technique is based on penalized-likelihood estimation. We develop a Poisson statistical model for this problem and derive an optimization transfer algorithm that monotonically decreases the cost function at each iteration. Simulation results show that our statistical technique has the potential to improve image quality in digital holography relative to conventional reconstruction techniques.

Journal Article↗

Segmentation-free statistical image reconstruction for polyenergetic x-ray computed tomography with experimental validation.

This paper describes a statistical image reconstruction method for x-ray CT that is based on a physical model that accounts for the polyenergetic x-ray source spectrum and the measurement nonlinearities caused by energy-dependent attenuation. Unlike our earlier work, the proposed algorithm does not require pre-segmentation of the object into the various tissue classes (e.g., bone and soft tissue) and allows mixed pixels. The attenuation coefficient of each voxel is modelled as the product of its unknown density and a weighted sum of energy-dependent mass attenuation coefficients. We formulate a penalized-likelihood function for this polyenergetic model and develop an iterative algorithm for estimating the unknown density of each voxel. Applying this method to simulated x-ray CT measurements of objects containing both bone and soft tissue yields images with significantly reduced beam hardening artefacts relative to conventional beam hardening correction methods. We also apply the method to real data acquired from a phantom containing various concentrations of potassium phosphate solution. The algorithm reconstructs an image with accurate density values for the different concentrations, demonstrating its potential for quantitative CT applications.

Absorptiometry, Photon↗

Fast, iterative image reconstruction for MRI in the presence of field inhomogeneities.

In magnetic resonance imaging, magnetic field inhomogeneities cause distortions in images that are reconstructed by conventional fast Fourier trasform (FFT) methods. Several noniterative image reconstruction methods are used currently to compensate for field inhomogeneities, but these methods assume that the field map that characterizes the off-resonance frequencies is spatially smooth. Recently, iterative methods have been proposed that can circumvent this assumption and provide improved compensation for off-resonance effects. However, straightforward implementations of such iterative methods suffer from inconveniently long computation times. This paper describes a tool for accelerating iterative reconstruction of field-corrected MR images: a novel time-segmented approximation to the MR signal equation. We use a min-max formulation to derive the temporal interpolator. Speedups of around 60 were achieved by combining this temporal interpolator with a nonuniform fast Fourier transform with normalized root mean squared approximation errors of 0.07%. The proposed method provides fast, accurate, field-corrected image reconstruction even when the field map is not smooth.

Algorithms↗

Globally convergent image reconstruction for emission tomography using relaxed ordered subsets algorithms.

We present two types of globally convergent relaxed ordered subsets (OS) algorithms for penalized-likelihood image reconstruction in emission tomography: modified block sequential regularized expectation-maximization (BSREM) and relaxed OS separable paraboloidal surrogates (OS-SPS). The global convergence proof of the existing BSREM (De Pierro and Yamagishi, 2001) required a few a posteriori assumptions. By modifying the scaling functions of BSREM, we are able to prove the convergence of the modified BSREM under realistic assumptions. Our modification also makes stepsize selection more convenient. In addition, we introduce relaxation into the OS-SPS algorithm (Erdoğan and Fessler, 1999) that otherwise would converge to a limit cycle. We prove the global convergence of diagonally scaled incremental gradient methods of which the relaxed OS-SPS is a special case; main results of the proofs are from (Nedić and Bertsekas, 2001) and (Correa and Lemaréchal, 1993). Simulation results showed that both new algorithms achieve global convergence yet retain the fast initial convergence speed of conventional unrelaxed ordered subsets algorithms.

Algorithms↗

A penalized-likelihood image reconstruction method for emission tomography, compared to postsmoothed maximum-likelihood with matched spatial resolution.

Regularization is desirable for image reconstruction in emission tomography. A powerful regularization method is the penalized-likelihood (PL) reconstruction algorithm (or equivalently, maximum a posteriori reconstruction), where the sum of the likelihood and a noise suppressing penalty term (or Bayesian prior) is optimized. Usually, this approach yields position-dependent resolution and bias. However, for some applications in emission tomography, a shift-invariant point spread function would be advantageous. Recently, a new method has been proposed, in which the penalty term is tuned in every pixel to impose a uniform local impulse response. In this paper, an alternative way to tune the penalty term is presented. We performed positron emission tomography and single photon emission computed tomography simulations to compare the performance of the new method to that of the postsmoothed maximum-likelihood (ML) approach, using the impulse response of the former method as the postsmoothing filter for the latter. For this experiment, the noise properties of the PL algorithm were not superior to those of postsmoothed ML reconstruction.

Algorithms↗

Relaxed ordered-subset algorithm for penalized-likelihood image restoration.

The expectation-maximization (EM) algorithm for maximum-likelihood image recovery is guaranteed to converge, but it converges slowly. Its ordered-subset version (OS-EM) is used widely in tomographic image reconstruction because of its order-of-magnitude acceleration compared with the EM algorithm, but it does not guarantee convergence. Recently the ordered-subset, separable-paraboloidal-surrogate (OS-SPS) algorithm with relaxation has been shown to converge to the optimal point while providing fast convergence. We adapt the relaxed OS-SPS algorithm to the problem of image restoration. Because data acquisition in image restoration is different from that in tomography, we employ a different strategy for choosing subsets, using pixel locations rather than projection angles. Simulation results show that the relaxed OS-SPS algorithm can provide an order-of-magnitude acceleration over the EM algorithm for image restoration. This new algorithm now provides the speed and guaranteed convergence necessary for efficient image restoration.

Journal Article↗

Clinically feasible reconstruction of 3D whole-body PET/CT data using blurred anatomical labels.

We present the results of utilizing aligned anatomical information from CT images to locally adjust image smoothness during the reconstruction of three-dimensional (3D) whole-body positron emission tomography (PET) data. The ability of whole-body PET imaging to detect malignant neoplasms is becoming widely recognized. Potentially useful, however, is the role of whole-body PET in quantitative estimation of tracer uptake. The utility of PET in oncology is often limited by the high level of statistical noise in the images. Reduction in noise can be obtained by incorporating a priori image smoothness information from correlated anatomical information during the reconstruction of PET data. A combined PET/CT scanner allows the acquisition of accurately aligned PET and x-ray CT whole-body data. We use the Fourier rebinning algorithm (FORE) to accurately convert the 3D PET data to two-dimensional (2D) data to accelerate the image reconstruction process. The 2D datasets are reconstructed with successive over-relaxation of a penalized weighted least squares (PWLS) objective function to model the statistics of the acquisition, data corrections, and rebinning. A 3D voxel label model is presented that incorporates the anatomical information via the penalty weights of the PWLS objective function. This combination of FORE + PWLS + labels was developed as it allows for both reconstruction of 3D whole-body data sets in clinically feasible times and also the inclusion of anatomical information in such a way that convergence can be guaranteed. Since mismatches between anatomical (CT) and functional (PET) data are unavoidable in practice, the labels are 'blurred' to reflect the uncertainty associated with the anatomical information. Simulated and experimental results show the potential advantage of incorporating anatomical information by using blurred labels to calculate the penalty weights. We conclude that while the effect of this method on detection tasks is complicated and unclear, there is an improvement on the estimation task.

Computer Simulation↗

Statistical image reconstruction for polyenergetic X-ray computed tomography.

This paper describes a statistical image reconstruction method for X-ray computed tomography (CT) that is based on a physical model that accounts for the polyenergetic X-ray source spectrum and the measurement nonlinearities caused by energy-dependent attenuation. We assume that the object consists of a given number of nonoverlapping materials, such as soft tissue and bone. The attenuation coefficient of each voxel is the product of its unknown density and a known energy-dependent mass attenuation coefficient. We formulate a penalized-likelihood function for this polyenergetic model and develop an ordered-subsets iterative algorithm for estimating the unknown densities in each voxel. The algorithm monotonically decreases the cost function at each iteration when one subset is used. Applying this method to simulated X-ray CT measurements of objects containing both bone and soft tissue yields images with significantly reduced beam hardening artifacts.

Algorithms↗