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

使用部分增量排序和累积的快速几何修剪拟合

Fast geometric trim fitting using partial incremental sorting and accumulation

ShanghaiTech University(上海科技大学)

Min Li, Laurent Kneip

摘要:

我们提出了一个算法的贡献,以提高效率的鲁棒修剪拟合在离群影响的几何回归问题。该方法严重依赖于快速排序算法,我们提出了两个重要的见解。首先,部分排序对于第x个百分位值的增量计算是足够的。其次,线性拟合问题中的正规方程可以通过在排序期间记录跨第x个百分位边界的交换操作来增量地更新。除了线性拟合问题,我们演示了如何将该技术可以另外应用于封闭形式,非线性能量最小化问题,从而实现高效的修剪拟合几何最优目标。我们将我们的方法应用到两个不同的相机切除算法,并展示了高效可靠的几何修剪拟合。

英文摘要:

We present an algorithmic contribution to improve the efficiency of robust trim-fitting in outlier affected geometric regression problems. The method heavily relies on the quick sort algorithm, and we present two important insights. First, partial sorting is sufficient for the incremental calculation of the x-th percentile value. Second, the normal equations in linear fitting problems may be updated incrementally by logging swap operations across the x-th percentile boundary during sorting. Besides linear fitting problems, we demonstrate how the technique can be additionally applied to closed-form, non-linear energy minimization problems, thus enabling efficient trim fitting under geometrically optimal objectives. We apply our method to two distinct camera resectioning algorithms, and demonstrate highly efficient and reliable, geometric trim fitting.

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

↑