arXiv:2603.23305v2 Announce Type: replace-cross
Abstract: We investigate the problem of matching networks where both edge weights and node features are correlated following a specific node correspond...
By Mohammad Hassan Ahmad Yarandi, Luca Ganassali
arXiv:2609.16378v1 Announce Type: cross
Abstract: Digital twins provide a scalable and cost-effective complement to real-world testing for validating autonomous-driving and advanced driver-assistance...
By Ghazal Farhani, Taufiq Rahman
The paper introduces CELL, a confidence-weighted event-camera localization method that learns per-correspondence confidence end-to-end using a differentiable probabilistic PnP. It reweights flow supervision, drives probabilistic correspondence selection at test time, and refines edge matching, while also proposing a partial-completion depth representation. Experiments on M3ED and DSEC show significant reductions in median translation and rotation errors compared to the LEAR baseline.
By Panagiotis Kiousis, Kuangyi Chen, Jun Zhang, Friedrich Fraundorfer
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
Terrestrial Laser Scanning (TLS) point clouds captured in urban environments frequently suffer from glass-induced reflection artifacts, severely degrading downstream applications. Existing reflection artifact removal methods generally rely on ideal reflection symmetry assumptions, yet their performance is limited by inaccurate glass estimation and insufficient geometric representations.
The paper introduces a sparse topometric graph for indoor navigation that encodes local 3D geometry in nodes and distance‑weighted edges for traversable connectivity. A learned graph‑matching network aligns subgraph structures across different sessions, enabling robust point‑goal navigation even with scene changes, sensor variations, or limited overlap. Experiments on Gibson and 3D‑FRONT datasets show higher success rates and a memory reduction of over two orders of magnitude compared to point‑level maps.
By Eun Sun Lee, Minkyun Seo, Gwangtak Bae, Junho Kim, Seunggu Kang, Jaesik Park, Young Min Kim
arXiv:2506. 22784v2 Announce Type: replace-cross Abstract: Point-pixel registration between LiDAR point clouds and camera images is a fundamental yet challenging task in autonomous driving and robotic perception.
By Yu Han, Zhiwei Huang, Yanting Zhang, Fangjun Ding, Shen Cai, Xiaoyu Tang, Yanchao Dong, Rui Fan
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:2606.16569v2 Announce Type: replace
Abstract: Registering two captures of the same indoor space taken at different times underpins persistent spatial memory for robots and AR systems, yet the r...
By Zhiang Chen, Nahyuk Lee, Boyang Sun, Taein Kwon, Marc Pollefeys, Zuria Bauer, Sunghwan Hong
arXiv:2606. 04493v1 Announce Type: cross Abstract: Correspondence pruning aims to identify inliers from an initial set of correspondences.
By Zhihua Wang, Yanping Li, Yizhang Liu
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
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