Maximum likelihood estimation of regularisation parameters in high-dimensional inverse problems: an empirical Bayesian approach. Part I: Methodology and Experiments

Abstract

Many imaging problems require solving an inverse problem that is ill-conditioned or ill-posed. Imaging methods typically address this difficulty by regularising the estimation problem to make it well-posed. This often requires setting the value of the so-called regularisation parameters that control the amount of regularisation enforced. These parameters are notoriously difficult to set a priori, and can have a dramatic impact on the recovered estimates. In this work, we propose a general empirical Bayesian method for setting regularisation parameters in imaging problems that are convex w.r.t. the unknown image. Our method calibrates regularisation parameters directly from the observed data by maximum marginal likelihood estimation, and can simultaneously estimate multiple regularisation parameters. Furthermore, the proposed algorithm uses the same basic operators as proximal optimisation algorithms, namely gradient and proximal operators, and it is therefore straightforward to apply to problems that are currently solved by using proximal optimisation techniques. Our methodology is demonstrated with a range of experiments and comparisons with alternative approaches from the literature. The considered experiments include image denoising, non-blind image deconvolution, and hyperspectral unmixing, using synthesis and analysis priors involving the L1, total-variation, total-variation and L1, and total-generalised-variation pseudo-norms. A detailed theoretical analysis of the proposed method is presented in the companion paper arXiv:2008.05793.

37 pages - SIIMS 2020

References in corpus (13)

• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• A convex formulation for hyperspectral image superresolution via subspace-based regularization
• Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization
• Generalized SURE for Exponential Families: Applications to Regularization
• A Survey of Stochastic Simulation and Optimization Methods in Signal Processing
• A SURE Approach for Digital Signal/Image Deconvolution Problems
• Estimating the granularity coefficient of a Potts-Markov random field within an MCMC algorithm
• On perturbed proximal gradient algorithms
• Non-asymptotic Analysis of Biased Stochastic Approximation Scheme
• Effective New Methods for Automated Parameter Selection in Regularized Inverse Problems
• Convergence of diffusions and their discretizations: from continuous to discrete processes and back
• Accelerating proximal Markov chain Monte Carlo by using an explicit stabilised method
• Maximum likelihood estimation of regularisation parameters in high-dimensional inverse problems: an empirical Bayesian approach. Part II: Theoretical Analysis

Cited by in corpus (3)

• Fast Diffusion EM: a diffusion model for blind inverse problems with application to deconvolution
• Accelerating proximal Markov chain Monte Carlo by using an explicit stabilised method
• Maximum likelihood estimation of regularisation parameters in high-dimensional inverse problems: an empirical Bayesian approach. Part II: Theoretical Analysis