.png){kind=icon}
返回
Graph Correspondence-Based Point Set Registration
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2024.3376700.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Point set registration, crucial in computer vision and robotics applications, encounters challenges, such as noise, outliers, and misalignment. Current methods often struggle with these issues, leading to suboptimal registration accuracy. This article proposes a novel graph correspondence-based algorithm to address these challenges in rigid point set registration. We model point sets as graphs, transforming the registration problem into a graph isomorphism problem. This approach is enhanced with probabilistic linear programming heuristics to efficiently establish correspondences between point sets. Our method significantly improves robustness against common registration errors and does not require initial pose estimation, a notable advantage over existing algorithms. Extensive experiments on various datasets, including applications in intelligent vehicle mapping and localization, demonstrate superior performance in correspondence establishment and registration accuracy compared to state-of-the-art methods, particularly under conditions of noise, outliers, and misalignment.
Keyword:
Graph isomorphism
linear programming (LP) heuristics
Monte Carlo (MC) method
point set registration
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Subversion of Autophagy in Adherent Invasive Escherichia coli-Infected Neutrophils Induces Inflammation and Cell Death.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏Data-processing artefacts in three-dimensional dive path reconstruction from geomagnetic and acceleration data从地磁和加速度数据进行三维潜水路径重建中的数据处理伪像
PREAI
分享收藏
查看更多内容