多结构模型稳健拟合的增量Top-k列表比较方法
Incremental Top-k List Comparison Approach to Robust Multi-Structure Model Fitting
摘要:
随机假设采样是许多流行的鲁棒拟合技术(如RANSAC)的核心。在本文中,我们提出了一种新的假设抽样方案的基础上增量计算的部分排名(顶部$k$列表)之间的距离来自剩余排序信息。我们的方法同时(1)指导采样,使得可以快速检索对应于所有真实结构的假设,以及(2)过滤假设,使得仅保留一个小的但非常有希望的子集。这允许在幸存的假设上使用简单的凝聚聚类来进行准确的模型选择。其结果是一种高效的多结构抗差估计技术。合成和真实数据的实验表明,我们的方法优于以前的方法的性能。
英文摘要:
Random hypothesis sampling lies at the core of many popular robust fitting techniques such as RANSAC. In this paper, we propose a novel hypothesis sampling scheme based on incremental computation of distances between partial rankings (top-$k$ lists) derived from residual sorting information. Our method simultaneously (1) guides the sampling such that hypotheses corresponding to all true structures can be quickly retrieved and (2) filters the hypotheses such that only a small but very promising subset remain. This permits the usage of simple agglomerative clustering on the surviving hypotheses for accurate model selection. The outcome is a highly efficient multi-structure robust estimation technique. Experiments on synthetic and real data show the superior performance of our approach over previous methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。