2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05)
DOI: 10.1109/cvpr.2005.306
|View full text |Cite
|
Sign up to set email alerts
|

Robust Centerline Extraction Framework Using Level Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
51
0

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 93 publications
(52 citation statements)
references
References 16 publications
0
51
0
Order By: Relevance
“…Gradient flux-based algorithms are quite popular (e.g. [175], [176], [177], [178], [179], [180]) since gradient flux allows overcoming intensity inhomogeneities, resulting in the segmentation of the entire vascular tree without contour leakages.…”
Section: ) Parametricmentioning
confidence: 99%
“…Gradient flux-based algorithms are quite popular (e.g. [175], [176], [177], [178], [179], [180]) since gradient flux allows overcoming intensity inhomogeneities, resulting in the segmentation of the entire vascular tree without contour leakages.…”
Section: ) Parametricmentioning
confidence: 99%
“…(c) For every point representing the reference shape A, generate an orthogonal wave by solving the Eikonal equation using the fast marching level sets at the speed function F (x, y) = exp(D(x, y)). For more detail see [26]. (d) Track the point with the maximum curvature for each propagating wave front (see Figs.…”
Section: Shape Priormentioning
confidence: 99%
“…Traditionally, tubular binary mask is often created by a segmentation algorithm, e.g., [18,1,22,17,23]. and their centerline models are extracted by shortest paths algorithms operating on this mask [6,1,9,4,13,7,9,19,21]. Alternatively, centerlines can be constructed directly from images by the use of vesselness [11,25] or medialness filters [3,2,24,16].…”
Section: Introductionmentioning
confidence: 99%