A guaranteed convergence analysis for the projected fast iterative soft-thresholding algorithm in parallel MRI

Xinlin Zhang

doi:10.1016/j.media.2021.101987

A guaranteed convergence analysis for the projected fast iterative soft-thresholding algorithm in parallel MRI

2021-04-01

29

OA

AI

DOI：10.1016/j.media.2021.101987

Original

Original request for help

Save

Abstract

En 中文

Sparse sampling and parallel imaging techniques are two effective approaches to alleviate the lengthy magnetic resonance imaging (MRI) data acquisition problem. Promising data recoveries can be obtained from a few MRI samples with the help of sparse reconstruction models. To solve the optimization models, proper algorithms are indispensable. The pFISTA, a simple and efficient algorithm, has been successfully extended to parallel imaging. However, its convergence criterion is still an open question. Besides, the existing convergence criterion of single-coil pFISTA cannot be applied to the parallel imaging pFISTA, which, therefore, imposes confusions and difficulties on users about determining the only parameter -step size. In this work, we provide the guaranteed convergence analysis of the parallel imaging version pFISTA to solve the two well-known parallel imaging reconstruction models, SENSE and SPIRiT. Along with the convergence analysis, we provide recommended step size values for SENSE and SPIRiT reconstructions to obtain fast and promising reconstructions. Experiments on in vivo brain images demonstrate the validity of the convergence criterion. (c) 2021 Elsevier B.V. All rights reserved.

Keywords:

Parallel imaging

Image reconstruction

pFISTA

Convergence analysis

A guaranteed convergence analysis for the projected fast iterative soft-thresholding algorithm in parallel MRI

Abstract

Journal

Organization