arXiv Computer Vision By Xinyang Lu, Shengzhe Wei, Sheng Tang, Weiqi Zhang, Juntong Fang, Zesong Li

MVLoMa: Multi-View Local Feature Matching with Any Geometry Foundation Model

Read the original on arXiv Computer Vision →

MVLoMa is a sparse star‑graph matcher that extends the LoMa framework from image pairs to multi‑view settings. It uses a frozen multi‑view geometry model to jointly describe all images in a star, injecting cross‑view geometric context into local descriptors and matching the centre image to all neighbours in a single forward pass. On several datasets, MVLoMa achieves the best macro‑average relative‑pose AUC and is more than twice as fast as sequential pairwise evaluation, while supporting multiple frozen geometry encoders and demonstrating the benefits of geometry‑aware descriptors, visibility filtering, and joint inference.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computer Vision.

Hugging Face Trending Papers
Oct 22

MVLoMa: Multi-View Local Feature Matching with Any Geometry Foundation Model

MVLoMa is a sparse star‑graph matcher that extends the LoMa local‑feature matching framework from image pairs to multi‑view settings. It uses a frozen multi‑view geometry model to jointly describe all images in a star, injecting cross‑view geometric context into local descriptors and performing centre‑to‑neighbour matching in a single forward pass with per‑view self‑attention and bidirectional centre‑neighbour cross‑attention. On 25‑view star graphs from HyperSim, ScanNet++, Mip‑NeRF 360, and Tanks and Temples, MVLoMa achieves the best macro‑average relative‑pose AUC at all thresholds and is 2.20 times faster than sequential pairwise evaluation, while supporting multiple frozen geometry encoders and demonstrating the benefits of geometry‑aware descriptors, visibility filtering, geometric negative supervision, and joint multi‑view inference.

Hugging Face Trending Papers
Jul 20

MuViSeg: Multi-View Segment Correspondences from Dense Geometry Priors

Classical image correspondence is solved at the level of sparse keypoints or dense pixels, but the systems that consume these matches - object-level mapping, topological navigation, scene-graph maintenance - reason about whole objects. Recent work narrows this gap by matchng directly at the level of instance segments: a class-agnostic segmenter partitions each image, and per-segment descriptors are obtained by pooling features from large 3D foundation models over the masks.

arXiv Computer Vision
Sep 3

Self-Geometry: GT-Free and Plug-and-Play Test-Time Adaptation for Geometrically Consistent 3D Vision Foundation Models

The paper introduces Self-Geometry, a plug‑and‑play test‑time adaptation framework that enforces explicit multi‑view geometric constraints on Vision Foundation Models (VFMs) using 2D pixel correspondences as pseudo ground truth. It combines Geometric Disentanglement Optimization—mixing Multi‑View and Epipolar Consistency losses with Gradient Disentanglement—to avoid gradient conflicts, a Frame Angular‑Neighbor sampler based on SO(3) geodesic distances to select informative views, and a Lightweight TTA module that adapts VFMs via LoRA. Experiments on six VFMs and four benchmarks (7Scenes, ETH3D, ScanNet++, HiRoom) show consistent improvements in pose and geometry estimation.

By Seokhyun Youn, Dahyeon Kye, Sung-Ho Bae, Jihyong Oh