Sciweavers

Share
CIMAGING
2008

MCMC curve sampling and geometric conditional simulation

9 years 9 months ago
MCMC curve sampling and geometric conditional simulation
We present an algorithm to generate samples from probability distributions on the space of curves. Traditional curve evolution methods use gradient descent to find a local minimum of a specified energy functional. Here, we view the 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, update the curve using level-set methods, and show how to compute the transition probabilities to ensure that we compute samples from the posterior. We demonstrate the benefits of sampling methods (such as robustness to local minima, better characterization of multi-modal distributions, and access to some measures of estimation error) on medical and geophysical applications. We then use our sampling framework to construct a novel semi-automatic segmentation approach which takes in partial user segmentations and conditionally simulate...
Ayres C. Fan, John W. Fisher III, Jonathan Kane, A
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where CIMAGING
Authors Ayres C. Fan, John W. Fisher III, Jonathan Kane, Alan S. Willsky
Comments (0)
books