Slice sampling particle belief propagation

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

View graph of relations

Details

Original languageEnglish
Title of host publicationProceedings
Subtitle of host publication2013 IEEE International Conference on Computer Vision, ICCV 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1129-1136
Number of pages8
ISBN (print)9781479928392
Publication statusPublished - 2013
Event2013 14th IEEE International Conference on Computer Vision, ICCV 2013 - Sydney, NSW, Australia
Duration: 1 Dec 20138 Dec 2013

Publication series

NameProceedings of the IEEE International Conference on Computer Vision

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 (MH) Markov chain Monte Carlo (MCMC) 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.

Keywords

    Feature Tracking, MCMC, Optimization, Particle Belief Propagation, Slice Sampling

ASJC Scopus subject areas

Cite this

Slice sampling particle belief propagation. / Muller, Oliver; Yang, Michael Ying; Rosenhahn, Bodo.
Proceedings: 2013 IEEE International Conference on Computer Vision, ICCV 2013. Institute of Electrical and Electronics Engineers Inc., 2013. p. 1129-1136 6751250 (Proceedings of the IEEE International Conference on Computer Vision).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Muller, O, Yang, MY & Rosenhahn, B 2013, Slice sampling particle belief propagation. in Proceedings: 2013 IEEE International Conference on Computer Vision, ICCV 2013., 6751250, Proceedings of the IEEE International Conference on Computer Vision, Institute of Electrical and Electronics Engineers Inc., pp. 1129-1136, 2013 14th IEEE International Conference on Computer Vision, ICCV 2013, Sydney, NSW, Australia, 1 Dec 2013. https://doi.org/10.1109/ICCV.2013.144
Muller, O., Yang, M. Y., & Rosenhahn, B. (2013). Slice sampling particle belief propagation. In Proceedings: 2013 IEEE International Conference on Computer Vision, ICCV 2013 (pp. 1129-1136). Article 6751250 (Proceedings of the IEEE International Conference on Computer Vision). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCV.2013.144
Muller O, Yang MY, Rosenhahn B. Slice sampling particle belief propagation. In Proceedings: 2013 IEEE International Conference on Computer Vision, ICCV 2013. Institute of Electrical and Electronics Engineers Inc. 2013. p. 1129-1136. 6751250. (Proceedings of the IEEE International Conference on Computer Vision). doi: 10.1109/ICCV.2013.144
Muller, Oliver ; Yang, Michael Ying ; Rosenhahn, Bodo. / Slice sampling particle belief propagation. Proceedings: 2013 IEEE International Conference on Computer Vision, ICCV 2013. Institute of Electrical and Electronics Engineers Inc., 2013. pp. 1129-1136 (Proceedings of the IEEE International Conference on Computer Vision).
Download
@inproceedings{d1c76499455e4b9ab8b9900087177d3d,
title = "Slice sampling particle belief propagation",
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 (MH) Markov chain Monte Carlo (MCMC) 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.",
keywords = "Feature Tracking, MCMC, Optimization, Particle Belief Propagation, Slice Sampling",
author = "Oliver Muller and Yang, {Michael Ying} and Bodo Rosenhahn",
year = "2013",
doi = "10.1109/ICCV.2013.144",
language = "English",
isbn = "9781479928392",
series = "Proceedings of the IEEE International Conference on Computer Vision",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1129--1136",
booktitle = "Proceedings",
address = "United States",
note = "2013 14th IEEE International Conference on Computer Vision, ICCV 2013 ; Conference date: 01-12-2013 Through 08-12-2013",

}

Download

TY - GEN

T1 - Slice sampling particle belief propagation

AU - Muller, Oliver

AU - Yang, Michael Ying

AU - Rosenhahn, Bodo

PY - 2013

Y1 - 2013

N2 - 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 (MH) Markov chain Monte Carlo (MCMC) 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.

AB - 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 (MH) Markov chain Monte Carlo (MCMC) 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.

KW - Feature Tracking

KW - MCMC

KW - Optimization

KW - Particle Belief Propagation

KW - Slice Sampling

UR - http://www.scopus.com/inward/record.url?scp=84898811282&partnerID=8YFLogxK

U2 - 10.1109/ICCV.2013.144

DO - 10.1109/ICCV.2013.144

M3 - Conference contribution

AN - SCOPUS:84898811282

SN - 9781479928392

T3 - Proceedings of the IEEE International Conference on Computer Vision

SP - 1129

EP - 1136

BT - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2013 14th IEEE International Conference on Computer Vision, ICCV 2013

Y2 - 1 December 2013 through 8 December 2013

ER -

By the same author(s)