摘要
To solve the problem that the traditional point set non-rigid registration algorithm has low precision and slow convergence speed for complex local deformation data, this paper proposes a robust non-rigid registration algorithm based on local affine registration. The algorithm uses a hierarchical iterative method to complete the non-rigid registration of the point set from coarse to fine. In each iteration, the sub shape point sets and sub target point sets are divided and the shape control points of each sub point set are updated. Then the control point guided affine Iterative Closest Point (ICP) algorithm is used to solve the local affine transformation between the corresponding sub point sets. Next, the local affine transformation obtained by the previous step is used to update the sub data point sets and their shape control point sets. Until the registration error converges, the loop ends and outputs the updated shape point set. Experimental results demonstrate that the accuracy and convergence of the proposed algorithm are greatly improved compared with the traditional point set non-rigid registration algorithms.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 920-927 |
| 页数 | 8 |
| 期刊 | Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology |
| 卷 | 40 |
| 期 | 4 |
| DOI | |
| 出版状态 | 已出版 - 2018 |
学术指纹
探究 'Robust Non-rigid Registration Algorithm Based on Local Affine Registration' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver