Assessing quantification for the EMS algorithm
From MaRDI portal
Publication:1338498
DOI10.1016/0024-3795(94)90467-7zbMath0811.65140OpenAlexW2025766735MaRDI QIDQ1338498
Geoff A. Latham, Robert S. Anderssen
Publication date: 2 May 1995
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(94)90467-7
reconstruction problemPerron-Frobenius theoryexclusion regionsemission tomographyestimate, maximize and smoothEMS algorithmsglobal compressionnon-negative irreducible smoothingreconstruction rangeweighted averaging procedure
Related Items (5)
Unnamed Item ⋮ Statistical methodology for inverse problems ⋮ On maximal entries in the principal eigenvector of graphs ⋮ Accelerating the EM algorithm by smoothing: A special case ⋮ Eigenvectors and eigenvalues of non-regular graphs
Cites Work
- Some properties of adding a smoothing step to the EM algorithm
- The theorems of Ledermann and Ostrowski on positive matrices
- A hyperplane approach to the EMS algorithm
- Note on the Fundamental Theorem on Irreducible Non-Negative Matrices
- On the Eigenvector belonging to the Maximal Root of a Non-negative Matrix
- Matrix Analysis
- On the stabilization inherent in the EMS algorithm
- A Statistical Model for Positron Emission Tomography
- On the Maximal Eigenvector of a Positive Matrix
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Assessing quantification for the EMS algorithm