arXiv:2609.02012cs.CVcs.IR2026-09

构建首个细粒度门店定位基准,解决小目标与大场景不匹配难题。

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

论文配图:GeoStore: Finding Small Storefronts in Large Scenes -- A Fine-Grained POI Localization Benchmark with Global-to-Local Asymmetric Matching
图 1 · 摘自论文原文
  • 提出全局到局部的非对称匹配机制,融合全局描述符与区域特征
  • 在GeoStore上实现Recall@1达63.2%,较基线提升超15个百分点
  • 适合地图构建、门店验证等实际场景,轻量级设计利于部署

兴趣点(POI)定位——将用户拍摄的门店近景图与大规模带地理标签的街景图像匹配——是地图构建、POI验证和位置服务的基础。现有最接近的技术视觉场景识别(VPR)假设对称、整图匹配,而POI定位需将填满画面的小目标查询,与包含该目标但仅占一小部分且位置偏移的宽视角参考图匹配,存在显著拍摄域差异。本文提出GeoStore,据知是首个针对这种非对称、细粒度、开集设定的基准数据集。实验表明,为对称VPR优化的全局描述符方法在此任务中系统性受限,因单一全局向量会稀释小目标信息。为此,我们提出GLAM(全局到局部非对称匹配):将参考图像表示为紧凑的池化区域令牌集合,通过可学习的软后期交互与单个查询探针匹配;推理时利用相同令牌实现轻量级互最近邻重排序。GLAM在Recall@1/5/10和mAP上超越强基线,重排序特征缩小约5倍,每对匹配计算成本降低两个数量级。基准与代码将公开发布。

原文摘要 · Abstract (English)

Point-of-interest (POI) localization -- matching a user's close-up storefront photograph against large-scale geo-tagged street-view imagery -- underpins map construction, POI verification, and location-based services. Its closest existing paradigm, visual place recognition (VPR), assumes symmetric, whole-image matching of the same scene at a comparable scale; POI localization instead must match a close-up query, in which the target fills the frame, against wide references in which the same POI occupies only a small, off-center region among visually similar shops, under a substantial capture-domain gap. We introduce GeoStore, to our knowledge the first benchmark dedicated to this asymmetric, fine-grained, open-set formulation, and show that global-descriptor methods tuned for symmetric VPR are systematically limited on it, since a single global vector dilutes the small target. We further propose GLAM (Global-to-Local Asymmetric Matching), which couples a retrieval-anchoring global descriptor with an asymmetric local pathway: each reference is kept as a compact set of pooled region tokens and matched against a single query probe through a learnable soft late interaction; at inference, the same tokens enable a lightweight mutual-nearest-neighbor re-ranking. GLAM surpasses strong global and two-stage baselines on Recall@1/5/10 and mAP, with ~5x smaller re-ranking features and ~two orders of magnitude lower per-pair matching cost than prior local re-ranking. The benchmark and code will be publicly released.

POI定位细粒度匹配图像检索地图构建

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。