Constrained optimal fitting of three-dimensional vector patterns

Author

Calafiore, G. ; Bona, B.

Author_Institution

Dipt. di Autom. e Inf., Politecnico di Torino, Italy

Volume

14

Issue

5

fYear

1998

fDate

10/1/1998 12:00:00 AM

Firstpage

838

Lastpage

844

Abstract

This paper addresses the problem of finding whether a given set of three-dimensional (3D) vectors (the object) can be brought to match a second set of vectors (the template) by means of an affine motion, minimizing a measure of the mismatch error and satisfying an assigned set of geometrical constraints. This problem is encountered in many applications of computer vision, robotics, and manufacturing processes, and has been tackled by several authors in the unconstrained case. Spherical, ellipsoidal and polyhedral constraints are here introduced in the problem, and a solution scheme based on an efficient convex optimization algorithm is proposed. An example of application of the proposed methodology to a manufacturing tolerancing problem is also provided

Keywords

computational geometry; constraint theory; convex programming; image matching; minimisation; 3D vector patterns; affine motion; computer vision; constrained optimal fitting; convex optimization algorithm; ellipsoidal constraints; geometrical constraints; manufacturing processes; manufacturing tolerancing; mismatch error measure minimization; polyhedral constraints; robotics; spherical constraints; template; Application software; Computer vision; Constraint optimization; Cost function; Fitting; Inspection; Manufacturing processes; Robot vision systems; Robotics and automation; Servosystems;

fLanguage

English

Journal_Title

Robotics and Automation, IEEE Transactions on

Publisher

ieee

ISSN

1042-296X

Type

jour

DOI

10.1109/70.720361

Filename

720361