ICASSP 2020accepted0 citations

Online Positron Emission Tomography By Online Portfolio Selection

Yen-Huan Li

Abstract

The number of measurement outcomes in positron emission tomography (PET) is typically large, rendering signal reconstruction computationally expensive. We propose an online algorithm to address this computational issue. The per-iteration computational complexity of the proposed algorithm is independent of the number of measurement outcomes and linear <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">√</sub> in the signal dimension. The algorithm has a rigorous $O\left( {1/\sqrt k } \right)$ convergence rate guarantee, where k denotes the iteration counter. Numerical experiments on synthetic data-sets show that the algorithm can be significantly faster than expectation maximization and stochastic primal-dual hybrid gradient method. The proposed algorithm is based on an equivalent stochastic optimization formulation, the Soft-Bayes algorithm for online portfolio selection, and standard online-to-batch conversion.

BibTeX
@inproceedings{icassp2020_onlinepositronem,
  title = {Online Positron Emission Tomography By Online Portfolio Selection},
  author = {Yen-Huan Li},
  booktitle = {ICASSP 2020},
  year = {2020}
}