Scalable Bayesian uncertainty quantification in imaging inverse problems via convex optimization
From MaRDI portal
Abstract: We propose a Bayesian uncertainty quantification method for large-scale imaging inverse problems. Our method applies to all Bayesian models that are log-concave, where maximum-a-posteriori (MAP) estimation is a convex optimization problem. The method is a framework to analyse the confidence in specific structures observed in MAP estimates (e.g., lesions in medical imaging, celestial sources in astronomical imaging), to enable using them as evidence to inform decisions and conclusions. Precisely, following Bayesian decision theory, we seek to assert the structures under scrutiny by performing a Bayesian hypothesis test that proceeds as follows: firstly, it postulates that the structures are not present in the true image, and then seeks to use the data and prior knowledge to reject this null hypothesis with high probability. Computing such tests for imaging problems is generally very difficult because of the high dimensionality involved. A main feature of this work is to leverage probability concentration phenomena and the underlying convex geometry to formulate the Bayesian hypothesis test as a convex problem, that we then efficiently solve by using scalable optimization algorithms. This allows scaling to high-resolution and high-sensitivity imaging problems that are computationally unaffordable for other Bayesian computation approaches. We illustrate our methodology, dubbed BUQO (Bayesian Uncertainty Quantification by Optimization), on a range of challenging Fourier imaging problems arising in astronomy and medicine.
Recommendations
- Maximum-a-posteriori estimation with Bayesian confidence regions
- A proximal Markov chain Monte Carlo method for Bayesian inference in imaging inverse problems: when Langevin meets Moreau
- Bayesian inference and uncertainty quantification for medical image reconstruction with Poisson data
- Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau
- Fast algorithms for Bayesian uncertainty quantification in large-scale linear inverse problems based on low-rank partial Hessian approximations
Cites work
- A block coordinate variable metric forward-backward algorithm
- A class of randomized primal-dual algorithms for distributed optimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A monotone+skew splitting model for composite monotone inclusions in duality
- A nonlocal Bayesian image denoising algorithm
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A wavelet tour of signal processing. The sparse way.
- Alternating projection methods.
- An algorithm for total variation minimization and applications
- An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
- An introduction to continuous optimization for imaging
- Collaborative sparse regression using spatially correlated supports - Application to hyperspectral unmixing
- Compressed sensing
- Compressive sampling
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Dykstra's alternating projection algorithm for two sets
- Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau
- Estimating the Granularity Coefficient of a Potts-Markov Random Field Within a Markov Chain Monte Carlo Algorithm
- scientific article; zbMATH DE number 65765 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- scientific article; zbMATH DE number 3230744 (Why is no real title available?)
- iPiano: inertial proximal algorithm for nonconvex optimization
- Large‐Scale Inverse Problems and Quantification of Uncertainty
- Maximum-a-posteriori estimation with Bayesian confidence regions
- Nonlinear total variation based noise removal algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Markov chain Monte Carlo algorithms
- Proximal splitting methods in signal processing
- Proximity for sums of composite functions
- Proximity Maps for Convex Sets
- Should Penalized Least Squares Regression be Interpreted as Maximum A Posteriori Estimation?
- Signal Recovery by Proximal Forward-Backward Splitting
- Solving coupled composite monotone inclusions by successive Fejér approximations of their Kuhn-Tucker set
- The Bayesian Choice
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
Cited in
(18)- Proximal nested sampling for high-dimensional Bayesian model selection
- Accelerating Proximal Markov Chain Monte Carlo by Using an Explicit Stabilized Method
- BUQO
- Patch-based image restoration using expectation propagation
- Bayesian Imaging Using Plug & Play Priors: When Langevin Meets Tweedie
- Bayesian inference and uncertainty quantification for medical image reconstruction with Poisson data
- Representation and reconstruction of covariance operators in linear inverse problems
- Solving inverse problems using data-driven models
- Maximum-a-posteriori estimation with Bayesian confidence regions
- The Split Gibbs Sampler Revisited: Improvements to Its Algorithmic Structure and Augmented Target Distribution
- On maximum a posteriori estimation with Plug \& Play priors and stochastic gradient descent
- Efficient Bayesian Computation for Low-Photon Imaging Problems
- Posterior-Variance-Based Error Quantification for Inverse Problems in Imaging
- Accelerated Bayesian imaging by relaxed proximal-point Langevin sampling
- Multi-scale CLEAN for Fourier-based hard x-ray solar imaging
- Uncertainty quantification for scale-space blob detection
- Sampling strategies in Bayesian inversion: a study of RTO and Langevin methods
- A plug-and-play method with inpainting network for Bayesian uncertainty quantification in imaging
This page was built for publication: Scalable Bayesian uncertainty quantification in imaging inverse problems via convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236633)
