arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.3352cs.CVcs.GR
收藏

多视点$L2$三角剖分的牛顿型迭代解法

Newton-Type Iterative Solver for Multiple View $L2$ Triangulation

F. Lu, Z. Chen

摘要:

本文证明了用两阶段Newton类迭代法可以有效地求出大多数真实多视图L2三角剖分问题的L2最优解,而这类问题的难点主要在于如何验证L2最优性.这种两阶段光束法平差方法的特点是:首先,通过对称点三角剖分(中点法的多视图推广)初始化算法;其次,采用符号-数值方法精确计算导数;第三,将线搜索或信赖域等全局化策略平滑地应用于底层迭代,保证了算法在一般情况下的鲁棒性。与tfml方法的数值比较表明,本文提出的两阶段迭代光束法平差方法所获得的局部极小值也是牛津视觉几何组在线提供的所有校准数据集的L2最优解。大量的数值实验表明,光束法平差最优地解决了99%以上的实际三角测量问题。IEEE 754双精度的C++实现表明,在3.4GHz Intel i7 CPU的计算机上,采用Gauss-Newton迭代法和线搜索策略相结合,计算牛津恐龙数据集的所有4983个点仅需0.205秒。

英文摘要:

In this note, we show that the L2 optimal solutions to most real multiple view L2 triangulation problems can be efficiently obtained by two-stage Newton-like iterative methods, while the difficulty of such problems mainly lies in how to verify the L2 optimality. Such a working two-stage bundle adjustment approach features: first, the algorithm is initialized by symmedian point triangulation, a multiple-view generalization of the mid-point method; second, a symbolic-numeric method is employed to compute derivatives accurately; third, globalizing strategy such as line search or trust region is smoothly applied to the underlying iteration which assures algorithm robustness in general cases. Numerical comparison with tfml method shows that the local minimizers obtained by the two-stage iterative bundle adjustment approach proposed here are also the L2 optimal solutions to all the calibrated data sets available online by the Oxford visual geometry group. Extensive numerical experiments indicate the bundle adjustment approach solves more than 99% the real triangulation problems optimally. An IEEE 754 double precision C++ implementation shows that it takes only about 0.205 second tocompute allthe 4983 points in the Oxford dinosaur data setvia Gauss-Newton iteration hybrid with a line search strategy on a computer with a 3.4GHz Intel i7 CPU.

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

↑