The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
An Efficient Algorithm for Calculating the Exact Hausdorff Distance
Abstract
The Hausdorff distance (HD) between two point sets is a commonly used dissimilarity measure for comparing point sets and image segmentations. Especially when very large point sets are compared using the HD, for example when evaluating magnetic resonance volume segmentations, or when the underlying applications are based on time critical tasks, like motion detection, then the computational complexity of HD algorithms becomes an important issue. In this paper we propose a novel efficient algorithm for computing the exact Hausdorff distance. In a runtime analysis, the proposed algorithm is demonstrated to have nearly-linear complexity. Furthermore, it has efficient performance for large point set sizes as well as for large grid size; performs equally for sparse and dense point sets; and finally it is general without restrictions on the characteristics of the point set. The proposed algorithm is tested against the HD algorithm of the widely used national library of medicine insight segmentation and registration toolkit (ITK) using magnetic resonance volumes with extremely large size. The proposed algorithm outperforms the ITK HD algorithm both in speed and memory required. In an experiment using trajectories from a road network, the proposed algorithm significantly outperforms an HD algorithm based on R-Trees.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 method for registration of 3-D shapes
Besl, P. J., & McKay, N. D. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.121791 · Cited by 18,103
Comparing images using the Hausdorff distance
Huttenlocher, D. P., Klanderman, G. A., & Rucklidge, W. J. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.232073 · Cited by 4,545
Point Set Registration: Coherent Point Drift
Myronenko, A., & Song, X. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.46 · Cited by 2,762
A new point matching algorithm for non-rigid registration
Chui, H., & Rangarajan, A. (2003) · Computer Vision and Image Understanding · doi:10.1016/s1077-3142(03)00009-2 · Cited by 1,560
Robust Point Set Registration Using Gaussian Mixture Models
Jian, B., & Vemuri, B. C. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.223 · Cited by 975
Maurer, C. R., Qi, R., & Raghavan, V. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1177156 · Cited by 911
Complex Wavelet Structural Similarity: A New Image Similarity Index
Sampat, M. P., Wang, Z., Gupta, S., Bovik, A. C., & Markey, M. K. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2025923 · Cited by 656
Valmet: A New Validation Tool for Assessing and Improving 3D Object Segmentation
Gerig, G., Jomier, M., & Chakos, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45468-3_62 · Cited by 344
Image Similarity Using Mutual Information of Regions
Russakoff, D. B., Tomasi, C., Rohlfing, T., & Maurer, C. R. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24672-5_47 · Cited by 286
Aggregate nearest neighbor queries in spatial databases
Dimitris Papadias, C., Tao, Y., Mouratidis, K., & Hui, C. K. (2005) · ACM Transactions on Database Systems · doi:10.1145/1071610.1071616 · Cited by 268
Cited by
Automated brain extraction of multisequence MRI using artificial neural networks
Isensee, F., Schell, M., Pflueger, I., Brugnara, G., Bonekamp, D., Neuberger, U., Wick, A., Schlemmer, H., Heiland, S., Wick, W., et al. (2019) · Human Brain Mapping · doi:10.1002/hbm.24750 · Cited by 722
A high-resolution probabilistic in vivo atlas of human subcortical brain nuclei
Pauli, W. M., Nili, A. N., & Tyszka, J. M. (2018) · Scientific Data · doi:10.1038/sdata.2018.63 · Cited by 517
Lin, D., Lapen, K., Sherer, M. V., Kantor, J., Zhang, Z., Boyce, L. M., Bosch, W., Korenstein, D., & Gillespie, E. F. (2020) · International Journal of Radiation Oncology*Biology*Physics · doi:10.1016/j.ijrobp.2020.04.011 · Cited by 59
Metadata
- Authors
- Taha, A. A., & Hanbury, A.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2015-11-01
- Volume
- 37
- Issue
- 11
- Pages
- 2153-2163
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2028344184
- Cited by
- 411
- References
- 14
- FWCI
- 10.11
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Efficient Algorithm for Calculating the Exact Hausdorff Distance. https://app.cochat.ai/papers/10.1109/tpami.2015.2408351
- The paper
- Taha, A. A., & Hanbury, A. (2015). An Efficient Algorithm for Calculating the Exact Hausdorff Distance. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2015.2408351
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.
