Dr. Wai-Pak Choi Profile

Dr. Wai-Pak Choi

Research Assistant at Hong Kong Polytechnic Univ

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 4 January 2002 Paper

Robust Hausdorff distance for shape matching

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

Proceedings Volume 4671, (2002) https://doi.org/10.1117/12.453123

KEYWORDS: Lithium, Image segmentation, Visual communications, Image processing, Quantum wells, Model-based design, Feature extraction, Image processing algorithms and systems, Computer simulations

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

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

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

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years