arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.13875cs.CV
收藏

在共识空间中通过聚类寻找几何模型

Finding Geometric Models by Clustering in the Consensus Space

ETH Zurich(苏黎世联邦理工学院);CTU in Prague(布拉格捷克理工大学);TMEIC Corporation Americas(东芝三菱电机产业系统美洲公司);Eötvös Loránd University(厄特沃什·罗兰大学)

Daniel Barath, Denys Rozumny, Ivan Eichhardt, Levente Hajder, Jiri Matas

AI总结:

本文提出一种在共识空间中通过聚类逐步发现多个几何模型的迭代算法,结合确定性空间相干采样,在实时运行的同时实现最先进精度,并应用于位姿估计、轨迹估计和全局SfM。

摘要:

我们提出一种用于寻找未知数量几何模型(例如单应性)的新算法。该问题被形式化为在不形成明确的点-模型分配的情况下逐步寻找主导模型实例。主导实例通过类似RANSAC的采样和一个由模型质量函数驱动的整合过程来发现,该质量函数考虑了先前提出的实例。新实例通过在共识空间中进行聚类来发现。这种新形式化产生了一种简单的迭代算法,具有最先进的精度,同时在多个视觉问题上实时运行——在两视图运动估计上比竞争对手至少快两个数量级。此外,我们提出了一种确定性采样器,反映了真实世界数据倾向于形成空间相干结构的事实。该采样器在一个逐步稠密化的邻域图中返回连通分量。我们展示了多个应用,其中使用多个几何模型提高了精度。这些包括从多个广义单应性进行位姿估计;快速移动物体的轨迹估计;我们还提出了一种在全局SfM算法中使用多个单应性的方法。源代码:https://github.com/danini/clustering-in-consensus-space。

英文摘要:

We propose a new algorithm for finding an unknown number of geometric models, e.g., homographies. The problem is formalized as finding dominant model instances progressively without forming crisp point-to-model assignments. Dominant instances are found via a RANSAC-like sampling and a consolidation process driven by a model quality function considering previously proposed instances. New ones are found by clustering in the consensus space. This new formulation leads to a simple iterative algorithm with state-of-the-art accuracy while running in real-time on a number of vision problems - at least two orders of magnitude faster than the competitors on two-view motion estimation. Also, we propose a deterministic sampler reflecting the fact that real-world data tend to form spatially coherent structures. The sampler returns connected components in a progressively densified neighborhood-graph. We present a number of applications where the use of multiple geometric models improves accuracy. These include pose estimation from multiple generalized homographies; trajectory estimation of fast-moving objects; and we also propose a way of using multiple homographies in global SfM algorithms. Source code: https://github.com/danini/clustering-in-consensus-space.

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

↑