1995
DOI: 10.1109/42.370398
|View full text |Cite
|
Sign up to set email alerts
|

A discrete dynamic contour model

Abstract: A discrete dynamic model for defining contours in 2-D images is developed. The structure of this model is a set of connected vertices. With a minimum of interaction, an initial contour model can be defined, which is then automatically modified by an energy minimizing process. The internal energy of the model depends on local contour curvature, while the external energy is derived from image features. Solutions are presented to avoid undesirable deformation effects, like shrinking and vertex clustering, which a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
230
0
6

Year Published

1997
1997
2017
2017

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 375 publications
(239 citation statements)
references
References 16 publications
(1 reference statement)
0
230
0
6
Order By: Relevance
“…Taking unity magnitude for normal force makes the contour move in a more consistent way which is dominated by the external forces relative to the shape of the contour. To further avoid vertex dispersion and clustering problem, contour resampling operation is carried out (but not for evolutions terminated based on pixel movement) for each time step of the evolving contour, as suggested by [14].…”
Section: Gvf Snake With Contour Resampling and Unit Normal Force Selementioning
confidence: 99%
See 1 more Smart Citation
“…Taking unity magnitude for normal force makes the contour move in a more consistent way which is dominated by the external forces relative to the shape of the contour. To further avoid vertex dispersion and clustering problem, contour resampling operation is carried out (but not for evolutions terminated based on pixel movement) for each time step of the evolving contour, as suggested by [14].…”
Section: Gvf Snake With Contour Resampling and Unit Normal Force Selementioning
confidence: 99%
“…Contour resampling is the addition and removal of contour vertices in subsequent iterations, as suggested in [14]. The contour resampling step is necessary for avoiding vertex clustering and vertex dispersion.…”
Section: Introductionmentioning
confidence: 99%
“…The result is a convex function in w under a linear constraint, since the first term in (2) has been shown to be a convex quadratic [9] and the second term linear. A convex function under a linear constraint can be solved via convex optimization, and thus the optimal w(I j ) is guaranteed.…”
Section: Optimal Energy Functional Weightsmentioning
confidence: 99%
“…For this and other reasons, the automatic segmentation of medical images remains a daunting task. Many segmentation approaches rely on the minimization of objective functions, including several landmark papers: from the seminal paper of Snakes for 2D segmentation [1] and other explicit models [2] to implicit models [3,4], graph approaches [5,6], and variants thereof.…”
Section: Introductionmentioning
confidence: 99%
“…One approach for dealing with such objects is the use of deformable models. Deformable models [59] such as snakes [2] and its variants [16,[42][43][44][45], have attracted considerable attention and are widely used for segmenting non-rigid objects in 2D and 3D (volume) images. However there are several well-known problems associated with snakes.…”
Section: Introductionmentioning
confidence: 99%