Regularization parameter selection and an efficient algorithm for total variation-regularized positron emission tomography

  • Authors:
  • Johnathan M. Bardsley;John Goldes

  • Affiliations:
  • Department of Mathematical Sciences, University of Montana, Missoula, USA 59812-0864;Department of Mathematical Sciences, University of Montana, Missoula, USA 59812-0864

  • Venue:
  • Numerical Algorithms
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In positron emission tomography, image data corresponds to measurements of emitted photons from a radioactive tracer in the subject. Such count data is typically modeled using a Poisson random variable, leading to the use of the negative-log Poisson likelihood fit-to-data function. Regularization is needed, however, in order to guarantee reconstructions with minimal artifacts. Given that tracer densities are primarily smoothly varying, but also contain sharp jumps (or edges), total variation regularization is a natural choice. However, the resulting computational problem is quite challenging. In this paper, we present an efficient computational method for this problem. Convergence of the method has been shown for quadratic regularization functions and here convergence is shown for total variation regularization. We also present three regularization parameter choice methods for use on total variation-regularized negative-log Poisson likelihood problems. We test the computational and regularization parameter selection methods on two synthetic data sets.