arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.10050eess.IVcs.LGcs.NAmath.NA
收藏

可解释的二层优化:赫尔辛基解模糊挑战的应用

Explainable bilevel optimization: an application to the Helsinki deblur challenge

Silvia Bonettini, Giorgia Franchini, Danilo Pezzi, Marco Prato

摘要:

在本文中,我们提出了一个两级优化方案的解决方案的一般图像去模糊问题,其中一个参数变分样的方法被封装在一个机器学习计划,以提供一个高质量的重建图像与自动学习的参数。变分下层和机器学习上层的成分是专门为2021年赫尔辛基去模糊挑战赛选择的,其中要求从模糊程度不断增加的失焦照片中恢复字母序列。我们提出的重建图像的过程包括在一个固定数量的FISTA迭代应用到边缘保持和二值化执行正则化最小二乘泛函的最小化。与大多数深度学习方法不同,定义变分模型和优化步骤的参数都具有精确和可解释的含义,可以通过相似性指数或支持向量机策略来学习。在挑战作者提供的测试图像上进行的数值实验显示,相对于标准变分方法,性能有显着提高,并且与一些提出的基于深度学习的算法(需要优化数百万个参数)的性能相当。

英文摘要:

In this paper we present a bilevel optimization scheme for the solution of a general image deblurring problem, in which a parametric variational-like approach is encapsulated within a machine learning scheme to provide a high quality reconstructed image with automatically learned parameters. The ingredients of the variational lower level and the machine learning upper one are specifically chosen for the Helsinki Deblur Challenge 2021, in which sequences of letters are asked to be recovered from out-of-focus photographs with increasing levels of blur. Our proposed procedure for the reconstructed image consists in a fixed number of FISTA iterations applied to the minimization of an edge preserving and binarization enforcing regularized least-squares functional. The parameters defining the variational model and the optimization steps, which, unlike most deep learning approaches, all have a precise and interpretable meaning, are learned via either a similarity index or a support vector machine strategy. Numerical experiments on the test images provided by the challenge authors show significant gains with respect to a standard variational approach and performances comparable with those of some of the proposed deep learning based algorithms which require the optimization of millions of parameters.

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

↑