Robust line segment matching via reweighted random walks on the homography graph
Robust line segment matching via reweighted random walks on the homography graph
复制标题
通过单应图上的重新加权随机游走实现稳健的线段匹配
DOI：
10.1016/j.patcog.2020.107693
复制
发表时间：
2021
影响因子：
8
通讯作者：
Chang Li
中科院分区：
文献类型：
--
作者：
Dong Wei;Yongjun Zhang;Chang Li
提出了一种立体图像间直线段匹配的新方法。给定基本矩阵，局部单应性可以用成对线段候选来过度确定。我们利用这个约束来初始化候选人和构造新的单应性图。由于节点间的约束是基于对极几何的，所以单应图对局部投影变换是不变性的。我们使用图上的重新加权随机游走对候选进行排序，然后，我们提出了约束贪婪算法来获得可靠的匹配。据我们所知，这是第一次研究嵌入极几何图匹配理论的线段匹配。在对32幅图像进行测试时，我们的方法优于现有的方法，特别是在宽基线、陡峭视点变化和密集线段的场景中。所提出的算法可在https://github.com/weidong-whu/line-match-RRW上获得。
This paper presents a novel method for matching line segments between stereo images. Given the fundamental matrix, the local homography can be over determined with pairwise line segment candidates. We exploit this constraint to initialize the candidate and construct the novel homography graph. Because the constraint between the node is based on the epipolar geometry, the homography graph is invariant to the local projective transformation. We employ the reweighted random walk on the graph to rank the candidate, then, we propose the constrained-greedy algorithm to obtain the reliable match. To the best of our knowledge, this is the first study to embed the epipolar geometry into the graph matching theory for the line segment matching. When evaluated on the 32 image patches, our method outperformed the state of the art methods, especially in the scenes of the wide baseline, steep viewpoint changes and dense line segments. The proposed algorithm is available at https://github.com/weidong-whu/line-match-RRW.