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

对齐部分重叠点集:一种内近似算法

Aligning Partially Overlapping Point Sets: an Inner Approximation Algorithm

Changzhi University(长治学院);The Hong Kong Polytechnic University(香港理工大学);Harbin Institute of Technology(哈尔滨工业大学)

Wei Lian, WangMeng Zuo, Lei Zhang

摘要:

在计算机视觉中,在没有关于变换值的先验信息的情况下对齐部分重叠的点集是一个具有挑战性的问题。为了实现这一目标,我们首先降低了目标的鲁棒点匹配算法的低维变量的函数。然而,所得到的功能,只是凹的有限区域,包括可行的区域。为了解决这个问题,我们采用内近似优化算法,该算法只在目标函数为凹的区域内运行。我们的算法不需要正则化的转换,因此可以处理的情况下,没有先验信息的值的转换。我们的方法也是$ε-$全局最优的,因此保证是鲁棒的。此外,它的计算最昂贵的子程序是一个线性分配问题,可以有效地解决。实验结果表明,所提出的方法比国家的最先进的算法具有更好的鲁棒性。我们的方法也是有效的,当变换参数的数量是小的。

英文摘要:

Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point matching algorithm to a function of a low dimensional variable. The resulting function, however, is only concave over a finite region including the feasible region. To cope with this issue, we employ the inner approximation optimization algorithm which only operates within the region where the objective function is concave. Our algorithm does not need regularization on transformation, and thus can handle the situation where there is no prior information about the values of the transformations. Our method is also $ε-$globally optimal and thus is guaranteed to be robust. Moreover, its most computationally expensive subroutine is a linear assignment problem which can be efficiently solved. Experimental results demonstrate the better robustness of the proposed method over state-of-the-art algorithms. Our method is also efficient when the number of transformation parameters is small.

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

↑