4 January 2002 Robust Hausdorff distance for shape matching
Author Affiliations +
Abstract
The Hausdorff distance can be used to measure the similarity of two point sets. In matching the two point sets, one of them is translated, rotated and scaled in order to obtain an optimal matching, which is a computationally intensive process. In this paper, a robust line-feature-based approach for model-based recognition is presented, which can achieve good matching, even in a noisy environment or with the existence of occlusion. We propose three different ways for forming the line segments for a point set. Two of the methods are based on a fixed reference point, which are the centroid and the center of the minimal disk of the point set. The third method is based on the longest possible line segments formed within the point set. The line features extracted based on the respective line segments are insensitive to noise and can be used to determine the rotation and scale of the image point set accurately and reliably, and more importantly, 2D-2D matching algorithm can be adopted. The first 2D-matching is to compute the relative scale and orientation between the two point sets. Having rotated and scaled the image point set, the M-Estimation Hausdorff distance is applied for the second 2D-matching to measure the relative translation between the query point set and the model point set. This 2D-2D matching can greatly reduce the required memory and computation when compared to a 4D-matching. Both the performance and the sensitivity to noise of our algorithms are evaluated using simulated data. Experiments show that our 2D-2D algorithms can yield a high level of performance when determining the scale, the orientation and the similarity of two point sets.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wai-Pak Choi, Wai-Pak Choi, Kin-Man Lam, Kin-Man Lam, Wan-Chi Siu, Wan-Chi Siu, } "Robust Hausdorff distance for shape matching", Proc. SPIE 4671, Visual Communications and Image Processing 2002, (4 January 2002); doi: 10.1117/12.453123; https://doi.org/10.1117/12.453123
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

A new interactive algorithm for image segmentation
Proceedings of SPIE (December 08 2015)
Determining vanishing points using Hough transform
Proceedings of SPIE (September 01 1990)
Segmentation of SAR imagery using discrete frame theory
Proceedings of SPIE (August 01 2002)

Back to Top