The use of scattered coincidences for attenuation correction of positron
emission tomography (PET) data has recently been proposed. For practical
applications, convergence speeds require further improvement, yet there exists a
trade-off between convergence speed and the risk of non-convergence. In this
respect, a maximum-likelihood gradient-ascent (MLGA) algorithm and a two-branch
back-projection (2BP), which was previously proposed, were evaluated.
Methods
MLGA was combined with the Armijo step size rule; and accelerated
using conjugate gradients, Nesterov’s momentum method, and data
subsets of different sizes. In 2BP, we varied the subset size, an important
determinant of convergence speed and computational burden. We used three
sets of simulation data to evaluate the impact of a spatial scale
factor.
Results and discussion
The Armijo step size allowed 10-fold increased step sizes compared to
native MLGA. Conjugate gradients and Nesterov momentum lead to slightly
faster, yet non-uniform convergence; improvements were mostly confined to
later iterations, possibly due to the non-linearity of the problem. MLGA
with data subsets achieved faster, uniform, and predictable convergence,
with a speed-up factor equivalent to the number of subsets and no increase
in computational burden. By contrast, 2BP computational burden increased
linearly with the number of subsets due to repeated evaluation of the
objective function, and convergence was limited to the case of many (and
therefore small) subsets, which resulted in high computational burden.
Conclusion
Possibilities of improving 2BP appear limited. While general-purpose
acceleration methods appear insufficient for MLGA, results suggest that data
subsets are a promising way of improving MLGA performance.