详细信息
- 来源站点
- ArXiv CS.CV
- 作者
- Johan Edstedt, David Nordstr\"om, Yushan Zhang, Georg B\"okman, Jonathan Astermark, Viktor Larsson, Anders Heyden, Fredrik Kahl, M{\aa}rten Wadenb\"ack, Michael Felsberg
- 文章类型
- PAPER
- 语言
- en
- 发布日期
- 2026-07-07
摘要
arXiv:2511.15706v3 Announce Type: replace Abstract: Dense feature matching aims to estimate all correspondences between two images of a 3D scene and has recently been established as the gold standard due to its high accuracy and robustness. However, existing dense matchers still fail or perform poorly for many hard real-world scenarios, and high-precision models are often slow, limiting their applicability. In this paper, we attack these weaknesses on a wide front through a series of systematic improvements that together yield a significantly better model. In particular, we construct a novel matching architecture and loss, which, combined with a curated diverse training distribution, enables our model to solve many complex matching tasks. We further make training faster through a decoupled two-stage matching-then-refinement pipeline, and at the same time, significantly reduce refinement memory usage through a custom CUDA kernel.
相关事件
暂无数据
相关公司
暂无数据
相关人物
暂无数据