Comparing Images Using the Hausdorff Distance Under Translation
Abstract
Efficient algorithms are provided for computing the Hausdorff distance between a binary image and all possible relative positions (translations) of a model, or a portion of that model. The computation is in many ways similar to binary correlation. However, it is more tolerant of perturbations in the locations of points because it measures proximity rather than exact superposition.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Huttenlocher et al. "Comparing Images Using the Hausdorff Distance Under Translation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992. doi:10.1109/CVPR.1992.223209Markdown
[Huttenlocher et al. "Comparing Images Using the Hausdorff Distance Under Translation." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1992.](https://mlanthology.org/cvpr/1992/huttenlocher1992cvpr-comparing/) doi:10.1109/CVPR.1992.223209BibTeX
@inproceedings{huttenlocher1992cvpr-comparing,
title = {{Comparing Images Using the Hausdorff Distance Under Translation}},
author = {Huttenlocher, Daniel P. and Rucklidge, William and Klanderman, Gregory A.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1992},
pages = {654-656},
doi = {10.1109/CVPR.1992.223209},
url = {https://mlanthology.org/cvpr/1992/huttenlocher1992cvpr-comparing/}
}