The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Penalized-distance volumetric skeleton algorithm
Abstract
Introduces a refined general definition of a skeleton that is based on a penalized distance function and that cannot create any of the degenerate cases of the earlier CEASAR (Center-line Extraction Algorithm-Smooth, Accurate and Robust) and TEASAR (Tree-structure Extraction Algorithm for Skeletons-Accurate and Robust) algorithms. Additionally, we provide an algorithm that finds the skeleton accurately and rapidly. Our solution is fully automatic, which frees the user from having to engage in manual data pre-processing. We present the accurate skeletons computed on a number of test data sets. The algorithm is very efficient, as demonstrated by the running times, which were all below seven minutes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Cited by
Aylward, S. R., & Bullitt, E. (2002) · IEEE Transactions on Medical Imaging · doi:10.1109/42.993126 · Cited by 578
Skeleton extraction by mesh contraction
Au, O. K.-C., Tai, C.-L., Chu, H.-K., Cohen-Or, D., & Lee, T.-Y. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360643 · Cited by 521
CAVER: a new tool to explore routes from protein clefts, pockets and cavities
Petřek, M., Otyepka, M., Banáš, P., Košinová, P., Koča, J., & Damborský, J. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-316 · Cited by 521
Curve-Skeleton Properties, Applications, and Algorithms
Cornea, N. D., Silver, D., & Min, P. (2007) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.1002 · Cited by 484
Patient-specific vascular NURBS modeling for isogeometric analysis of blood flow
Zhang, Y., Bazilevs, Y., Goswami, S., Bajaj, C. L., & Hughes, T. J. R. (2007) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2007.02.009 · Cited by 389
A survey on skeletonization algorithms and their applications
Saha, P. K., Borgefors, G., & Sanniti di Baja, G. (2016) · Pattern Recognition Letters · doi:10.1016/j.patrec.2015.04.006 · Cited by 353
Xu, Y., Bao, Y., Chen, J., Zuo, W., & Li, H. (2019) · Structural Health Monitoring · doi:10.1177/1475921718764873 · Cited by 292
Reconstruction of neocortex: Organelles, compartments, cells, circuits, and activity
Turner, N. L., Macrina, T., Bae, J. A., Yang, R., Wilson, A. M., Schneider-Mizell, C., Lee, K., Lu, R., Wu, J., Bodor, A. L., et al. (2022) · Cell · doi:10.1016/j.cell.2022.01.023 · Cited by 206
Automatic animation skeleton using repulsive force field
Liu, P.-C., Wu, F.-C., Ma, W.-C., Liang, R.-H., & Ouhyoung, M. (2004) · 11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings. · doi:10.1109/pccga.2003.1238285 · Cited by 57
“Many studies also try to build skeleton by constructing a discrete distance field with voxelization of the object [4, 7, 18].”
BackgroundPetascale neural circuit reconstruction: automated methods
Macrina, T., Lee, K., Lu, R., Turner, N. L., Wu, J., Popovych, S., Silversmith, W., Kemnitz, N., Bae, J. A., Castro, M. A., et al. (2021) · doi:10.1101/2021.08.04.455162 · Cited by 55
Parallel centerline extraction on the GPU
Liu, B., Telea, A. C., Roerdink, J. B. T. M., Clapworthy, G. J., Williams, D., Yang, P., Dong, F., Codreanu, V., & Chiarini, A. (2014) · Computers & Graphics · doi:10.1016/j.cag.2014.02.003 · Cited by 14
Metadata
- Authors
- Bitter, I., Kaufman, A. E., & Sato, M.
- Venue
- IEEE Transactions on Visualization and Computer Graphics
- Published
- 2001
- Volume
- 7
- Issue
- 3
- Pages
- 195-206
- ISSN
- 1077-2626 (ISSN-L)
- OpenAlex
- W2107455488
- Cited by
- 248
- References
- 1
- FWCI
- 12.50
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.