1 July 2000 Nonparametric hierarchical Hausdorff distance matching algorithm
Author Affiliations +
Optical Engineering, 39(7), (2000). doi:10.1117/1.602576
Abstract
A Hausdorff distance (HD), which is defined between two point sets in two-dimensional (2-D) binary images and does not require us to establish correspondences, is one of common measures used for object matching. The proposed hierarchical HD (HHD) matching algorithm, based on coarse-to-fine matching, reduces the computational complexity greatly by using the pyramidal structures that consist of a distance transform (DT) map pyramid and an edge pyramid. in the proposed HHD matching, an automatic thresholding method is presented to select candidate positions at each level, in which the threshold value is determined based on the property between adjacent levels of a DT map pyramid. Computer simulation with real images and noisy images shows that the proposed HHD algorithm yields matching results similar to those achieved by the conventional HD algorithm with greatly reduced computational complexity.
OhKyu Kwon, Dong-Gyu Sim, Rae-Hong Park, "Nonparametric hierarchical Hausdorff distance matching algorithm," Optical Engineering 39(7), (1 July 2000). http://dx.doi.org/10.1117/1.602576
JOURNAL ARTICLE
11 PAGES


SHARE
KEYWORDS
Binary data

Optical engineering

Aluminum

Error analysis

Statistical analysis

Computer simulations

Computer vision technology

Back to Top