Robust Hausdorff distance for shape matching

Wai-Pak Choi; Kin-Man Lam; Wan-Chi Siu

doi:10.1117/12.453123

4 January 2002 Robust Hausdorff distance for shape matching

Wai-Pak Choi, Kin-Man Lam, Wan-Chi Siu

Author Affiliations +

Proceedings Volume 4671, Visual Communications and Image Processing 2002; (2002) https://doi.org/10.1117/12.453123
Event: Electronic Imaging, 2002, San Jose, California, United States

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.

Citation Download Citation

Wai-Pak Choi, Kin-Man Lam, and Wan-Chi Siu "Robust Hausdorff distance for shape matching", Proc. SPIE 4671, Visual Communications and Image Processing 2002, (4 January 2002); https://doi.org/10.1117/12.453123

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE