Stochastic Computation of Medial Axis in Markov Random Fields

Abstract

In this paper the computation of medial axis is posed as a statistical inference problem not as a mathematical transform. This method provides answers to two essential problems in computing the medial axis representation. I) Prior knowledge are adopted for axes and junctions so that the axes around junctions become well defined. II) A stochastic jump-diffusion process is proposed for estimating medial axis in a Markov random field. We argue that the stochastic algorithm for computing medial axis is compatible with existing algorithms for image segmentation, such as snake and region competition. Thus it provides a new direction for computing medial axis from real textured images. Experiments ale demonstrated on both synthetic and real shapes.

Cite

Text

Zhu. "Stochastic Computation of Medial Axis in Markov Random Fields." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1998. doi:10.1109/CVPR.1998.698590

Markdown

[Zhu. "Stochastic Computation of Medial Axis in Markov Random Fields." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1998.](https://mlanthology.org/cvpr/1998/zhu1998cvpr-stochastic/) doi:10.1109/CVPR.1998.698590

BibTeX

@inproceedings{zhu1998cvpr-stochastic,
  title     = {{Stochastic Computation of Medial Axis in Markov Random Fields}},
  author    = {Zhu, Song Chun},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1998},
  pages     = {72-79},
  doi       = {10.1109/CVPR.1998.698590},
  url       = {https://mlanthology.org/cvpr/1998/zhu1998cvpr-stochastic/}
}