CVJun 14, 2024

Grounding Image Matching in 3D with MASt3R

arXiv:2406.09756v1883 citations
Originality Highly original
AI Analysis

This addresses the fundamental but hazardous treatment of image matching as a 2D problem in 3D vision pipelines, offering improved robustness and accuracy for applications like localization.

The paper tackles the problem of image matching in 3D vision by proposing MASt3R, which augments the DUSt3R 3D reconstruction framework with dense local features and a fast reciprocal matching scheme. The approach significantly outperforms state-of-the-art methods, achieving a 30% absolute improvement in VCRE AUC on the Map-free localization dataset.

Image Matching is a core component of all best-performing algorithms and pipelines in 3D vision. Yet despite matching being fundamentally a 3D problem, intrinsically linked to camera pose and scene geometry, it is typically treated as a 2D problem. This makes sense as the goal of matching is to establish correspondences between 2D pixel fields, but also seems like a potentially hazardous choice. In this work, we take a different stance and propose to cast matching as a 3D task with DUSt3R, a recent and powerful 3D reconstruction framework based on Transformers. Based on pointmaps regression, this method displayed impressive robustness in matching views with extreme viewpoint changes, yet with limited accuracy. We aim here to improve the matching capabilities of such an approach while preserving its robustness. We thus propose to augment the DUSt3R network with a new head that outputs dense local features, trained with an additional matching loss. We further address the issue of quadratic complexity of dense matching, which becomes prohibitively slow for downstream applications if not carefully treated. We introduce a fast reciprocal matching scheme that not only accelerates matching by orders of magnitude, but also comes with theoretical guarantees and, lastly, yields improved results. Extensive experiments show that our approach, coined MASt3R, significantly outperforms the state of the art on multiple matching tasks. In particular, it beats the best published methods by 30% (absolute improvement) in VCRE AUC on the extremely challenging Map-free localization dataset.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes