Convexity analysis of active contour problems

Christos Davatzikos, Jerry L. Prince

Research output: Contribution to journalConference article

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 unusual 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.

Original languageEnglish (US)
Pages (from-to)674-679
Number of pages6
JournalProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
StatePublished - Jan 1 1996
EventProceedings of the 1996 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - San Francisco, CA, USA
Duration: Jun 18 1996Jun 20 1996

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Convexity analysis of active contour problems'. Together they form a unique fingerprint.

  • Cite this