An algorithm for optimal free-form object matching

被引：54

作者：

Ko, KH ^{[1
]}

Maekawa, T ^{[1
]}

Patrikalakis, NM ^{[1
]}

机构：

[1] MIT, Cambridge, MA 02139 USA

来源：

COMPUTER-AIDED DESIGN | 2003年 / 35卷 / 10期

基金：

美国国家科学基金会;

关键词：

NURBS; registration; localization; correspondence search; partial matching; intrinsic watermarking; partial surface overlap;

D O I：

10.1016/S0010-4485(02)00205-1

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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. (C) 2003 Elsevier Science Ltd. All rights reserved.

引用

页码：913 / 923

页数：11

共 28 条

[1] Efficient and reliable methods for rounded-interval arithmetic [J].