arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.07284cs.ROcs.LG
收藏

CLIPPER:无需初始猜测的鲁棒数据关联

CLIPPER: Robust Data Association without an Initial Guess

Massachusetts Institute of Technology(麻省理工学院)

Parker C. Lusk, Jonathan P. How

AI总结:

本文提出基于稠密边加权团优化的无初始猜测鲁棒数据关联方法CLIPPER,通过凸半定松弛与快速一阶算法,在点云配准中实现95%离群点下的鲁棒性,显著优于现有方法。

摘要:

在含噪数据中识别对应关系是估计过程中至关重要的步骤。当存在信息丰富的初始估计猜测时,数据关联的挑战不那么严峻;然而,在大多数情况下,高质量初始猜测的存在十分罕见。我们探索了不需要初始估计猜测的图论数据关联公式。现有的图论方法在无权图上进行优化,丢弃了加权边中编码的重要一致性信息,并且经常试图精确求解NP困难问题。相反,我们提出了一个新的优化问题,充分利用加权图并寻找最稠密的边加权团。我们引入了该问题的两种松弛方法:一个经验上被证明是紧致的凸半定松弛,以及一个名为CLIPPER的快速一阶算法,该算法通常能在几毫秒内得到近乎最优的解。在点云配准问题上评估时,我们的算法在至少95%的离群点下仍保持鲁棒,而现有算法在80%的离群点时就开始失效。代码可在 https://mit-acl.github.io/clipper 获取。

英文摘要:

Identifying correspondences in noisy data is a critically important step in estimation processes. When an informative initial estimation guess is available, the data association challenge is less acute; however, the existence of a high-quality initial guess is rare in most contexts. We explore graph-theoretic formulations for data association, which do not require an initial estimation guess. Existing graph-theoretic approaches optimize over unweighted graphs, discarding important consistency information encoded in weighted edges, and frequently attempt to solve NP-hard problems exactly. In contrast, we formulate a new optimization problem that fully leverages weighted graphs and seeks the densest edge-weighted clique. We introduce two relaxations to this problem: a convex semidefinite relaxation which we find to be empirically tight, and a fast first-order algorithm called CLIPPER which frequently arrives at nearly-optimal solutions in milliseconds. When evaluated on point cloud registration problems, our algorithms remain robust up to at least 95% outliers while existing algorithms begin breaking down at 80% outliers. Code is available at https://mit-acl.github.io/clipper.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑