1993
DOI: 10.1117/12.143652
|View full text |Cite
|
Sign up to set email alerts
|

<title>Interactive outlining: an improved approach using active contours</title>

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

1995
1995
2012
2012

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 47 publications
(22 citation statements)
references
References 0 publications
0
22
0
Order By: Relevance
“…In [41], Daneels et al developed an improved method of active contours. Based on the user's input, the algorithm first used a greedy procedure to provide fast initial convergence.…”
Section: Segmentationmentioning
confidence: 99%
“…In [41], Daneels et al developed an improved method of active contours. Based on the user's input, the algorithm first used a greedy procedure to provide fast initial convergence.…”
Section: Segmentationmentioning
confidence: 99%
“…Letting D(p) be the unit vector perpendicular (rotated 90 degrees clockwise) to the gradient direction at point p (i.e., for D(p) = (I y (p), -I x (p))), the formulation of the gradient direction feature cost is (4) where are vector dot products and (5) is the bidirectional link or edge vector between pixels p and q. Links are either horizontal, vertical, or diagonal (relative to the position of q in p's neighborhood) and point such that the dot product of D(p) and L(p, q) is positive, as noted in (5). The neighborhood link direction associates a high cost to an edge or link between two pixels that have similar gradient directions but are perpendicular, or near perpendicular, to the link between them.…”
Section: Image Feature Formulationmentioning
confidence: 99%
“…Other popular boundary definition methods use active contours or snakes [1,5,8,15] to improve a manually entered rough approximation. After being initialized with a rough boundary approximation, snakes iteratively adjust the boundary points in parallel in an attempt to minimize an energy functional and achieve an optimal boundary.…”
Section: Introductionmentioning
confidence: 99%
“…The performance not only relies on the design of the iterative optimization algorithm, but also depends on the initial boundary data, which is usually defined by a user or from a priori knowledge. 3,4,8,9 Since the user interaction is not allowed once the iterative process starts, the outcome might not be predictable. And the whole process will be repeated from the beginning when inadequate segmentation is obtained.…”
mentioning
confidence: 99%