Iterative closest geometric objects registration (Q1591967)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterative closest geometric objects registration |
scientific article; zbMATH DE number 1550673
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iterative closest geometric objects registration |
scientific article; zbMATH DE number 1550673 |
Statements
Iterative closest geometric objects registration (English)
0 references
14 January 2001
0 references
The authors observe that in many cases the iterative closest point registration (ICP) developed from the method given by \textit{P. J. Besl} and \textit{N. D. Mc Kay} [IEEE Trans. Pattern Anal. Machine Intelligence 14, 239-256 (1992)]does not converge to the expected transformation. In this paper approaches for matching two sets of line segments or two sets of triangle patches are developed. Based on these techniques algorithms similar to ICP are proposed. These are tested and compared with ICP. To simplify mathematical representation, the notion of matrix scalar product is introduced.
0 references
iterative closest point registration
0 references
iterative line segment registration
0 references
numerical examples
0 references
