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

部分重叠点集匹配的凹优化算法

A Concave Optimization Algorithm for Matching Partially Overlapping Point Sets

Changzhi University(长治学院);The Hong Kong Polytechnic University(香港理工大学)

Wei Lian, Lei Zhang

摘要:

点匹配是指找到两组点之间的空间变换和对应关系的过程。在本文中,我们主要关注的情况下,只有部分重叠的两个点集之间。在鲁棒点匹配方法的方法之后,我们将点匹配建模为混合线性分配最小二乘问题,并表明在消除变换变量之后,所产生的关于点对应的最小化问题是凹优化问题。此外,这个问题的性质,目标函数可以转换成一个形式,通过线性变换的非线性项很少。基于这些性质,我们采用分支定界(BnB)算法来优化所产生的问题,其中的搜索空间的维度是小的。为了进一步提高效率的BnB算法的计算下界是瓶颈,我们提出了一个新的下界计划,具有k-基数线性分配公式,可以有效地解决。实验结果表明,该算法优于国家的最先进的方法在鲁棒性的干扰和点匹配精度。

英文摘要:

Point matching refers to the process of finding spatial transformation and correspondences between two sets of points. In this paper, we focus on the case that there is only partial overlap between two point sets. Following the approach of the robust point matching method, we model point matching as a mixed linear assignment-least square problem and show that after eliminating the transformation variable, the resulting problem of minimization with respect to point correspondence is a concave optimization problem. Furthermore, this problem has the property that the objective function can be converted into a form with few nonlinear terms via a linear transformation. Based on these properties, we employ the branch-and-bound (BnB) algorithm to optimize the resulting problem where the dimension of the search space is small. To further improve efficiency of the BnB algorithm where computation of the lower bound is the bottleneck, we propose a new lower bounding scheme which has a k-cardinality linear assignment formulation and can be efficiently solved. Experimental results show that the proposed algorithm outperforms state-of-the-art methods in terms of robustness to disturbances and point matching accuracy.

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

↑