A Robust Level-Set Algorithm for Centerline Extraction

Simple item page
dc.contributor.authorTelea, Alexandruen_US
dc.contributor.authorVilanova, Annaen_US
dc.contributor.editorG.-P. Bonneau and S. Hahmann and C. D. Hansenen_US
dc.date.accessioned2014-01-30T07:36:37Z
dc.date.available2014-01-30T07:36:37Z
dc.date.issued2003en_US
dc.description.abstractWe present a robust method for extracting 3D centerlines from volumetric datasets. We start from a 2D skeletonization method to locate voxels centered with respect to three orthogonal slicing directions. Next, we introduce a new detection criterion to extract the centerline voxels from the above skeletons, followed by a thinning, reconnection, and a ranking step. Overall, the proposed method produces centerlines that are object-centered, connected, one voxel thick, robust with respect to object noisiness, handles arbitrary object topologies, comes with a simple pruning threshold, and is fast to compute. We compare our results with two other methods on a variety of real-world datasetsen_US
dc.description.seriesinformationEurographics / IEEE VGTC Symposium on Visualizationen_US
dc.identifier.isbn3-905673-01-0en_US
dc.identifier.issn1727-5296en_US
dc.identifier.urihttps://doi.org/10.2312/VisSym/VisSym03/185-194en_US
dc.publisherThe Eurographics Associationen_US
dc.titleA Robust Level-Set Algorithm for Centerline Extractionen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
185-194.pdf
Size:
2.45 MB
Format:
Adobe Portable Document Format
Download
Collections
VisSym03: Joint Eurographics - IEEE TCVG Symposium on Visualization