arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.08446cs.LGcs.CGstat.ML
收藏

将点对齐为线:可证明的近似

Aligning Points to Lines: Provable Approximations

University of Haifa(海法大学)

Ibrahim Jubran, Dan Feldman

摘要:

我们提出了一种新的优化技术,用于最小化的总和$\sum_{i=1}^n f_i(x)$的$n$非凸实函数,满足一个属性,我们称之为分段对数Lipschitz。这是通过锻造计算几何,组合学和凸优化技术之间的联系。作为示例应用,我们提供了第一个常数因子近似算法,其运行时间在$n$中是多项式,用于\emph{Points-to-Lines alignment}的基本问题:给定平面上的$n$点$p_1,\cdots,p_n$和$n$线$\ell_1,\cdots,\ell_n$以及$z>0$,计算匹配的$π:[n]\to[n]$和对齐(旋转矩阵$R$和平移向量$t$)最小化每个点到其对应线之间的欧几里得距离之和$\sum_{i=1}^n \mathrm{dist}(Rp_i-t,\ell_{π(i)})^z$。即使给出了$z=1$和匹配的$π$,这个问题也是不平凡的。如果$π$是给定的,我们的算法的运行时间是$O(n^3)$,甚至接近线性的$n$使用的核心集,支持:流,动态和分布式并行计算在多对数更新时间。还提供了用于处理例如离群值或伪距离(诸如$M$ -估计器)的问题的概括。实验结果和开源代码表明,我们的可证明算法改善现有的算法也在实践中。在增强现实的背景下,一个配套的演示视频展示了如何在实时系统中使用这种算法。

英文摘要:

We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational geometry, combinatorics and convex optimization. As an example application, we provide the first constant-factor approximation algorithms whose running-time is polynomial in $n$ for the fundamental problem of \emph{Points-to-Lines alignment}: Given $n$ points $p_1,\cdots,p_n$ and $n$ lines $\ell_1,\cdots,\ell_n$ on the plane and $z>0$, compute the matching $π:[n]\to[n]$ and alignment (rotation matrix $R$ and a translation vector $t$) that minimize the sum of Euclidean distances $\sum_{i=1}^n \mathrm{dist}(Rp_i-t,\ell_{π(i)})^z$ between each point to its corresponding line. This problem is non-trivial even if $z=1$ and the matching $π$ is given. If $π$ is given, the running time of our algorithms is $O(n^3)$, and even near-linear in $n$ using core-sets that support: streaming, dynamic, and distributed parallel computations in poly-logarithmic update time. Generalizations for handling e.g. outliers or pseudo-distances such as $M$-estimators for the problem are also provided. Experimental results and open source code show that our provable algorithms improve existing heuristics also in practice. A companion demonstration video in the context of Augmented Reality shows how such algorithms may be used in real-time systems.

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

↑