MCMC Curve Sampling for Image Segmentation
Lists
Only you see this
Abstract
We present an algorithm to generate samples from probability distributions on the space of curves. We view a traditional curve evolution energy functional as a negative log probability distribution and sample from it using a Markov chain Monte Carlo (MCMC) algorithm. We define a proposal distribution by generating smooth perturbations to the normal of the curve and show how to compute the transition probabilities to ensure that the samples come from the posterior distribution. We demonstrate some advantages of sampling methods such as robustness to local minima, better characterization of multi-modal distributions, access to some measures of estimation error, and ability to easily incorporate constraints on the curve.
BibTeX
@inproceedings{fan2007mcmc,
author = {Ayres C. Fan and John W. Fisher III and William M. Wells III and James J. Levitt and Alan S. Willsky},
title = {{MCMC Curve Sampling for Image Segmentation}},
booktitle = {International Conference on Medical Image Computing and Computer-Assisted Intervention},
year = {2007},
url = {https://openreview.net/forum?id=KIaaRNHcc2w},
}Loading related content...