arXiv Machine Learning

XFeat Revisited: Reproducibility and Evaluation of a Lightweight Image Matcher

arXiv:2608. 09519v1 Announce Type: cross Abstract: We present a reproducibility study of XFeat, a lightweight local feature extractor and matcher designed to identify corresponding points across images efficiently on resource-constrained hardware.

Hugging Face Trending Papers
Aug 10

XFeat Revisited: Reproducibility and Evaluation of a Lightweight Image Matcher

We present a reproducibility study of XFeat, a lightweight local feature extractor and matcher designed to identify corresponding points across images efficiently on resource-constrained hardware. We re-implement the architecture based on the paper and supplementary material, re-evaluate the authors' released checkpoint alongside our re-implementation, and conduct additional architectural ablations to examine design choices that were not fully justified in the original work.

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 23

Calibrating Retrieval Geometry: Reliability-Guided Training-Free Aggregation for Visual Place Recognition

The paper introduces TFA, a training‑free aggregation technique that calibrates frozen visual foundation models for visual place recognition. TFA uses cross‑codebook agreement, retrieval coverage, and spectral statistics to adjust residual assignment, spectral shaping, and global‑feature fusion without requiring place labels or task‑specific weights. Experiments with a DINOv2‑B backbone show significant Recall@1 gains over existing training‑free methods across multiple benchmarks, demonstrating that reliability‑guided aggregation can unlock additional retrieval performance from frozen representations.

By Xin Li, Zhimin Mao, Shang Wang, Siyuan Duan, Geng Zhang
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
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 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 15

HGSQ: Heatmap-Guided Sparse Query Detector for Real-Time Aerial Small Object Detection

HGSQ is a real‑time aerial small‑object detector that uses a heatmap‑guided sparse query strategy to focus computation on foreground regions. It introduces a lightweight Heatmap Budget Predictor to generate a foreground budget map, and then employs Heatmap‑Guided Sparse Query Selection, Heatmap‑Gated Lite Snake Convolution, and Adaptive Query‑Decoder Budgeting to efficiently process only small‑object areas. On NWPU VHR‑10 and VisDrone2019, HGSQ achieves 95.10 mAP50 and 54.8 mAP50 respectively while running at 96 FPS with only 48.6 GFLOPs on an RTX 4070.

By Yangchen Zeng