arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.13058math.AGcs.CV
收藏

视角四点问题的多项式公式

A polynomial formula for the perspective four points problem

David Lehavi, Brian Osserman

AI总结:

本文提出了一种基于多项式公式的视角四点问题求解方法,通过变量分离和绝对定向问题转换,实现高效且准确的解决方案。

摘要:

我们通过一种新的方法解决了视角n点问题,特别是n=4的情况。我们的解决方案依赖于一种新的变量分离方法:给定四个3D点和四个对应的2D点在相机画面上,我们首先找到另一组3D点,这些点位于连接相机到2D画面上点的射线上,使得这些3D点之间的六对距离尽可能接近原始3D点之间的六对距离。这一步将视角问题转化为一个绝对定向问题,该问题可以通过显式公式求解。为了解决第一个问题,我们设置的坐标尽可能无方向性:在3D点方面,我们的坐标是点之间的平方距离;在2D画面上的点方面,我们的坐标是将其中一个点旋转到光学轴上后的点积。然后我们借助计算机代数系统推导出解。我们的解决方案比现有最先进算法快一个数量级,同时在现实噪声下提供相似的准确性。此外,我们的将问题归约为绝对定向问题的步骤比其他视角问题求解器快两个数量级,使得在实现RANSAC时能够进行极高效的种子拒绝。

英文摘要:

We present a fast and accurate solution to the perspective $n$-points problem, by way of a new approach to the n=4 case. Our solution hinges on a novel separation of variables: given four 3D points and four corresponding 2D points on the camera canvas, we start by finding another set of 3D points, sitting on the rays connecting the camera to the 2D canvas points, so that the six pair-wise distances between these 3D points are as close as possible to the six distances between the original 3D points. This step reduces the perspective problem to an absolute orientation problem, which has a solution via explicit formula. To solve the first problem we set coordinates which are as orientation-free as possible: on the 3D points side our coordinates are the squared distances between the points. On the 2D canvas-points side our coordinates are the dot products of the points after rotating one of them to sit on the optical axis. We then derive the solution with the help of a computer algebra system. Our solution is an order of magnitude faster than state of the art algorithms, while offering similar accuracy under realistic noise. Moreover, our reduction to the absolute orientation problem runs two orders of magnitude faster than other perspective problem solvers, allowing extremely efficient seed rejection when implementing RANSAC.

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

↑