Search

Statistical PET image reconstruction methods are often accelerated by the use of a subset of available projections at each iteration. It is known that many subset algorithms, such as ordered subset expectation maximisation, will not converge to a single solution but to a limit cycle. Reconstruction methods exist to relax the update step sizes of subset algorithms to obtain convergence, however, this introduces additional parameters that may result in extended reconstruction times. Another approach is to gradually decrease the number of subsets to reduce the effect of the limit cycle at later iterations, but the optimal iteration numbers for these reductions may be data dependent. We propose an automatic method to increase subset sizes so a reconstruction can take advantage of the acceleration provided by small subset sizes during early iterations, while at later iterations reducing the effects of the limit cycle behaviour providing estimates closer to the maximum a posteriori solution. At each iteration, two image updates are computed from a common estimate using two disjoint subsets. The divergence of the two update vectors is measured and, if too great, subset sizes are increased in future iterations. We show results for both sinogram and list mode data using various subset selection methodologies.