Hugging Face Trending Papers

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.

arXiv Computer Vision
Oct 23

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

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.

By Xinyang Lu, Shengzhe Wei, Sheng Tang, Weiqi Zhang, Juntong Fang, Zesong Li
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
arXiv Computer Vision
Sep 3

GeoStore: Finding Small Storefronts in Large Scenes -- A Fine-Grained POI Localization Benchmark with Global-to-Local Asymmetric Matching

GeoStore is a new benchmark for fine‑grained point‑of‑interest (POI) localization that matches close‑up storefront photos against large geo‑tagged street‑view images, a task distinct from traditional visual place recognition. The paper shows that global‑descriptor methods designed for symmetric matching perform poorly on this asymmetric problem, and introduces GLAM, a Global‑to‑Local Asymmetric Matching approach that combines a global retrieval anchor with a lightweight local re‑ranking using pooled region tokens. GLAM achieves higher Recall@1/5/10 and mAP than strong baselines while using far fewer re‑ranking features and significantly lower per‑pair matching cost.

By Lu Han, Xiting Sun, Hao Wang, Zhiqiang Cao, Ruihuan Du, Ziquan Zeng, Chunlong Lv
arXiv Computer Vision
Sep 7

ARC-Loc: Leveraging Azimuthal Ray Convergence as a Geometric Cue for Direct Cross-View Localization

ARC‑Loc introduces a new cross‑view localization method that bypasses heavy Bird’s‑Eye‑View transformations and external depth models. By converting ground keypoints into azimuthal rays on a satellite map and exploiting their convergence at the user’s location, the approach uses a minimal Azimuthal Ray Convergence solver and an ARC loss to directly match ground and satellite images. Experiments on VIGOR and KITTI show that ARC‑Loc achieves competitive accuracy while offering faster, memory‑efficient inference and easy integration with existing frameworks.

By Hyeongsik Kim, Mincheol Kim, Heejoon Moon, Je Hyeong Hong
arXiv Computer Vision
Sep 1

XDG: Accelerated Visual Disambiguation

arXiv:2608.29733v1 Announce Type: new Abstract: Visual aliasing, also known as the doppelganger problem, remains a key challenge for structure-from-motion (SfM): visually similar but physically disti...

By Gonglin Chen, Ben Southall, Hanyuan Xiao, Wenbin Teng, Haolin Xiong, Tianwen Fu, Junyi Ouyang, Kshitij Singh Minhas, Supun Samarasekera, Rakesh Kumar, Yajie Zhao