Level Set Based Shape Prior Segmentation

Abstract

We propose a level set based variational approach that incorporates shape priors into Chan-Vese's model for the shape prior segmentation problem. In our model, besides the level set function for segmentation, as in Cremers' work, we introduce another labelling level set function to indicate the regions on which the prior shape should be compared. Our model can segment an object, whose shape is similar to the given prior shape, from a background where there are several objects. Moreover, we provide a proof for a fast solution principle, which was mentioned by F. Gibou et al., and similar to the one proposed in [B. Song et al., (2002)], for minimizing Chan-Vese's segmentation model without length term. We extend the principle to the minimization of our prescribed functionals.

Cite

Text

Chan and Zhu. "Level Set Based Shape Prior Segmentation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005. doi:10.1109/CVPR.2005.212

Markdown

[Chan and Zhu. "Level Set Based Shape Prior Segmentation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005.](https://mlanthology.org/cvpr/2005/chan2005cvpr-level/) doi:10.1109/CVPR.2005.212

BibTeX

@inproceedings{chan2005cvpr-level,
  title     = {{Level Set Based Shape Prior Segmentation}},
  author    = {Chan, Tony F. and Zhu, Wei},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2005},
  pages     = {1164-1170},
  doi       = {10.1109/CVPR.2005.212},
  url       = {https://mlanthology.org/cvpr/2005/chan2005cvpr-level/}
}