Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Accelerated strategy for the MLEM algorithm

Accelerated strategy for the MLEM algorithm BACKGROUND:A statistical method called maximum likelihood expectation maximization (MLEM) is quite attractive, especially in PET/SPECT. However, the convergence rate of the iterative scheme of MLEM is quite slow.OBJECTIVE:This study aims to develop and test a new method to speed up the convergence rate of the MLEM algorithm.METHODS:We introduce a relaxation parameter in the conventional MLEM iterative formula and propose the relaxation strategy on the condition that the spectral radius of the derived iterative matrix from the iterative scheme with the accelerated parameter reaches a minimum value.RESULTS:Experiments with Shepp-Logan phantom and an annual tree image demonstrate that the new computational strategy effectively accelerates computation time while maintains reasonable image quality.CONCLUSIONS:The proposed new computational method involving the relaxation strategy has a faster convergence speed than the original method. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of X-Ray Science and Technology IOS Press

Accelerated strategy for the MLEM algorithm

Loading next page...
 
/lp/ios-press/accelerated-strategy-for-the-mlem-algorithm-Wf71v6sJX2

References (14)

Publisher
IOS Press
Copyright
Copyright © 2021 © 2021 – IOS Press. All rights reserved
ISSN
0895-3996
eISSN
1095-9114
DOI
10.3233/XST-200749
Publisher site
See Article on Publisher Site

Abstract

BACKGROUND:A statistical method called maximum likelihood expectation maximization (MLEM) is quite attractive, especially in PET/SPECT. However, the convergence rate of the iterative scheme of MLEM is quite slow.OBJECTIVE:This study aims to develop and test a new method to speed up the convergence rate of the MLEM algorithm.METHODS:We introduce a relaxation parameter in the conventional MLEM iterative formula and propose the relaxation strategy on the condition that the spectral radius of the derived iterative matrix from the iterative scheme with the accelerated parameter reaches a minimum value.RESULTS:Experiments with Shepp-Logan phantom and an annual tree image demonstrate that the new computational strategy effectively accelerates computation time while maintains reasonable image quality.CONCLUSIONS:The proposed new computational method involving the relaxation strategy has a faster convergence speed than the original method.

Journal

Journal of X-Ray Science and TechnologyIOS Press

Published: Feb 19, 2021

There are no references for this article.