Super Edge 4-Points Congruent Sets-Based Point Cloud Global Registration

共面性 计算机科学 点云 人工智能 GSM演进的增强数据速率 分割 计算机视觉 点(几何) 还原(数学) 集合(抽象数据类型) 比例(比率) 帧(网络) 算法 数学 几何学 程序设计语言 量子力学 物理 电信
作者
Shikun Li,Ruodan Lu,Jianya Liu,Liang Guo
出处
期刊:Remote Sensing [Multidisciplinary Digital Publishing Institute]
卷期号:13 (16): 3210-3210 被引量:16
标识
DOI:10.3390/rs13163210
摘要

With the acceleration in three-dimensional (3D) high-frame-rate sensing technologies, dense point clouds collected from multiple standpoints pose a great challenge for the accuracy and efficiency of registration. The combination of coarse registration and fine registration has been extensively promoted. Unlike the requirement of small movements between scan pairs in fine registration, coarse registration can match scans with arbitrary initial poses. The state-of-the-art coarse methods, Super 4-Points Congruent Sets algorithm based on the 4-Points Congruent Sets, improves the speed of registration to a linear order via smart indexing. However, the lack of reduction in the scale of original point clouds limits the application. Besides, the coplanarity of registration bases prevents further reduction of search space. This paper proposes a novel registration method called the Super Edge 4-Points Congruent Sets to address the above problems. The proposed algorithm follows a three-step procedure, including boundary segmentation, overlapping regions extraction, and bases selection. Firstly, an improved method based on vector angle is used to segment the original point clouds aiming to thin out the scale of the initial point clouds. Furthermore, overlapping regions extraction is executed to find out the overlapping regions on the contour. Finally, the proposed method selects registration bases conforming to the distance constraints from the candidate set without consideration about coplanarity. Experiments on various datasets with different characteristics have demonstrated that the average time complexity of the proposed algorithm is improved by 89.76%, and the accuracy is improved by 5 mm on average than the Super 4-Points Congruent Sets algorithm. More encouragingly, the experimental results show that the proposed algorithm can be applied to various restrictive cases, such as few overlapping regions and massive noise. Therefore, the algorithm proposed in this paper is a faster and more robust method than Super 4-Points Congruent Sets under the guarantee of the promised quality.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
flymove完成签到,获得积分10
1秒前
kkkay发布了新的文献求助10
3秒前
陶汪酱完成签到,获得积分10
3秒前
852的应助被hh嘉靖无敌采纳,获得10
3秒前
Snail6完成签到,获得积分10
4秒前
majid123完成签到,获得积分10
5秒前
仔仔完成签到,获得积分10
6秒前
奋斗的秋凌完成签到,获得积分10
6秒前
CJ1977完成签到,获得积分10
7秒前
7秒前
XS_QI完成签到 ,获得积分10
8秒前
龙飞完成签到,获得积分10
8秒前
金陵小帅完成签到,获得积分10
8秒前
半颗橙子完成签到 ,获得积分10
8秒前
zyy完成签到,获得积分10
9秒前
陈雨柏完成签到,获得积分10
10秒前
chenamy完成签到,获得积分10
11秒前
11秒前
胡玲完成签到 ,获得积分10
12秒前
收破烂的要不完成签到,获得积分10
14秒前
搞怪的水彤完成签到 ,获得积分10
14秒前
14秒前
kkkay发布了新的文献求助10
14秒前
ximi发布了新的文献求助10
15秒前
KX2024完成签到,获得积分10
17秒前
赵田完成签到 ,获得积分10
17秒前
17秒前
森sen完成签到 ,获得积分10
19秒前
77完成签到 ,获得积分10
19秒前
快乐的忆安完成签到,获得积分10
20秒前
丽丽完成签到,获得积分10
21秒前
梓树完成签到,获得积分10
21秒前
Kai完成签到 ,获得积分10
21秒前
21秒前
22秒前
Orange的应助被科研通管家采纳,获得10
22秒前
23秒前
葱姜蒜辣椒香菜我全要完成签到,获得积分10
23秒前
123完成签到,获得积分10
23秒前
高分求助中
(应助此贴封号)通过应助OA文献获取积分 10000
Rosenblum, Global Change Biology 800
Organizational Behavior 510
Management and the Arts 510
Convergent and bidirectional strategies towards the total synthesis of hemibrevetoxin B 300
Geschichtliche Grundbegriffe (GGB), Band 5: Pro–Soz 300
Die Religion in Geschichte und Gegenwart (RGG), 4. Auflage, Band 7: R–S 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 计算机科学 工程类 纳米技术 内科学 物理 有机化学 化学工程 生物化学 复合材料 光电子学 细胞生物学 心理学 量子力学 催化作用 物理化学 电极
热门帖子
关注 科研通微信公众号,转发送积分 7797841
求助须知:如何正确求助?哪些是违规求助? 9333151
关于积分的说明 20458083
捐赠科研通 7388507
什么是DOI,文献DOI怎么找? 3325487
关于科研通互助平台的介绍 2472847
邀请新用户注册赠送积分活动 2342846