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
Shape-based interpolation of multidimensional objects
Raya, S. P., & Udupa, J. K. (1990) · IEEE Transactions on Medical Imaging · doi:10.1109/42.52980 · Cited by 435
Sequencing-by-hybridization revisited: the analog-spectrum proposal
Preparata, F. P. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.12 · Cited by 320
Automatic three‐dimensional correlation of CT‐CT, CT‐MRI, and CT‐SPECT using chamfer matching
van Herk, M., & Kooy, H. M. (1994) · Medical Physics · doi:10.1118/1.597344 · Cited by 246
Deformations Incorporating Rigid Structures
Little, J. A., Hill, D. L. G., & Hawkes, D. J. (1997) · Computer Vision and Image Understanding · doi:10.1006/cviu.1997.0608 · Cited by 193
Pluim, J. P. W., & Fitzpatrick, J. M. (2003) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2003.819272 · Cited by 189
Distance transforms: Properties and machine vision applications
Paglieroni, D. W. (1992) · CVGIP: Graphical Models and Image Processing · doi:10.1016/1049-9652(92)90034-u · Cited by 170
New approach to 3-D registration of multimodality medical images by surface matching:
Jiang, H., Robb, R. A., & Holton Tainter, K. S. (1992) · SPIE Proceedings · doi:10.1117/12.131078 · Cited by 162
On the generation of skeletons from discrete Euclidean distance maps
Ge, Y., & Fitzpatrick, J. M. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.544075 · Cited by 156
An efficient uniform cost algorithm applied to distance transforms
Verwer, B. J. H., Verbeek, P. W., & Dekker, S. T. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.19041 · Cited by 152
The Euclidean distance transform in arbitrary dimensions
Ragnemalm, I. (1993) · Pattern Recognition Letters · doi:10.1016/0167-8655(93)90152-4 · Cited by 151
Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods
Cuisenaire, O., & Macq, B. M. M. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0783 · Cited by 148
Acceleration of ray-casting using 3-D distance transforms
Zuiderveld, K. J., Koning, A. H. J., & Viergever, M. A. (1992) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.131088 · Cited by 125
Computing distance transformations in convex and non-convex domains
Piper, J., & Granum, E. (1987) · Pattern Recognition · doi:10.1016/0031-3203(87)90030-6 · Cited by 116
A Euclidean distance transform using grayscale morphology decomposition
Huang, C. T., & Mitchell, O. R. (1994) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.277600 · Cited by 106
The vector distance transform in two and three dimensions
Mullikin, J. C. (1992) · CVGIP Graphical Models and Image Processing · doi:10.1016/1049-9652(92)90072-6 · Cited by 102
Fitzpatrick, J. M., Hill, D., & Maurer, C. R. (2010) · SPIE eBooks · doi:10.1117/3.831079.ch8 · Cited by 89
Self-citationExact Euclidean distance function by chain propagations
Vincent, L. M. (2002) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1991.139746 · Cited by 83
Fast ray-tracing of rectilinear volume data using distance transforms
Šrámek, M., & Kaufman, A. E. (2000) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.879785 · Cited by 78
Neighborhoods for distance transformations using ordered propagation
Ragnemalm, I. (1992) · CVGIP Image Understanding · doi:10.1016/1049-9660(92)90050-d · Cited by 77
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
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.