High-Order Nonparametric Belief-Propagation for Fast Image Inpainting

10/01/2007
by   Julian John McAuley, et al.
0

In this paper, we use belief-propagation techniques to develop fast algorithms for image inpainting. Unlike traditional gradient-based approaches, which may require many iterations to converge, our techniques achieve competitive results after only a few iterations. On the other hand, while belief-propagation techniques are often unable to deal with high-order models due to the explosion in the size of messages, we avoid this problem by approximating our high-order prior model using a Gaussian mixture. By using such an approximation, we are able to inpaint images quickly while at the same time retaining good visual results.

READ FULL TEXT

page 5

page 6

research
07/27/2018

Pull Message Passing for Nonparametric Belief Propagation

We present a "pull" approach to approximate products of Gaussian mixture...
research
06/12/2023

A New Probabilistic Distance Metric With Application In Gaussian Mixture Reduction

This paper presents a new distance metric to compare two continuous prob...
research
05/16/2018

Max-Product for Maximum Weight Matching - Revisited

We focus on belief propagation for the assignment problem, also known as...
research
09/22/2019

Nonlocal Patches based Gaussian Mixture Model for Image Inpainting

We consider the inpainting problem for noisy images. It is very challeng...
research
08/10/2015

Approximation-Aware Dependency Parsing by Belief Propagation

We show how to train the fast dependency parser of Smith and Eisner (200...
research
10/02/2022

Belief propagation generalizes backpropagation

The two most important algorithms in artificial intelligence are backpro...
research
09/30/2019

Fast and Stable Schemes for Phase Fields Models

We propose and analyse new stabilized time marching schemes for Phase Fi...

Please sign up or login with your details

Forgot password? Click here to reset