Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms
Abstract We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization (ML-EM) algorithm. In this study, we extend these algorithms to Bayesian algorithms. The family of emission-EM-lookalike algorithms utilizes a multiplica...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-11-01
|
| Series: | Visual Computing for Industry, Biomedicine, and Art |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s42492-019-0027-4 |
| _version_ | 1818530313241886720 |
|---|---|
| author | Gengsheng L. Zeng Ya Li |
| author_facet | Gengsheng L. Zeng Ya Li |
| author_sort | Gengsheng L. Zeng |
| collection | DOAJ |
| description | Abstract We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization (ML-EM) algorithm. In this study, we extend these algorithms to Bayesian algorithms. The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme. The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor, which contains the Bayesian information. One of the extended algorithms can be applied to emission tomography and another to transmission tomography. Computer simulations are performed and compared with the corresponding un-extended algorithms. The total-variation norm is employed as the Bayesian constraint in the computer simulations. The newly developed algorithms demonstrate a stable performance. A simple Bayesian algorithm can be derived for any noise variance function. The proposed algorithms have properties such as multiplicative updating, non-negativity, faster convergence rates for bright objects, and ease of implementation. Our algorithms are inspired by Green’s one-step-late algorithm. If written in additive-update form, Green’s algorithm has a step size determined by the future image value, which is an undesirable feature that our algorithms do not have. |
| first_indexed | 2024-12-11T17:18:07Z |
| format | Article |
| id | doaj.art-66891ba7a1f74028986132e3790c9ea2 |
| institution | Directory Open Access Journal |
| issn | 2524-4442 |
| language | English |
| last_indexed | 2024-12-11T17:18:07Z |
| publishDate | 2019-11-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | Visual Computing for Industry, Biomedicine, and Art |
| spelling | doaj.art-66891ba7a1f74028986132e3790c9ea22022-12-22T00:57:14ZengSpringerOpenVisual Computing for Industry, Biomedicine, and Art2524-44422019-11-012111010.1186/s42492-019-0027-4Extension of emission expectation maximization lookalike algorithms to Bayesian algorithmsGengsheng L. Zeng0Ya Li1Department of Engineering, Utah Valley UniversityDepartment of Mathematics, Utah Valley UniversityAbstract We recently developed a family of image reconstruction algorithms that look like the emission maximum-likelihood expectation-maximization (ML-EM) algorithm. In this study, we extend these algorithms to Bayesian algorithms. The family of emission-EM-lookalike algorithms utilizes a multiplicative update scheme. The extension of these algorithms to Bayesian algorithms is achieved by introducing a new simple factor, which contains the Bayesian information. One of the extended algorithms can be applied to emission tomography and another to transmission tomography. Computer simulations are performed and compared with the corresponding un-extended algorithms. The total-variation norm is employed as the Bayesian constraint in the computer simulations. The newly developed algorithms demonstrate a stable performance. A simple Bayesian algorithm can be derived for any noise variance function. The proposed algorithms have properties such as multiplicative updating, non-negativity, faster convergence rates for bright objects, and ease of implementation. Our algorithms are inspired by Green’s one-step-late algorithm. If written in additive-update form, Green’s algorithm has a step size determined by the future image value, which is an undesirable feature that our algorithms do not have.http://link.springer.com/article/10.1186/s42492-019-0027-4Image reconstructionTomographyIterative reconstruction algorithm |
| spellingShingle | Gengsheng L. Zeng Ya Li Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms Visual Computing for Industry, Biomedicine, and Art Image reconstruction Tomography Iterative reconstruction algorithm |
| title | Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms |
| title_full | Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms |
| title_fullStr | Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms |
| title_full_unstemmed | Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms |
| title_short | Extension of emission expectation maximization lookalike algorithms to Bayesian algorithms |
| title_sort | extension of emission expectation maximization lookalike algorithms to bayesian algorithms |
| topic | Image reconstruction Tomography Iterative reconstruction algorithm |
| url | http://link.springer.com/article/10.1186/s42492-019-0027-4 |
| work_keys_str_mv | AT gengshenglzeng extensionofemissionexpectationmaximizationlookalikealgorithmstobayesianalgorithms AT yali extensionofemissionexpectationmaximizationlookalikealgorithmstobayesianalgorithms |