一种应用博弈和L0约束的盲图像修复方法

Method for inpainting blind images using the game and L0 constraint

图像修复是利用原始图像的先验信息从缺失像素的观察图像出发恢复原始图像的过程。大多数图像修复模型假定图像缺失区域是已知的,但在实际应用中,这些缺失区域的信息很难直接获得。为了解决这类问题,利用L 0范数的稀疏性先验和博弈理论,建立了新的图像修复模型。新模型适用于图像缺失区域已知和未知两种情况。根据目标函数的结构,提出了有效的临近交替方向乘子法和基于博弈的交替框架来解决相应的最小化问题,分析了文中模型在一定的条件下的收敛性。与现有的修复模型进行了对比,数值实验表明,所提出的模型和算法在主观和客观质量评价上比现有修复模型具有更好的结果和稳健性。

Image inpainting is the process of restoring the original image from the observed image with missing pixels using the prior information on the original image.Most image inpainting models assume that the missing areas of the image are known.However,inpractical applications,the information on these missing areas is difficult to obtain directly.In order to solve this problem,a new image inpainting model is established by using the sparse priori of L 0 norm and game theory.The new model is suitable for the two cases of known and unknown image missing areas.According to the structure of the objective function,an effective proximal alternating direction method of multipliers and a game-based alternating framework are proposed to solve the corresponding minimization problem,and the convergence of the model under certain conditions is analyzed.Compared with the existing inpainting models,numerical experiments show that the models and algorithms proposed can lead to better results and robustness insubjective and objective quality evaluation than the image inpainting methods available.