𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Robust affine iterative closest point algorithm with bidirectional distance

✍ Scribed by Zhu, J.; Du, S.; Yuan, Z.; Liu, Y.; Ma, L.

Book ID
117811548
Publisher
The Institution of Engineering and Technology
Year
2012
Tongue
English
Weight
829 KB
Volume
6
Category
Article
ISSN
1751-9632

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

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