An algorithm for optimal free-form object matching

A novel method of matching for 3-D free-form objects (points vs. surface and surface vs. surface) is proposed. The method formulates the problem in terms of solution of a non-linear polynomial equation system, which can be solved robustly by the Interval Projected Polyhedron (IPP) algorithm. Two int...

Full description

Saved in:
Bibliographic Details
Published in:Computer aided design 2003-09, Vol.35 (10), p.913-923
Main Authors: Ko, K.H., Maekawa, T., Patrikalakis, N.M.
Format: Article
Language:English
Subjects:
Applied sciences
Computer aided design
Computer science
control theory
systems
Correspondence search
Exact sciences and technology
Intrinsic watermarking
Localization
NURBS
Partial matching
Partial surface overlap
Registration
Software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A novel method of matching for 3-D free-form objects (points vs. surface and surface vs. surface) is proposed. The method formulates the problem in terms of solution of a non-linear polynomial equation system, which can be solved robustly by the Interval Projected Polyhedron (IPP) algorithm. Two intrinsic surface properties, the Gaussian and the mean curvatures, are used as object features for matching. The related iso-curvature lines are used to establish the correspondence between two objects. The intersection points of these iso-curvature lines are calculated and sorted out to satisfy the Euclidean constraints from which the translation and rotation transformations are estimated. The performance of the proposed algorithm is also analyzed. This approach can cover global and partial matching, and be applied to automated inspection, copyright protection of NURBS models, and object recognition. Examples illustrate our technique.
ISSN:0010-4485
1879-2685
DOI:10.1016/S0010-4485(02)00205-1