• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于局部特征对应关系的点云配准——在具有挑战性数据集上的评估

Point cloud registration from local feature correspondences-Evaluation on challenging datasets.

作者信息

Petricek Tomas, Svoboda Tomas

机构信息

Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic.

出版信息

PLoS One. 2017 Nov 14;12(11):e0187943. doi: 10.1371/journal.pone.0187943. eCollection 2017.

DOI:10.1371/journal.pone.0187943
PMID:29136000
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC5685596/
Abstract

Registration of laser scans, or point clouds in general, is a crucial step of localization and mapping with mobile robots or in object modeling pipelines. A coarse alignment of the point clouds is generally needed before applying local methods such as the Iterative Closest Point (ICP) algorithm. We propose a feature-based approach to point cloud registration and evaluate the proposed method and its individual components on challenging real-world datasets. For a moderate overlap between the laser scans, the method provides a superior registration accuracy compared to state-of-the-art methods including Generalized ICP, 3D Normal-Distribution Transform, Fast Point-Feature Histograms, and 4-Points Congruent Sets. Compared to the surface normals, the points as the underlying features yield higher performance in both keypoint detection and establishing local reference frames. Moreover, sign disambiguation of the basis vectors proves to be an important aspect in creating repeatable local reference frames. A novel method for sign disambiguation is proposed which yields highly repeatable reference frames.

摘要

激光扫描的配准,或者一般意义上的点云配准,是移动机器人定位与建图或者物体建模流程中的关键步骤。在应用诸如迭代最近点(ICP)算法等局部方法之前,通常需要对这些点云进行粗略对齐。我们提出一种基于特征的点云配准方法,并在具有挑战性的真实世界数据集上评估该方法及其各个组件。对于激光扫描之间适度的重叠情况,与包括广义ICP、3D正态分布变换、快速点特征直方图和四点全等集在内的现有方法相比,该方法具有更高的配准精度。与表面法线相比,作为基础特征的点在关键点检测和建立局部参考系方面都具有更高的性能。此外,基向量的符号消歧被证明是创建可重复局部参考系的一个重要方面。我们提出了一种新的符号消歧方法,该方法能产生高度可重复的参考系。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/ea6d3ffa78a0/pone.0187943.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/31d78029c855/pone.0187943.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/e20dee558b8b/pone.0187943.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/e7784a2bf7d9/pone.0187943.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/ed681cce3f1e/pone.0187943.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/2d12c4adccf2/pone.0187943.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/ea6d3ffa78a0/pone.0187943.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/31d78029c855/pone.0187943.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/e20dee558b8b/pone.0187943.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/e7784a2bf7d9/pone.0187943.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/ed681cce3f1e/pone.0187943.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/2d12c4adccf2/pone.0187943.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2fd4/5685596/ea6d3ffa78a0/pone.0187943.g006.jpg

相似文献

1
Point cloud registration from local feature correspondences-Evaluation on challenging datasets.基于局部特征对应关系的点云配准——在具有挑战性数据集上的评估
PLoS One. 2017 Nov 14;12(11):e0187943. doi: 10.1371/journal.pone.0187943. eCollection 2017.
2
Point Cloud Registration Method Based on Geometric Constraint and Transformation Evaluation.基于几何约束和变换评估的点云配准方法
Sensors (Basel). 2024 Mar 14;24(6):1853. doi: 10.3390/s24061853.
3
An Iterative Closest Points Algorithm for Registration of 3D Laser Scanner Point Clouds with Geometric Features.一种用于具有几何特征的三维激光扫描仪点云配准的迭代最近点算法。
Sensors (Basel). 2017 Aug 11;17(8):1862. doi: 10.3390/s17081862.
4
Automatic point cloud registration algorithm based on the feature histogram of local surface.基于局部曲面特征直方图的自动点云配准算法。
PLoS One. 2020 Sep 11;15(9):e0238802. doi: 10.1371/journal.pone.0238802. eCollection 2020.
5
Registration of 3D point clouds using a local descriptor based on grid point normal.基于网格点法线的局部描述符对三维点云进行配准。
Appl Opt. 2021 Oct 1;60(28):8818-8828. doi: 10.1364/AO.437477.
6
Iterative most-likely point registration (IMLP): a robust algorithm for computing optimal shape alignment.迭代最可能点配准(IMLP):一种用于计算最优形状对齐的稳健算法。
PLoS One. 2015 Mar 6;10(3):e0117688. doi: 10.1371/journal.pone.0117688. eCollection 2015.
7
A Structure-Based Iterative Closest Point Using Anderson Acceleration for Point Clouds with Low Overlap.基于结构的迭代最近点算法(ICP),使用安德森加速,用于低重叠度点云。
Sensors (Basel). 2023 Feb 11;23(4):2049. doi: 10.3390/s23042049.
8
Robust Coarse-to-Fine Registration Scheme for Mobile Laser Scanner Point Clouds Using Multiscale Eigenvalue Statistic-Based Descriptor.基于多尺度特征值统计描述符的移动激光扫描仪点云鲁棒粗到精配准方案
Sensors (Basel). 2021 Apr 1;21(7):2431. doi: 10.3390/s21072431.
9
Fast Descriptors and Correspondence Propagation for Robust Global Point Cloud Registration.快速描述符和对应传播的鲁棒全局点云配准。
IEEE Trans Image Process. 2017 Aug;26(8):3614-3623. doi: 10.1109/TIP.2017.2700727. Epub 2017 May 3.
10
Hierarchical Optimization of 3D Point Cloud Registration.三维点云配准的分层优化
Sensors (Basel). 2020 Dec 7;20(23):6999. doi: 10.3390/s20236999.

引用本文的文献

1
Extraction of Moso Bamboo Parameters Based on the Combination of ALS and TLS Point Cloud Data.基于 ALS 和 TLS 点云数据组合的毛竹参数提取。
Sensors (Basel). 2024 Jun 21;24(13):4036. doi: 10.3390/s24134036.
2
Robust Coarse-to-Fine Registration Scheme for Mobile Laser Scanner Point Clouds Using Multiscale Eigenvalue Statistic-Based Descriptor.基于多尺度特征值统计描述符的移动激光扫描仪点云鲁棒粗到精配准方案
Sensors (Basel). 2021 Apr 1;21(7):2431. doi: 10.3390/s21072431.
3
Robust 3D point cloud registration based on bidirectional Maximum Correntropy Criterion.
基于双向最大互信息准则的鲁棒三维点云配准。
PLoS One. 2018 May 25;13(5):e0197542. doi: 10.1371/journal.pone.0197542. eCollection 2018.