String-averaging expectation-maximization for maximum likelihood estimation in emission tomography


Autoria(s): Helou, Elias Salomao; Censor, Yair; Chen, Tai-Been; Chern, I-Liang; De Pierro, Alvaro Rodolfo; Jiang, Ming; Lu, Henry Horng-Shing
Contribuinte(s)

Universidade Estadual Paulista (UNESP)

Data(s)

03/12/2014

03/12/2014

01/05/2014

Resumo

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Processo FAPESP: 13/16508-3

We study the maximum likelihood model in emission tomography and propose a new family of algorithms for its solution, called string-averaging expectation maximization (SAEM). In the string-averaging algorithmic regime, the index set of all underlying equations is split into subsets, called 'strings', and the algorithm separately proceeds along each string, possibly in parallel. Then, the end-points of all strings are averaged to form the next iterate. SAEM algorithms with several strings present better practical merits than the classical row-action maximum-likelihood algorithm. We present numerical experiments showing the effectiveness of the algorithmic scheme, using data of image reconstruction problems. Performance is evaluated from the computational cost and reconstruction quality viewpoints. A complete convergence theory is also provided.

Formato

20

Identificador

http://dx.doi.org/10.1088/0266-5611/30/5/055003

Inverse Problems. Bristol: Iop Publishing Ltd, v. 30, n. 5, 20 p., 2014.

0266-5611

http://hdl.handle.net/11449/111820

10.1088/0266-5611/30/5/055003

WOS:000336265400003

Idioma(s)

eng

Publicador

Iop Publishing Ltd

Relação

Inverse Problems

Direitos

closedAccess

Palavras-Chave #positron emission tomography (PET) #string-averaging #block-iterative #expectation-maximization (EM) algorithm #ordered subsets expectation maximization (OSEM) algorithm #relaxed EM #string-averaging EM algorithm
Tipo

info:eu-repo/semantics/article