|MCMC Sampling over Shapes|
We present a method for sampling from the posterior distribution of implicitly defined segmentations conditioned on the observed image. Segmentation is often formulated as an energy minimization or statistical inference problem in which either the optimal or most probable configuration is the goal. Exponentiating the negative energy functional provides a Bayesian interpretation in which the solutions are equivalent. Sampling methods enable evaluation of distribution properties that characterize the solution space via the computation of marginal event probabilities. We develop a Metropolis-Hastings sampling algorithm over level-sets which improves upon previous methods by allowing for topological changes (if desired) while simultaneously decreasing computational times by orders of magnitude.
People Involved: Jason Chang, John W. Fisher III
Comparison to Other Sampling AlgorithmsThe following movie shows the convergence speed gains by using the BFPS algorithm of (Chang et al. 2011). We note that the more recent GIMH algorithm is even faster than BFPS.
The following movies show one sample path of each sampling algorithm.
|[Fan 2007]||[Chen 2009]||BFPS|
Refereed Conference Papers3 results
|||J. Chang, I. Fisher, "Topology-Constrained Layered Tracking with Latent Flow", in Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2013.|
|||J. Chang, J. W. Fisher III, "Efficient Topology-Controlled Sampling of Implicit Shapes", in Proceedings of the IEEE International Conference on Image Processing (ICIP), 2012.|
|||J. Chang, J. W. F. III, "Efficient MCMC Sampling with Implicit Shape Representations", in Proceedings of the IEEE Computer Vision and Pattern Recognition (CVPR), 2011.|