arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.04021math.STeess.SPstat.TH
收藏

关于贝叶斯估计与近邻算子

On bayesian estimation and proximity operators

Univ Rennes(雷恩大学);Inria(法国国家数字与信息技术研究所);CNRS(法国国家科学研究中心);IRISA(布列塔尼信息与自动化研究学院);CMLA(计算、建模与应用数学实验室);Ecole Normale Supérieure de Cachan, Université Paris-Saclay(巴黎萨克雷大学卡昂高等师范学校)

Rémi Gribonval, Mila Nikolova

AI总结:

本文探讨了逆问题的两种解决方法,指出最大后验估计与最小均方误差估计之间的关系,并证明在特定噪声模型下,MMSE可通过惩罚最小二乘问题实现。

摘要:

解决信号和图像处理中普遍存在的逆问题有两种主要方法:一种是贝叶斯建模,利用先验概率描述未知变量的分布及其与观测数据的统计依赖关系;另一种是稀疏正则化和压缩感知中的优化问题,通过数据保真项和惩罚项促进特定类型未知数(如稀疏性)。本文指出,虽然最大后验估计在高斯噪声模型下可转化为二次数据保真项优化问题,但反之并不成立。已知在加性高斯噪声下,MMSE估计可表示为惩罚最小二乘问题,且在特定噪声模型下(如泊松噪声或对数凹分布)同样成立。

英文摘要:

There are two major routes to address the ubiquitous family of inverse problems appearing in signal and image processing, such as denoising or deblurring. A first route relies on Bayesian modeling, where prior probabilities are used to embody models of both the distribution of the unknown variables and their statistical dependence with respect to the observed data. The estimation process typically relies on the minimization of an expected loss (e.g. minimum mean squared error, or MMSE). The second route has received much attention in the context of sparse regularization and compressive sensing: it consists in designing (often convex) optimization problems involving the sum of a data delity term and a penalty term promoting certain types of unknowns (e.g., sparsity, promoted through an `1 norm). Well known relations between these two approaches have led to some widely spread mis-conceptions. In particular, while the so-called Maximum A Posterori (MAP) estimate with a Gaussian noise model does lead to an optimization problem with a quadratic data-fidelity term, we disprove through explicit examples the common belief that the converse would be true. It has already been shown [7, 9] that for denoising in the presence of additive Gaussian noise, for any prior probability on the unknowns, MMSE estimation can be expressed as a penalized least squares problem, with the apparent characteristics of a MAP estimation problem with Gaussian noise and a (generally) different prior on the unknowns. In other words, the variational approach is rich enough to build all possible MMSE estimators associated to additive Gaussian noise via a well chosen penalty. We generalize these results beyond Gaussian denoising and characterize noise models for which the same phenomenon occurs. In particular, we prove that with (a variant of) Poisson noise and any prior probability on the unknowns, MMSE estimation can again be expressed as the solution of a penalized least squares optimization problem. For additive scalar denoising the phenomenon holds if and only if the noise distribution is log-concave. In particular, Laplacian denoising can (perhaps surprisingly) be expressed as the solution of a penalized least squares problem. In the multivariate case, the same phenomenon occurs when the noise model belongs to a particular subset of the exponential family. For multivariate additive denoising, the phenomenon holds if and only if the noise is white and Gaussian.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑