Share Email Print

Optical Engineering

Nonparametric hierarchical Hausdorff distance matching algorithm
Author(s): OhKyu Kwon; Dong-Gyu Sim; Rae-Hong Park
Format Member Price Non-Member Price
PDF $20.00 $25.00

Paper 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.

Paper Details

Date Published: 1 July 2000
PDF: 11 pages
Opt. Eng. 39(7) doi: 10.1117/1.602576
Published in: Optical Engineering Volume 39, Issue 7
Show Author Affiliations
OhKyu Kwon, Sogang Univ. (South Korea)
Dong-Gyu Sim, Sogang Univ. (South Korea)
Rae-Hong Park, Sogang Univ. (South Korea)

© SPIE. Terms of Use
Back to Top