2010 Shape Modeling International Conference 2010
DOI: 10.1109/smi.2010.35
|View full text |Cite
|
Sign up to set email alerts
|

3D Feature Line Detection Based on Vertex Labeling and 2D Skeletonization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…Some of these conditions are shown in Fig. 1 C. New methods have improved the quality and repeatability of predicted network topology and connectivity; both deep learning models and traditional computer vision techniques have made significant advances in 2D/ 3D biological segmentations (59)(60)(61)(62). Despite these advances, current skeletonization methods continue to require semimanual postprocessing because of the ambiguities present in the structures during imaging and errors resulting from the image capturing modalities.…”
Section: Dlite Is Robust To Digitization Ambiguitiesmentioning
confidence: 99%
“…Some of these conditions are shown in Fig. 1 C. New methods have improved the quality and repeatability of predicted network topology and connectivity; both deep learning models and traditional computer vision techniques have made significant advances in 2D/ 3D biological segmentations (59)(60)(61)(62). Despite these advances, current skeletonization methods continue to require semimanual postprocessing because of the ambiguities present in the structures during imaging and errors resulting from the image capturing modalities.…”
Section: Dlite Is Robust To Digitization Ambiguitiesmentioning
confidence: 99%
“…The connectivity ensures that all the points, or vertices, of a graph are linked together. In Kudelski et al (2010), the connectivity is assured using a vertex labeling step and mathematical morphological operators to extract feature lines. As these operators respect the topology of the objects, the connectivity of the resulting feature lines is guaranteed.…”
Section: Sulcal Features Extractionmentioning
confidence: 99%
“…First, we applied a noise-reduction algorithm on the curvature maps. Then, each vertex was labeled in order to define regions of interest (Kudelski et al 2010). Finally, the sulcal lines were extracted from these regions using topological operators to ensure the connectivity of the extracted lines.…”
Section: Sulcal Features Extractionmentioning
confidence: 99%
“…In order to define sets over triangulated 3D meshes, we use the algorithm proposed by Kudelski et al [14]. We compute the mean curvature H through a local polynomial fitting in the least-squares sense [12].…”
Section: 4mentioning
confidence: 99%