An accelerated preconditioned proximal gradient algorithm with a generalized Nesterov momentum for PET image reconstruction

This paper presents an accelerated preconditioned proximal gradient algorithm (APPGA) for effectively solving a class of positron emission tomography (PET) image reconstruction models with differentiable regularizers. We establish the convergence of APPGA with the generalized Nesterov (GN) momentum...

Full description

Saved in:
Bibliographic Details
Published in:Inverse problems Vol. 41; no. 4
Main Authors: Lin, Yizun, He, Yongxin, Schmidtlein, C Ross, Han, Deren
Format: Journal Article
Language:English
Published: England 30.04.2025
Subjects:
image reconstruction
total variation
positron emission tomography
accelerated preconditioned proximal gradient algorithm
ISSN:0266-5611
Online Access:Get more information
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an accelerated preconditioned proximal gradient algorithm (APPGA) for effectively solving a class of positron emission tomography (PET) image reconstruction models with differentiable regularizers. We establish the convergence of APPGA with the generalized Nesterov (GN) momentum scheme, demonstrating its ability to converge to a minimizer of the objective function with rates of and in terms of the function value and the distance between consecutive iterates, respectively, where is the power parameter of the GN momentum. To achieve an efficient algorithm with high-order convergence rate for the higher-order isotropic total variation (ITV) regularized PET image reconstruction model, we replace the ITV term by its smoothed version and subsequently apply APPGA to solve the smoothed model. Numerical results presented in this work indicate that as increase, APPGA converges at a progressively faster rate. Furthermore, APPGA exhibits superior performance compared to the preconditioned proximal gradient algorithm and the preconditioned Krasnoselskii-Mann algorithm. The extension of the GN momentum technique for solving a more complex optimization model with multiple nondifferentiable terms is also discussed.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0266-5611
DOI:10.1088/1361-6420/adbd6a