Generative adversarial networks (GANs) have made great success in image inpainting yet still have difficulties tackling large missing regions. In contrast, iterative probabilistic algorithms, such as autoregressive and denoising diffusion models, have to be deployed with massive computing resources for decent effect. To achieve high-quality results with low computational cost, we present a novel pixel spread model (PSM) that iteratively employs decoupled probabilistic modeling, combining the optimization efficiency of GANs with the prediction tractability of probabilistic models. As a result, our model selectively spreads informative pixels throughout the image in a few iterations, largely enhancing the completion quality and efficiency. On multiple benchmarks, we achieve new state-of-the-art performance. Code is released at https://github.com/fenglinglwb/PSM.
翻译:生成的对抗性网络(GANs)在图像绘制方面取得巨大成功,但是在解决大面积缺失地区方面仍然有困难。相反,反复的概率算法,如自动递减和去除扩散模型,必须用大量计算资源部署,才能产生体面的效果。为了以低计算成本实现高质量的结果,我们提出了一个新的像素扩散模型(PSM),迭代地使用脱钩的概率模型,将GANs的优化效率与预测概率模型的可感性结合起来。结果,我们的模型有选择地将信息像素散布在图像中,在几个迭代中,主要提高完成质量和效率。在多个基准上,我们实现了新的“最新状态”性能。代码在 https://github.com/fenglinglwb/PSM上发布。</s>