The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions
Abstract
A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in time linear in the total number of voxels N. The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used for computing the DT for a wide class of distance functions, including the L/sub p/ and chamfer metrics. At each dimension level, the DT is computed by constructing the intersection of the Voronoi diagram whose sites are the feature voxels with each row of the image. This construction is performed efficiently by using the DT in the next lower dimension. The correctness and linear time complexity are demonstrated analytically and verified experimentally. The algorithm may be of practical value since it is relatively simple and easy to implement and it is relatively fast (not only does it run in O(N) time but the time constant is small). A simple modification of the algorithm computes the weighted Euclidean DT, which is useful for images with anisotropic voxel dimensions. A parallel version of the algorithm runs in O(N/p) time with p processors.
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
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
Computational Geometry--An Introduction.
Atallah, M. J., Preparata, F. P., & Shamos, M. I. (1986) · Mathematics of Computation · doi:10.2307/2008200 · Cited by 4,238
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
Danielsson, P.-E. (1980) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(80)90054-4 · Cited by 1,998
Distance transformations in digital images
Borgefors, G. (1986) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(86)80047-0 · Cited by 1,898
Sequential Operations in Digital Picture Processing
Rosenfeld, A., & Pfaltz, J. L. (1966) · Journal of the ACM · doi:10.1145/321356.321357 · Cited by 1,675
Distance functions on digital pictures
Rosenfeld, A., & Pfaltz, J. L. (1968) · Pattern Recognition · doi:10.1016/0031-3203(68)90013-7 · Cited by 837
Distance transformations in arbitrary dimensions
Borgefors, G. (1984) · Computer Vision, Graphics, and Image Processing · doi:10.1016/0734-189x(84)90035-5 · Cited by 779
Saito, T., & Toriwaki, J. (1994) · Pattern Recognition · doi:10.1016/0031-3203(94)90133-3 · Cited by 477
Linear time Euclidean distance transform algorithms
Breu, H., Gil, J., Kirkpatrick, D., & Werman, M. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.391389 · Cited by 454
Cited by
Metrics for evaluating 3D medical image segmentation: analysis, selection, and tool
Taha, A. A., & Hanbury, A. (2015) · BMC Medical Imaging · doi:10.1186/s12880-015-0068-x · Cited by 2,920
Reducing the Hausdorff Distance in Medical Image Segmentation With Convolutional Neural Networks
Karimi, D., & Salcudean, S. E. (2020) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2019.2930068 · Cited by 635
The image foresting transform: theory, algorithms, and applications
Falcao, A. X., Stolfi, J., & de Alencar Lotufo, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1261076 · Cited by 614
Xing, F., & Yang, L. (2016) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2016.2515127 · Cited by 519
Versatile and efficient pore network extraction method using marker-based watershed segmentation
Gostick, J. T. (2017) · Physical Review E · doi:10.1103/physreve.96.023307 · Cited by 423
An Efficient Algorithm for Calculating the Exact Hausdorff Distance
Taha, A. A., & Hanbury, A. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2408351 · Cited by 411
An Automatic Learning-Based Framework for Robust Nucleus Segmentation
Xing, F., Xie, Y., & Yang, L. (2016) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2015.2481436 · Cited by 351
Digital Museum of Retinal Ganglion Cells with Dense Anatomy and Physiology
Bae, J. A., Mu, S., Kim, J. S., Turner, N. L., Tartavull, I., Kemnitz, N., Jordan, C. S., Norton, A. D., Silversmith, W. M., Prentki, R., et al. (2018) · Cell · doi:10.1016/j.cell.2018.04.040 · Cited by 263
Leucocyte classification for leukaemia detection using image processing techniques
Putzu, L., Caocci, G., & Di Ruberto, C. (2014) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2014.09.002 · Cited by 295
Tustison, N. J., Shrinidhi, K. L., Wintermark, M., Durst, C. R., Kandel, B. M., Gee, J. C., Grossman, M. C., & Avants, B. B. (2015) · Neuroinformatics · doi:10.1007/s12021-014-9245-2 · Cited by 277
3D Skeletons: A State‐of‐the‐Art Report
Tagliasacchi, A., Delame, T., Spagnuolo, M., Amenta, N., & Telea, A. (2016) · Computer Graphics Forum · doi:10.1111/cgf.12865 · Cited by 264
Object Tracking in Structured Environments for Video Surveillance Applications
Zhu, J., Lao, Y., & Zheng, Y. F. (2010) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2009.2031395 · Cited by 93
Yoo, Y., Tang, L. Y. W., Li, D. K. B., Metz, L., Kolind, S., Traboulsee, A. L., & Tam, R. C. (2019) · Computer Methods in Biomechanics and Biomedical Engineering: Imaging & Visualization · doi:10.1080/21681163.2017.1356750 · Cited by 67
Semantic labeling for prosthetic vision
Horne, L., Alvarez, J., McCarthy, C., Salzmann, M., & Barnes, N. (2016) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2016.02.015 · Cited by 30
Chao, C.-H., Zhu, Z., Guo, D., Yan, K., Ho, T.-Y., Cai, J., Harrison, A. P., Ye, X., Xiao, J., Yuille, A., et al. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-59728-3_75 · Cited by 29
Rey, J. A., Farid, U. M., Najjoum, C. M., Brown, A., Magdoom, K. N., Mareci, T. H., & Sarntinoranont, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-34850-0 · Cited by 8
Metadata
- Authors
- Maurer, C. R., Qi, R., & Raghavan, V.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2003-02
- Volume
- 25
- Issue
- 2
- Pages
- 265-270
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2134560790
- Cited by
- 911
- References
- 29
- FWCI
- 16.03
- 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.