• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Active Contours without Edges (2001)

Cached

  • Download as a PDF

Download Links

  • [www.math.ucla.edu]
  • [kowon.dongseo.ac.kr]
  • [www.csee.wvu.edu]
  • [www.cs.ualberta.ca]
  • [www.cs.ualberta.ca]
  • [www.math.upenn.edu]
  • [webdocs.cs.ualberta.ca]
  • [webdocs.cs.ualberta.ca]
  • [webdocs.cs.ualberta.ca]
  • [webdocs.cs.ualberta.ca]
  • [webdocs.cs.ualberta.ca]
  • [ftp.math.ucla.edu]

  • Other Repositories/Bibliography

  • CiteULike
  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Tony F. Chan , Luminita A. Vese
Citations:1206 - 38 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Chan01activecontours,
    author = {Tony F. Chan and Luminita A. Vese},
    title = {Active Contours without Edges},
    year = {2001}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford--Shah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gradient. We minimize an energy which can be seen as a particular case of the minimal partition problem. In the level set formulation, the problem becomes a "mean-curvature flow"-like evolving the active contour, which will stop on the desired boundary. However, the stopping term does not depend on the gradient of the image, as in the classical active contour models, but is instead related to a particular segmentation of the image. We will give a numerical algorithm using finite differences. Finally, we will present various experimental results and in particular some examples for which the classical snakes methods based on the gradient are not applicable. Also, the initial curve can be anywhere in the image, and interior contours are automatically detected.

Keyphrases

active contour    initial curve    mumford shah functional    desired boundary    numerical algorithm    finite difference    mean-curvature flow    level set    classical active contour model    minimal partition problem    particular case    curve evolution    various experimental result    interior contour    stopping term    classical snake method    particular segmentation    new model   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University