Markov Chain Monte Carlo Shape Sampling Using Level Sets
Abstract
In this paper, we show how the Metropolis-Hastings algorithm can be used to sample shapes from a distribution defined over the space of signed distance functions. We extend the basic random walk Metropolis-Hastings method to high-dimensional curves using a proposal distribution that can simultaneously maintain the signed distance function property and the ergodic requirement. We show that detailed balance is approximately satisfied and that the Markov chain will asymptotically converge. A key advantage of our approach is that the shape representation is implicit throughout the process, as compared to existing work where explicit curve parameterization is required. Furthermore, our framework can be carried over to 3D situations easily. We show several applications of the framework to shape sampling from multimodal distributions and medical image segmentation.
Cite
Text
Chen and Radke. "Markov Chain Monte Carlo Shape Sampling Using Level Sets." IEEE/CVF International Conference on Computer Vision Workshops, 2009. doi:10.1109/ICCVW.2009.5457687Markdown
[Chen and Radke. "Markov Chain Monte Carlo Shape Sampling Using Level Sets." IEEE/CVF International Conference on Computer Vision Workshops, 2009.](https://mlanthology.org/iccvw/2009/chen2009iccvw-markov/) doi:10.1109/ICCVW.2009.5457687BibTeX
@inproceedings{chen2009iccvw-markov,
title = {{Markov Chain Monte Carlo Shape Sampling Using Level Sets}},
author = {Chen, Siqi and Radke, Richard J.},
booktitle = {IEEE/CVF International Conference on Computer Vision Workshops},
year = {2009},
pages = {296-303},
doi = {10.1109/ICCVW.2009.5457687},
url = {https://mlanthology.org/iccvw/2009/chen2009iccvw-markov/}
}