极小化分式RMSD的离群稳健ICP
Outlier Robust ICP for Minimizing Fractional RMSD
摘要:
我们描述了一个变化的迭代最近点(ICP)算法对齐两个点集下的一组变换。我们的算法优于以前的算法,因为(1)在确定最佳比对,它识别和丢弃可能的离群值在统计上稳健的方式,(2)它是保证收敛到局部最优解。为此,我们正式提出了一种新的距离测度,分数均方根距离(frmsd),它将分数的内点的距离函数。我们制定了一个具体的实现,但我们的框架可以轻松地融入现代配准算法的大多数技术和启发式方法。我们实验验证我们的算法对以前的技术暴露于各种离群值类型的2维和3维数据。
英文摘要:
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms because (1) in determining the optimal alignment, it identifies and discards likely outliers in a statistically robust manner, and (2) it is guaranteed to converge to a locally optimal solution. To this end, we formalize a new distance measure, fractional root mean squared distance (frmsd), which incorporates the fraction of inliers into the distance function. We lay out a specific implementation, but our framework can easily incorporate most techniques and heuristics from modern registration algorithms. We experimentally validate our algorithm against previous techniques on 2 and 3 dimensional data exposed to a variety of outlier types.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。