Grouped-Coordinate Ascent Algorithms for Penalized-Likelihood Transmission Image Reconstruction

Presents a new class of algorithms for penalized-likelihood reconstruction of attenuation maps from low-count transmission scans. We derive the algorithms by applying to the transmission log-likelihood a version of the convexity technique developed by De Pierro for emission tomography. The new class includes the single-coordinate ascent (SCA) algorithm and Lange's convex algorithm for transmission tomography as special cases. The new grouped-coordinate ascent (GCA) algorithms in the class overcome several limitations associated with previous algorithms. (1) Fewer exponentiations are required than in the transmission maximum likelihood-expectation maximization (ML-EM) algorithm or in the SCA algorithm. (2) The algorithms intrinsically accommodate nonnegativity constraints, unlike many gradient-based methods. (3) The algorithms are easily parallelizable, unlike the SCA algorithm and perhaps line-search algorithms. We show that the GCA algorithms converge faster than the SCA algorithm, even on conventional workstations. An example from a low-count positron emission tomography (PET) transmission scan illustrates the method.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/86021/1/Fessler93.pd

Fully 3D PET Image Reconstruction Using A Fourier Preconditioned Conjugate-Gradient Algorithm

Since the data sixes in fully 3D PET imaging are very large, iterative image reconstruction algorithms must converge in very few iterations to be useful. One can improve the convergence rate of the conjugate-gradient (CG) algorithm by incorporating preconditioning operators that approximate the inverse of the Hessian of the objective function. If the 3D cylindrical PET geometry were not truncated at the ends, then the Hessian of the penalized least-squares objective function would be approximately shift-invariant, i.e. G'G would be nearly block-circulant, where G is the system matrix. The authors propose a Fourier preconditioner based on this shift-invariant approximation to the Hessian. Results show that this preconditioner significantly accelerates the convergence of the CG algorithm with only a small increase in computation.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/86015/1/Fessler139.pd

A Paraboloidal Surrogates Algorithm for Convergent Penalized-Likelihood Emission Image Reconstruction

We present a new algorithm for penalized-likelihood emission image reconstruction. The algorithm monotonically increases the objective function, converges globally to the unique maximizer, and easily accommodates the nonnegativity constraint and nonquadratic but convex penalty functions. The algorithm is based on finding paraboloidal surrogate functions for the log-likelihood at each iteration: quadratic functions that are tangent to the log-likelihood at the current image estimate, and lie below the log-likelihood over the entire nonnegative orthant. These conditions ensure monotonicity. The paraboloidal surrogates are maximized easily using existing algorithms such as coordinate ascent. Simulation results show that the proposed algorithm converges faster than the SAGE algorithm, yet the new algorithm is somewhat easier to implement.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/85943/1/Fessler152.pd

Preconditioning Methods for Shift-Variant Image Reconstruction

Preconditioning methods can accelerate the convergence of gradient-based iterative methods for tomographic image reconstruction and image restoration. Circulant preconditioners have been used extensively for shift-invariant problems. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. For inverse problems that are approximately shift-invariant (i.e. approximately block-Toeplitz or block-circulant Hessians), circulant or Fourier-based preconditioners can provide remarkable acceleration. However, in applications with nonuniform noise variance (such as arises from Poisson statistics in emission tomography and in quantum-limited optical imaging), the Hessian of the (penalized) weighted least-squares objective function is quite shift-variant, and the Fourier preconditioner performs poorly. Additional shift-variance is caused by edge-preserving regularization methods based on nonquadratic penalty functions. This paper describes new preconditioners that more accurately approximate the Hessian matrices of shift-variant imaging problems. Compared to diagonal or Fourier preconditioning, the new preconditioners lead to significantly faster convergence rates for the unconstrained conjugate-gradient (CG) iteration. Applications to position emission tomography (PET) illustrate the method.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/85856/1/Fessler147.pd

Accelerated Monotonic Algorithms for Transmission Tomography

We present a framework for designing fast and monotonic algorithms for transmission tomography penalized likelihood image reconstruction. The new algorithms are based on paraboloidal surrogate functions for the log-likelihood. Due to the form of the log-likelihood function, it is possible to find low curvature surrogate functions that guarantee monotonicity. Unlike previous methods, the proposed surrogate functions lead to monotonic algorithms even for the nonconvex log-likelihood that arises due to background events such as scatter and random coincidences. The gradient and the curvature of the likelihood terms are evaluated only once per iteration. Since the problem is simplified, the CPU time per iteration is less than that of current algorithms which directly minimize the objective, yet the convergence rate is comparable. The simplicity, monotonicity and speed of the new algorithms are quite attractive. The convergence rates of the algorithms are demonstrated using real PET transmission scans.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/85953/1/Fessler149.pd

Statistical Image Reconstruction Methods for Simultaneous Emission/Transmission PET Scans

Transmission scans are necessary for estimating the attenuation correction factors (ACFs) to yield quantitatively accurate PET emission images. To reduce the total scan time, post-injection transmission scans have been proposed in which one can simultaneously acquire emission and transmission data using rod sources and sinogram windowing. However, since the post-injection transmission scans are corrupted by emission coincidences, accurate correction for attenuation becomes more challenging. Conventional methods (emission subtraction) for ACF computation from post-injection scans are suboptimal and require relatively long scan times. The authors introduce statistical methods based on penalized-likelihood objectives to compute ACFs and then use them to reconstruct lower noise PET emission images from simultaneous transmission/emission scans. Simulations show the efficacy of the proposed methods. These methods improve image quality and SNR of the estimates as compared to conventional methods.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/85896/1/Fessler140.pd

New statistical models for randoms-precorrected PET scans

PET measurements are usually precorrected for accidental coincidence events by real-time subtraction of the delayed window coincidences. Randoms subtraction compensates in mean for accidental coincidences but destroys the Poisson statistics. We propose and analyze two new approximations to the exact log-likelihood of the precorrected measurements, one based on a "shifted Poisson" model, the other based on saddle-point approximations to the measurement probability mass function (pmf). The methods apply to both emission and transmission tomography; however in this paper we focus on transmission tomography. We compare the new models to conventional data-weighted least squares (WLS) and conventional maximum likelihood (based on the ordinary Poisson (OP) model) using simulations and analytic approximations. The results demonstrate that the proposed methods avoid the systematic bias of the WLS method, and lead to significantly lower variance than the conventional OP method. The saddle-point method provides a more accurate approximation to the exact log-likelihood than the WLS, OP and shifted Poisson alternatives. However, the simpler shifted Poisson method yielded comparable bias-variance performance in the simulations. The new methods offer improved image reconstruction in PET through more realistic statistical modeling, yet with negligible increase in computation over the conventional OP method.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/85945/1/Fessler92.pd

Statistical X-Ray-Computed Tomography Image Reconstruction with Beam- Hardening Correction

This paper describes two statistical iterative reconstruction methods for X-ray CT. The rst method assumes a mono-energetic model for X-ray attenuation. We approximate the transmission Poisson likelihood by a quadratic cost function and exploit its convexity to derive a separable quadratic surrogate function that is easily minimized using parallelizable algorithms. Ordered subsets are used to accelerate convergence. We apply this mono-energetic algorithm (with edge-preserving regularization) to simulated thorax X-ray CT scans. A few iterations produce reconstructed images with lower noise than conventional FBP images at equivalent resolutions. The second method generalizes the physical model and accounts for the poly-energetic X-ray source spectrum and the measurement nonlinearities caused by energy-dependent attenuation. We assume the object consists of a given number of nonoverlapping tissue types. The attenuation coeÆcient of each tissue is the product of its unknown density and a known energy-dependent mass attenuation coeÆcient. We formulate a penalized-likelihood function for this polyenergetic model and develop an iterative algorithm for estimating the unknown densities in each voxel. Applying this method to simulated X-ray CT measurements of a phantom containing both bone and soft tissue yields images with signi cantly reduced beam hardening artifacts.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/85939/1/Fessler165.pd

Fourier-Based Forward and Back-Projectors in Iterative Fan-Beam Tomographic Image Reconstruction

Fourier-based forward and back-projection methods can reduce computation in iterative tomographic image reconstruction. Recently, an optimized nonuniform fast Fourier transform (NUFFT) approach was shown to yield accurate parallel-beam projections. In this paper, we extend the NUFFT approach to describe an O(N2 log N) projector/backprojector pair for fan-beam transmission tomography. Simulations and experiments with real CT data show that fan-beam Fourier-based forward and back-projection methods can reduce computation for iterative reconstruction while still providing accuracy comparable to their O(N3) space-based counterparts.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/86013/1/Fessler45.pd

Joint Image Reconstruction and Segmentation Using the Potts Model

We propose a new algorithmic approach to the non-smooth and non-convex Potts problem (also called piecewise-constant Mumford-Shah problem) for inverse imaging problems. We derive a suitable splitting into specific subproblems that can all be solved efficiently. Our method does not require a priori knowledge on the gray levels nor on the number of segments of the reconstruction. Further, it avoids anisotropic artifacts such as geometric staircasing. We demonstrate the suitability of our method for joint image reconstruction and segmentation. We focus on Radon data, where we in particular consider limited data situations. For instance, our method is able to recover all segments of the Shepp-Logan phantom from $7$ angular views only. We illustrate the practical applicability on a real PET dataset. As further applications, we consider spherical Radon data as well as blurred data