Algorithms for optimal partial matching of free-form objects with scaling effects

K. H. Ko, Takashi Maekawa, N. M. Patrikalakis

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

A free-form object matching problem is addressed in this paper. Two methods are proposed to solve a partial matching problem with scaling effects and no prior information on correspondence or the rigid body transformation involved. The first method uses umbilical points, which behave as fingerprints of a surface and their qualitative properties can be used for matching purposes. The second method uses an optimization scheme based on the extension of the KH curvature matching method [Comput. Aided Design 35 (2003) 913], first introduced in the context of a matching problem without scaling effects. Two types of curvatures, the Gaussian and the mean curvatures, are used to establish correspondences between two objects. The curvature matching method is formulated in terms of minimization of an objective function depending on the unknown scaling factor, and the rigid body transformation parameters. The accuracy and complexity of the proposed methods as well as the convergence for the optimization approach are analyzed. Examples illustrate the two methods.

Original languageEnglish
Pages (from-to)120-148
Number of pages29
JournalGraphical Models
Volume67
Issue number2
DOIs
Publication statusPublished - 2005 Jan 1
Externally publishedYes

Fingerprint

Scaling
Partial
Matching Problem
Curvature
Rigid Body
Correspondence
Scaling Factor
Optimization
Qualitative Properties
Prior Information
Object
Fingerprint
Mean Curvature
Objective function
Unknown

Keywords

  • Correspondence search
  • Intrinsic watermarking
  • Localization
  • NURBS
  • Partial matching
  • Partial surface overlap
  • Registration
  • Scaling
  • Umbilical points

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation
  • Geometry and Topology
  • Computer Graphics and Computer-Aided Design

Cite this

Algorithms for optimal partial matching of free-form objects with scaling effects. / Ko, K. H.; Maekawa, Takashi; Patrikalakis, N. M.

In: Graphical Models, Vol. 67, No. 2, 01.01.2005, p. 120-148.

Research output: Contribution to journalArticle

@article{fc3d9c70394246f78ab0e8f9a1dfa43d,
title = "Algorithms for optimal partial matching of free-form objects with scaling effects",
abstract = "A free-form object matching problem is addressed in this paper. Two methods are proposed to solve a partial matching problem with scaling effects and no prior information on correspondence or the rigid body transformation involved. The first method uses umbilical points, which behave as fingerprints of a surface and their qualitative properties can be used for matching purposes. The second method uses an optimization scheme based on the extension of the KH curvature matching method [Comput. Aided Design 35 (2003) 913], first introduced in the context of a matching problem without scaling effects. Two types of curvatures, the Gaussian and the mean curvatures, are used to establish correspondences between two objects. The curvature matching method is formulated in terms of minimization of an objective function depending on the unknown scaling factor, and the rigid body transformation parameters. The accuracy and complexity of the proposed methods as well as the convergence for the optimization approach are analyzed. Examples illustrate the two methods.",
keywords = "Correspondence search, Intrinsic watermarking, Localization, NURBS, Partial matching, Partial surface overlap, Registration, Scaling, Umbilical points",
author = "Ko, {K. H.} and Takashi Maekawa and Patrikalakis, {N. M.}",
year = "2005",
month = "1",
day = "1",
doi = "10.1016/j.gmod.2004.05.005",
language = "English",
volume = "67",
pages = "120--148",
journal = "Graphical Models",
issn = "1524-0703",
publisher = "Elsevier Inc.",
number = "2",

}

TY - JOUR

T1 - Algorithms for optimal partial matching of free-form objects with scaling effects

AU - Ko, K. H.

AU - Maekawa, Takashi

AU - Patrikalakis, N. M.

PY - 2005/1/1

Y1 - 2005/1/1

N2 - A free-form object matching problem is addressed in this paper. Two methods are proposed to solve a partial matching problem with scaling effects and no prior information on correspondence or the rigid body transformation involved. The first method uses umbilical points, which behave as fingerprints of a surface and their qualitative properties can be used for matching purposes. The second method uses an optimization scheme based on the extension of the KH curvature matching method [Comput. Aided Design 35 (2003) 913], first introduced in the context of a matching problem without scaling effects. Two types of curvatures, the Gaussian and the mean curvatures, are used to establish correspondences between two objects. The curvature matching method is formulated in terms of minimization of an objective function depending on the unknown scaling factor, and the rigid body transformation parameters. The accuracy and complexity of the proposed methods as well as the convergence for the optimization approach are analyzed. Examples illustrate the two methods.

AB - A free-form object matching problem is addressed in this paper. Two methods are proposed to solve a partial matching problem with scaling effects and no prior information on correspondence or the rigid body transformation involved. The first method uses umbilical points, which behave as fingerprints of a surface and their qualitative properties can be used for matching purposes. The second method uses an optimization scheme based on the extension of the KH curvature matching method [Comput. Aided Design 35 (2003) 913], first introduced in the context of a matching problem without scaling effects. Two types of curvatures, the Gaussian and the mean curvatures, are used to establish correspondences between two objects. The curvature matching method is formulated in terms of minimization of an objective function depending on the unknown scaling factor, and the rigid body transformation parameters. The accuracy and complexity of the proposed methods as well as the convergence for the optimization approach are analyzed. Examples illustrate the two methods.

KW - Correspondence search

KW - Intrinsic watermarking

KW - Localization

KW - NURBS

KW - Partial matching

KW - Partial surface overlap

KW - Registration

KW - Scaling

KW - Umbilical points

UR - http://www.scopus.com/inward/record.url?scp=10944222845&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10944222845&partnerID=8YFLogxK

U2 - 10.1016/j.gmod.2004.05.005

DO - 10.1016/j.gmod.2004.05.005

M3 - Article

AN - SCOPUS:10944222845

VL - 67

SP - 120

EP - 148

JO - Graphical Models

JF - Graphical Models

SN - 1524-0703

IS - 2

ER -