.png){kind=icon}
返回
Pre-registration of arbitrarily oriented 3D surfaces using a genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2005.07.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper reports on a successful application of genetic optimisation in 3D data registration. We consider the problem of Euclidean alignment of two arbitrarily oriented, partially overlapping surfaces represented by measured point sets contaminated by noise and outliers. Recently, we have proposed the Trimmed Iterative Closest Point algorithm (TrICP) [Chetverikov, D., StepaDov, D., Krsek, P., (2005). Robust Euclidean alignment of 3d point sets: the trimmed iterative closest point algorithm. Image Vision Comput. 23, 299309] which is fast, applicable to overlaps under 50% and robust to erroneous and incomplete measurements. However, like other iterative methods, TrICP only works with roughly pre-registered surfaces. In this study, we propose a genetic algorithm for pre-alignment of arbitrarily oriented surfaces. Precision and robustness of TrICP are combined with generality of genetic algorithms. This results in a precise and fully automatic 3D data alignment system that needs no manual pre-registration. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
3D registration
point sets
data alignment
genetic algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容