An algorithm for maximum entropy image reconstruction from noisy data
From MaRDI portal
Publication:582945
DOI10.1016/0895-7177(89)90358-0zbMath0691.68102OpenAlexW2005678300MaRDI QIDQ582945
Publication date: 1989
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(89)90358-0
image processingconvex programmingimage reconstructionBayes ruleBregman's methodmaximum a posteriori probability
Convex programming (90C25) Computing methodologies and applications (68U99) Measures of information, entropy (94A17)
Related Items (8)
Estimation of asset demands by heterogeneous agents ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS ⋮ Re-examination of Bregman functions and new properties of their divergences ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ Interpolation and approximation by monotone cubic splines ⋮ Tomographic analysis of sign-altering functions by maximum entropy method ⋮ Parallel computing with block-iterative image reconstruction algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A cross validated Bayesian retrieval algorithm for nonlinear remote sensing experiments
- A relaxed version of Bregman's method for convex programming
- An iterative row-action method for interval convex programming
- On some methods for entropy maximization and matrix scaling
- Entropy in linear programs
- Mathematical optimization versus practical performance: A case study based on the maximum entropy criterion in image reconstruction
- Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
This page was built for publication: An algorithm for maximum entropy image reconstruction from noisy data
