Convexity Analysis of Active Contour Problems

CVPR 1996 pp. 674-679

doi:10.1109/CVPR.1996.517145 /cvpr/1996/davatzikos1996cvpr-convexity/

Abstract

A general active contour formulation is considered and a convexity analysis of its energy function is presented. Conditions under which this formulation has a unique solution are derived; these conditions involve both the active contour energy potential and the regularization parameters. This analysis is then applied to four particular active contour formulations, revealing important characteristics of their convexity, and suggesting that external potentials involving center of mass computations may be better behaved than the usual potentials based on image gradients. Most importantly, our analysis provides an explanation for the poor convergence behavior at concave boundaries and suggests an alternate algorithm for approaching these types of boundaries.

PDF CVPR Semantic Scholar

Cite

Text

Davatzikos and Prince. "Convexity Analysis of Active Contour Problems." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1996. doi:10.1109/CVPR.1996.517145

Markdown

[Davatzikos and Prince. "Convexity Analysis of Active Contour Problems." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1996.](https://mlanthology.org/cvpr/1996/davatzikos1996cvpr-convexity/) doi:10.1109/CVPR.1996.517145

BibTeX

@inproceedings{davatzikos1996cvpr-convexity,
  title     = {{Convexity Analysis of Active Contour Problems}},
  author    = {Davatzikos, Christos and Prince, Jerry L.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1996},
  pages     = {674-679},
  doi       = {10.1109/CVPR.1996.517145},
  url       = {https://mlanthology.org/cvpr/1996/davatzikos1996cvpr-convexity/}
}