期刊
COMPUTER GRAPHICS FORUM
卷 32, 期 5, 页码 113-123出版社
WILEY
DOI: 10.1111/cgf.12178
关键词
I; 3; 5 [Computer Graphics]: Computational Geometry and Object ModelingGeometric algorithms; languages; and systems
资金
- Swiss National Science Foundation (SNSF) [20PA21L_129607]
- Swiss National Science Foundation (SNF) [20PA21L_129607] Funding Source: Swiss National Science Foundation (SNF)
Rigid registration of two geometric data sets is essential in many applications, including robot navigation, surface reconstruction, and shape matching. Most commonly, variants of the Iterative Closest Point (ICP) algorithm are employed for this task. These methods alternate between closest point computations to establish correspondences between two data sets, and solving for the optimal transformation that brings these correspondences into alignment. A major difficulty for this approach is the sensitivity to outliers and missing data often observed in 3D scans. Most practical implementations of the ICP algorithm address this issue with a number of heuristics to prune or reweight correspondences. However, these heuristics can be unreliable and difficult to tune, which often requires substantial manual assistance. We propose a new formulation of the ICP algorithm that avoids these difficulties by formulating the registration optimization using sparsity inducing norms. Our new algorithm retains the simple structure of the ICP algorithm, while achieving superior registration results when dealing with outliers and incomplete data. The complete source code of our implementation is provided at http://lgg.epfl.ch/sparseicp.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据