跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2604.04554 · v4

Epipolar-Constrained Graph Representation Learning for Geometric Pose Estimation

首次提交 2026-04-06 17:29
版本更新 2026-11-17 15:45
雷达观测 2026-11-18 19:43
arXiv ↗PDF ↗

摘要

We investigate geometry-aware graph representation learning for relative camera pose estimation using epipolar-constrained graph structures. Relative camera pose is commonly estimated from matched image correspondences that satisfy the epipolar constraint; however, identifying geometrically consistent correspondences under varying imaging conditions remains challenging. We employ an existing detector-free transformer architecture to establish correspondences between image pairs and construct a correspondence graph whose topology is guided by epipolar geometry. Initially, each node is connected to its (k) nearest neighbours based on spatial distance. The resulting graph is subsequently pruned using an initial estimate of the Essential Matrix, distinguishing the proposed formulation from conventional graph representations based primarily on heuristic spatial neighbourhoods. The graph learning module aggregates relational information between nodes into a graph-level representation that encodes the geometric context of the correspondences. This representation is passed to a pose regression network to estimate the relative camera rotation and translation. The model is trained across standard and wide baselines using a weighted objective that combines pose regression, scale consistency, heading consistency, and spectral properties of the pose parameters. Experimental graph analyses demonstrate that epipolar-guided edge pruning reduces graph connectivity by more than 90\% while retaining all correspondence nodes. Further spectral analyses characterize the effects of graph sparsification and injected outliers on learned graph representations.

作者备注:35 pages, 4 figures, 13 Tables, Submitted to Pattern Recognition Journal

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-17 15:45 · 最新观测版本

Epipolar-Constrained Graph Representation Learning for Geometric Pose Estimation

We investigate geometry-aware graph representation learning for relative camera pose estimation using epipolar-constrained graph structures. Relative camera pose is commonly estimated from matched image correspondences that satisfy the epipolar constraint; however, identifying geometrically consistent correspondences under varying imaging conditions remains challenging. We employ an existing detector-free transformer architecture to establish correspondences between image pairs and construct a correspondence graph whose topology is guided by epipolar geometry. Initially, each node is connected to its (k) nearest neighbours based on spatial distance. The resulting graph is subsequently pruned using an initial estimate of the Essential Matrix, distinguishing the proposed formulation from conventional graph representations based primarily on heuristic spatial neighbourhoods. The graph learning module aggregates relational information between nodes into a graph-level representation that encodes the geometric context of the correspondences. This representation is passed to a pose regression network to estimate the relative camera rotation and translation. The model is trained across standard and wide baselines using a weighted objective that combines pose regression, scale consistency, heading consistency, and spectral properties of the pose parameters. Experimental graph analyses demonstrate that epipolar-guided edge pruning reduces graph connectivity by more than 90\% while retaining all correspondence nodes. Further spectral analyses characterize the effects of graph sparsification and injected outliers on learned graph representations.

查看此版本解读 →查看此版本原文 ↗