You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/111820
Title: 
String-averaging expectation-maximization for maximum likelihood estimation in emission tomography
Author(s): 
Institution: 
  • Universidade Estadual Paulista (UNESP)
  • Univ Haifa
  • I Shou Univ
  • Natl Chiao Tung Univ
  • Natl Taiwan Univ
  • Peking Univ
ISSN: 
0266-5611
Sponsorship: 
  • Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
  • United States-Israel Binational Science Foundation (BSF)
  • US Department of Army award
  • National Science Council of the Republic of China, Taiwan
  • National Center for Theoretical Sciences (Taipei Office)
  • National Science Council of the Republic of China
  • Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
  • National Basic Research and Development Program of China (973 Program)
  • National Science Foundation of China
  • National Science Council
  • National Center for Theoretical Sciences
  • Center of Mathematical Modeling and Scientific Computing at National Chiao Tung University in Taiwan
Sponsorship Process Number: 
  • FAPESP: 13/16508-3
  • United States-Israel Binational Science Foundation (BSF)200912
  • US Department of Army awardW81XWH-10-1-0170
  • National Science Council of the Republic of China, TaiwanNSC 97-2118-M-214-001-MY2
  • National Science Council of the Republic of ChinaNSC 99-2115-M-002-003-MY3
  • CNPq: 301064/2009-1
  • National Basic Research and Development Program of China (973 Program)2011CB809105
  • National Science Foundation of China61121002
  • National Science Foundation of China10990013
  • National Science Foundation of China60325101
Abstract: 
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.
Issue Date: 
1-May-2014
Citation: 
Inverse Problems. Bristol: Iop Publishing Ltd, v. 30, n. 5, 20 p., 2014.
Time Duration: 
20
Publisher: 
Iop Publishing Ltd
Keywords: 
  • positron emission tomography (PET)
  • string-averaging
  • block-iterative
  • expectation-maximization (EM) algorithm
  • ordered subsets expectation maximization (OSEM) algorithm
  • relaxed EM
  • string-averaging EM algorithm
Source: 
http://dx.doi.org/10.1088/0266-5611/30/5/055003
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/111820
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.