An automatic algorithm to exploit the symmetries of the system response matrix in positron emission tomography iterative reconstruction

Positron emission tomography (PET) iterative 3D reconstruction is a very computational demanding task. One of the main issues of the iterative reconstruction concerns the management of the system response matrix (SRM). The SRM models the relationship between the projection and the voxel space and its memory footprint can easily exceed hundreds of GB. Moreover, in order to make the reconstruction fast enough not to hinder its practical application, the SRM must be stored in the random access memory of the workstation used for the reconstruction. This issue is normally solved by implementing efficient storage schemes and by reducing the number of redundant patterns in the SRM through symmetries. However, finding a sufficient number of symmetries is often non-trivial and is typically performed using dedicated solutions that cannot be exported to different detectors and geometries. In this paper, an automatic approach to reduce the memory footprint of a pre-computed SRM is described. The proposed approach was named symmetry search algorithm (SSA) and consists in an algorithm that searches for some of the redundant patterns present in the SRM, leading to its lossy compression. This approach was built to detect translations, reflections and coordinates swap in voxel space. Therefore, it is particularly well suited for those scanners where some of the rotational symmetries are broken, e.g. small animal scanner where the modules are arranged in a polygonal ring made of few elements, and dual head planar PET systems. In order to validate this approach, the SSA is applied to the SRM of a preclinical scanner (the IRIS PET/CT). The data acquired by the scanner were reconstructed with a dedicated maximum likelihood estimation maximization algorithm with both the uncompressed and the compressed SRMs. The results achieved show that the information lost due to the SSA compression is negligible. Compression factors up to 52 when using the SSA together with manually inserted symmetries and up to 204 when using the SSA alone, can be obtained for the IRIS SRM. These results come without significant differences in the values and in the main quality metrics of the reconstructed images, i.e. spatial resolution and noise. Although the compression factors depend on the system considered, the SSA is applicable to any SRM and therefore it can be considered a general tool to reduce the footprint of a pre-computed SRM.

Acceleration of image-based resolution modelling reconstruction using an expectation maximization nested algorithm

Recent studies have demonstrated the benefits of a resolution model within iterative reconstruction algorithms in an attempt to account for effects that degrade the spatial resolution of the reconstructed images. However, these algorithms suffer from slower convergence rates, compared to algorithms where no resolution model is used, due to the additional need to solve an image deconvolution problem. In this paper, a recently proposed algorithm, which decouples the tomographic and image deconvolution problems within an image-based expectation maximization (EM) framework, was evaluated. This separation is convenient, because more computational effort can be placed on the image deconvolution problem and therefore accelerate convergence. Since the computational cost of solving the image deconvolution problem is relatively small, multiple image-based EM iterations do not significantly increase the overall reconstruction time. The proposed algorithm was evaluated using 2D simulations, as well as measured 3D data acquired on the high-resolution research tomograph. Results showed that bias reduction can be accelerated by interleaving multiple iterations of the image-based EM algorithm solving the resolution model problem, with a single EM iteration solving the tomographic problem. Significant improvements were observed particularly for voxels that were located on the boundaries between regions of high contrast within the object being imaged and for small regions of interest, where resolution recovery is usually more challenging. Minor differences were observed using the proposed nested algorithm, compared to the single iteration normally performed, when an optimal number of iterations are performed for each algorithm. However, using the proposed nested approach convergence is significantly accelerated enabling reconstruction using far fewer tomographic iterations (up to 70% fewer iterations for small regions). Nevertheless, the optimal number of nested image-based EM iterations is hard to be defined and it should be selected according to the given application.