SearcharxivSearch

arXiv · 1808.09552

Variational Bayesian Approach and Gauss-Markov-Potts prior model

Abstract

In many inverse problems such as 3D X-ray Computed Tomography (CT), the estimation of an unknown quantity, such as a volume or an image, can be greatly enhanced, compared to maximum-likelihood techniques, by incorporating a prior model on the quantity to reconstruct. A complex prior can be designed for multi-channel estimation such as reconstruction and segmentation thanks to Gauss-Markov-Potts prior model. For very large inverse problems such as 3D X-ray CT, maximization a posteriori (MAP) techniques are often used due to the huge size of the data and the unknown. Nevertheless, MAP estimation does not enable to have quantify uncertainties on the retrieved reconstruction, which can be useful for post-reconstruction processes for instance in industry and medicine. A way to tackle the problem of uncertainties estimation is to compute posterior mean (PM) for which the uncertainties are the variances of the posterior distribution. Because MCMC methods are not affordable for very large 3D problems, this paper presents an algorithm to jointly estimate the reconstruction and the uncertainties by computing PM thanks to variational Bayesian approach (VBA). The prior model we consider for the unknowns is a Gauss-Markov-Potts prior which has been shown to give good results in many inverse problems. After having detailed the used prior models, the algorithm based on VBA is detailed : it corresponds to an iterative computation ofapproximate distributions through the iterative updates of their parameters. The updating formulae are given in the last section. We also provide a method for initialization of the algorithm, as a method to fix each parameter. Perspectives are applications of this algorithm to large 3D problems such as 3D X-ray CT.

Explore related subjects

Keep this discovery

BibTeXRIS

Camille Chapdelaine. 2018-08-28. Variational Bayesian Approach and Gauss-Markov-Potts prior model. https://arxiv.org/abs/1808.09552

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO