Saved in:
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.15706 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915628114247680 |
|---|---|
| author | Edstedt, Johan Nordström, David Zhang, Yushan Bökman, Georg Astermark, Jonathan Larsson, Viktor Heyden, Anders Kahl, Fredrik Wadenbäck, Mårten Felsberg, Michael |
| author_facet | Edstedt, Johan Nordström, David Zhang, Yushan Bökman, Georg Astermark, Jonathan Larsson, Viktor Heyden, Anders Kahl, Fredrik Wadenbäck, Mårten Felsberg, Michael |
| contents | 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. Finally, we leverage the recent DINOv3 foundation model along with multiple other insights to make the model more robust and unbiased. In our extensive set of experiments we show that the resulting novel matcher sets a new state-of-the-art, being significantly more accurate than its predecessors. Code is available at https://github.com/Parskatt/romav2 |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_15706 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | RoMa v2: Harder Better Faster Denser Feature Matching Edstedt, Johan Nordström, David Zhang, Yushan Bökman, Georg Astermark, Jonathan Larsson, Viktor Heyden, Anders Kahl, Fredrik Wadenbäck, Mårten Felsberg, Michael Computer Vision and Pattern Recognition 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. Finally, we leverage the recent DINOv3 foundation model along with multiple other insights to make the model more robust and unbiased. In our extensive set of experiments we show that the resulting novel matcher sets a new state-of-the-art, being significantly more accurate than its predecessors. Code is available at https://github.com/Parskatt/romav2 |
| title | RoMa v2: Harder Better Faster Denser Feature Matching |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2511.15706 |