pith. sign in

arxiv: 1802.03275 · v1 · pith:AKMHWHVSnew · submitted 2018-02-09 · 💻 cs.CV · cs.AI

Slice Sampling Particle Belief Propagation

classification 💻 cs.CV cs.AI
keywords distributionsamplingbeliefproposalchallengingcontinuousconvergenceinference
0
0 comments X
read the original abstract

Inference in continuous label Markov random fields is a challenging task. We use particle belief propagation (PBP) for solving the inference problem in continuous label space. Sampling particles from the belief distribution is typically done by using Metropolis-Hastings Markov chain Monte Carlo methods which involves sampling from a proposal distribution. This proposal distribution has to be carefully designed depending on the particular model and input data to achieve fast convergence. We propose to avoid dependence on a proposal distribution by introducing a slice sampling based PBP algorithm. The proposed approach shows superior convergence performance on an image denoising toy example. Our findings are validated on a challenging relational 2D feature tracking application.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.