Metraipolis › archive › dc_ade19246c31f

POI-Loc: A Fine-Grained POI Localization Benchmark and an Asymmetric Global-to-Local Matching Method — arXiv:2609.02012

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.02012
License (as archived)
CC0-1.0
Archived
2026-10-17T05:46:49.145Z
SHA-256 of the archived text
9289b22699aceb535e7b4fcb356bdaef16ff0cd6131c86860222300ce6fe4594
Stable URL of this page
https://metraipolis.com/documento/dc_ade19246c31f

How to cite

POI-Loc: A Fine-Grained POI Localization Benchmark and an Asymmetric Global-to-Local Matching Method — arXiv:2609.02012 — arXiv (en), https://arxiv.org/abs/2609.02012 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ade19246c31f (Metraipolis archive dc_ade19246c31f, sha256 9289b22699aceb535e7b4fcb356bdaef16ff0cd6131c86860222300ce6fe4594)
BibTeX
@misc{dcade19246c31f,
  title = {POI-Loc: A Fine-Grained POI Localization Benchmark and an Asymmetric Global-to-Local Matching Method — arXiv:2609.02012},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.02012},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ade19246c31f; sha256 9289b22699aceb535e7b4fcb356bdaef16ff0cd6131c86860222300ce6fe4594},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02012. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Point-of-interest (POI) localization matches user-provided storefront close-ups to the same shops in wide, geo-tagged vehicle-mounted street views. POIs may change while the surrounding scene stays similar, so scene-level recognition alone cannot establish POI identity. Differences in target scale and capture domains further challenge matching. We introduce POI-Loc, to our knowledge the first benchmark dedicated to this asymmetric, fine-grained POI localization task. Many visual place recognition methods represent each image with a single global vector, which tends to dilute fine-grained features of small storefronts amid background clutter. We propose GLAM (Global-to-Local Asymmetric Matching) to combine global and local evidence. In stage one, a single attention-pooled query probe is matched against compact reference region tokens via learnable soft top-k interaction, with the resulting local similarity fused with global similarity for retrieval. Stage two reuses query region tokens before attention pooling and stored reference tokens for mutual-nearest-neighbor re-ranking. GLAM surpasses both global and two-stage baselines on Recall@1/5/10 and mAP, with about $5\times$ smaller re-ranking features and $280\times$ lower per-pair matching cost than FoL. The benchmark and code will be released at this https URL .

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-03 in cs.IR).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2609.02012 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T05:23:20.846Z dalla pagina https://arxiv.org/catchup/cs.IR/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).