✦ LIBER ✦

A 3D point matching algorithm for affine registration

✍ Scribed by Jianqin Qu; Leiguang Gong; Lin Yang

Book ID: 107389473
Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 853 KB
Volume: 6
Category: Article
ISSN: 1861-6410
DOI: 10.1007/s11548-010-0503-y

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

Scaling iterative closest point algorith

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

✍ Shaoyi Du; Nanning Zheng; Lei Xiong; Shihui Ying; Jianru Xue 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 946 KB

Robust affine structure matching for 3D

Robust affine structure matching for 3D object recognition

✍ Cass, T.A. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 576 KB

A robust algorithm for feature point mat

A robust algorithm for feature point matching

✍ Ji Zhou; Jiaoying Shi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 739 KB

A point pattern matching algorithm

✍ Shinji Umeyama 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 798 KB

An improved algorithm for matching parti

An improved algorithm for matching partial registration numbers

✍ Peter J.H. Shewey 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 607 KB