RUBIK: A Structured Benchmark for Image Matching across Geometric Challenges

Thibaut Loiseau, Guillaume Bourmaud
2/10/2026

No official code found. Best implementation: thibautloiseau/RUBIK (29 stars, last commit 2025-06-15).

Abstract

Camera pose estimation is crucial for many computer vision applications, yet existing benchmarks offer limited insight into method limitations across different geometric challenges. We introduce RUBIK, a novel benchmark that systematically evaluates image matching methods across well-defined geometric difficulty levels. Using three complementary criteria - overlap, scale ratio, and viewpoint angle - we organize 16.5K image pairs from nuScenes into 33 difficulty levels. Our comprehensive evaluation of 14 methods reveals that while recent detector-free approaches achieve the best performance (>47% success rate), they come with significant computational overhead compared to detector-based methods (150-600ms vs. 40-70ms). Even the best performing method succeeds on only 54.8% of the pairs, highlighting substantial room for improvement, particularly in challenging scenarios combining low overlap, large scale differences, and extreme viewpoint changes. Benchmark will be made publicly available.

View on arXivView PDF

Code Implementations(1)

Code for "RUBIK:A Structured Benchmark for Image Matching across Geometric Challenges", CVPR 2025

291C++, CudaMay 23, 20251 years ago

Similar Papers

Cite this paper

@article{loiseau2026rubik,
  title  = {RUBIK: A Structured Benchmark for Image Matching across Geometric Challenges},
  author = {Thibaut Loiseau and Guillaume Bourmaud},
  year   = {2026},
  eprint = {2502.19955},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2502.19955},
  journal = {CVPR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.19955.svg)](https://codeofpaper.com/paper/2502.19955)

Discussion