A Robust Level-Set Algorithm for Centerline Extraction
Abstract
We 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 datasets
BibTeX
@inproceedings {10.2312:VisSym:VisSym03:185-194,
booktitle = {Eurographics / IEEE VGTC Symposium on Visualization},
editor = {G.-P. Bonneau and S. Hahmann and C. D. Hansen},
title = {{A Robust Level-Set Algorithm for Centerline Extraction}},
author = {Telea, Alexandru and Vilanova, Anna},
year = {2003},
publisher = {The Eurographics Association},
ISSN = {1727-5296},
ISBN = {3-905673-01-0},
DOI = {10.2312/VisSym/VisSym03/185-194}
}
booktitle = {Eurographics / IEEE VGTC Symposium on Visualization},
editor = {G.-P. Bonneau and S. Hahmann and C. D. Hansen},
title = {{A Robust Level-Set Algorithm for Centerline Extraction}},
author = {Telea, Alexandru and Vilanova, Anna},
year = {2003},
publisher = {The Eurographics Association},
ISSN = {1727-5296},
ISBN = {3-905673-01-0},
DOI = {10.2312/VisSym/VisSym03/185-194}
}