This paper proposes a hierarchical Hausdorff distance (HD) matching algorithm baased on coarse-to-fine approach. It reduces the computational complexity greatly by using the pyramidal structures consisting of distance transform (DT) and edge pyramids. Also, inthe proposed hierarchical HD matching, a thresholding method is presented to find an optimal matching position with small error, in which the threshold values are determined by using the property between adjacent level of a DT map pyramid. By computer simulation, the performance of the conventional and proposed hierarchical HD matching algorithms is compared in therms of the matching position for binary images containing uniform noise.
DOI 인용 스타일