pith. sign in

arxiv: 1205.3766 · v1 · pith:IRK2CM3Gnew · submitted 2012-05-16 · 💻 cs.CV

Efficient Topology-Controlled Sampling of Implicit Shapes

classification 💻 cs.CV
keywords efficientsamplingshapesacceptedaccomplishingachievingadditionallyanalysis
0
0 comments X
read the original abstract

Sampling from distributions of implicitly defined shapes enables analysis of various energy functionals used for image segmentation. Recent work describes a computationally efficient Metropolis-Hastings method for accomplishing this task. Here, we extend that framework so that samples are accepted at every iteration of the sampler, achieving an order of magnitude speed up in convergence. Additionally, we show how to incorporate topological constraints.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.