MCMC curve sampling for image segmentation

  • Authors:
  • Ayres C. Fan;John W. Fisher, III.;William M. Wells, III.;James J. Levitt;Alan S. Willsky

  • Affiliations:
  • Laboratory for Information and Decision Systems, MIT, Cambridge, MA;Laboratory for Information and Decision Systems, MIT, Cambridge, MA and Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA;Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA and Brigham and Women's Hospital, Harvard Medical School, Boston, MA;Brigham and Women's Hospital, Harvard Medical School, Boston, MA and Dept. of Psychiatry, VA Boston HCS, Harvard Medical School, Brockton, MA;Laboratory for Information and Decision Systems, MIT, Cambridge, MA

  • Venue:
  • MICCAI'07 Proceedings of the 10th international conference on Medical image computing and computer-assisted intervention
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.