𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scaling iterative closest point algorithm for registration of m–D point sets

✍ Scribed by Shaoyi Du; Nanning Zheng; Lei Xiong; Shihui Ying; Jianru Xue

Book ID
108197332
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
946 KB
Volume
21
Category
Article
ISSN
1047-3203

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Affine iterative closest point algorithm
Affine iterative closest point algorithm for point set registration
✍ Shaoyi Du; Nanning Zheng; Shihui Ying; Jianyi Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 799 KB

The traditional iterative closest point (ICP) algorithm is accurate and fast for rigid point set registration but it is unable to handle affine case. This paper instead introduces a novel generalized ICP algorithm based on lie group for affine registration of m-D point sets. First, with singular val

Compression of Dynamic 3D Geometry Data
Compression of Dynamic 3D Geometry Data Using Iterative Closest Point Algorithm
✍ Sumit Gupta; Kuntal Sengupta; Ashraf A. Kassim 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 299 KB

In this paper, we propose a new framework to perform motion compression for time-dependent 3D geometric data. Temporal coherence in dynamic geometric models can be used to achieve significant compression, thereby leading to efficient storage and transmission of large volumes of 3D data. The displace

Robust matching of 3D contours using ite
Robust matching of 3D contours using iterative closest point algorithm improved by M-estimation
✍ Shun'ichi Kaneko; Tomonori Kondo; Atsushi Miyamoto 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 333 KB

An extension of the iterative closest point matching by M-estimation is proposed for realization of robustness to non-overlapping data or outlying data in two sets of contour data or depth images for rigid bodies. An objective function which includes independent residual components for each of x, y

Algorithms for the recognition of 2D ima
Algorithms for the recognition of 2D images of m points and n lines in 3D
✍ R. Gleeson; F. Grosshans; M. Hirsch; R.M. Williams 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 165 KB

Let a be an ordered collection consisting of m points and n lines, m þ n $ 6; in three-dimensional space. Let b be an ordered collection consisting of m points and n lines, m þ n $ 6; in two-dimensional space. Using a and b; we construct a matrix Mða; bÞ and, then, give two algorithms for determinin

Natural scales for interacting fields de
Natural scales for interacting fields defined on a set of discrete points: M. C. Bergère. Service de Physique Théorique de Saclay, F-91191 Gif-sur-Yvette, Cedex, France
📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 67 KB

We generalize the definition of natural scales (originally defined on a single point) to systems of interacting fields defined on a set of discrete, correlated points. We study the case of a nearest neighbour interaction over a d-dimensional rectangular lattice; the thermodynamic limit of natural sc