- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
F3Loc is a target-free LiDAR relocalization method that does not require training on the target scene and adopts a coarse-to-fine strategy. It applies a source-fitted spectral transform to frame descriptors, aggregating query context and contiguous map regions within a shared space, and subsequently performs frame matching within the selected region. F3Loc-Fast directly outputs the stored map poses, whereas GeoRefine adds a local registration step. The main contribution of this work lies in proposing a simple retrieval scheme that effectively reduces search overhead and mitigates false matches at long distances. The paper evaluates the method on the Oxford, NCLT, and MCD datasets, covering causal retrieval and two different descriptor encoders.
Critical strengths
The paper presents a clear and useful design for target-free LiDAR relocalization. F3Loc changes the support and granularity of the evidence used for retrieval while keeping one source-fitted comparison geometry across routing and final matching. This directly addresses the risk that coarse-to-fine routing discards the correct geographic hypothesis before fine matching. The work also demonstrates a degree of engineering innovation through the integration of these design choices into a practical and coherent relocalization pipeline.
Critical weaknesses
1.Although the paper claims that coarse routing is built upon "spatially coherent support", the actual algorithm (Section 3.3) relies entirely on the one-dimensional continuous frame indices of a single ordered mapping sequence, using a sliding window with a core of 50 frames plus 10 frames on each side to segment regions. This design works for maps from a single continuous capture, yet it suffers notable limitations in practical applications when confronted with multi-session maps, multi-pass trajectories, or unordered submaps.
2.Table 2 reports ANN lookup on CPU and F3Loc routing and matching on GPU, so the reported latency comparison is not hardware-matched. The accuracy and far-error results remain informative, and the comparison with exhaustive retrieval supports F3Loc’s efficiency. However, the main text does not establish the latency trade-off against HNSW+G under comparable hardware conditions.
Questions for authors
-
Section 3.3 mentions spatially local graph partitions as an alternative to contiguous frame intervals. Could the authors clarify what properties such a partition should satisfy for F3Loc, and whether the method requires a single ordered traversal in practice? This would help establish how directly the current approach extends to multi-session maps or maps assembled from unordered submaps.
-
Could the authors clarify how the latency comparison with HNSW+G should be interpreted given that the ANN lookup runs on CPU while F3Loc runs on GPU? If available, latency measurements under a matched hardware setup would help assess the practical trade-off.
3 comments
Response to Reviewer RUqg (2/2)
R3.3 [W2/Q2]: How do F³Loc and HNSW+G compare on matched hardware?
We apologize for the earlier GPU-lookup label: both HNSW and F³Loc retrieve on CPU. The revised manuscript reports the full retrieval-baseline timing comparison in Table 13.
Table R3. Updated matched timing (ms/query), calibrated descriptors; Lookup and Full-query are separated.
| Map | B | Exhaustive+G lookup | HNSW+G lookup | F³Loc lookup | HNSW+G full-query | F³Loc full-query |
|---|---|---|---|---|---|---|
| Oxford | 1 | 413.713 | 15.813 | 13.160 | 34.231 | 32.250 |
| Oxford | 16 | 104.433 | 4.495 | 4.944 | 6.427 | 6.899 |
| NCLT | 1 | 273.976 | 15.989 | 9.581 | 34.114 | 28.681 |
| NCLT | 16 | 68.796 | 4.553 | 4.000 | 6.609 | 6.147 |
| MCD | 1 | 61.307 | 13.202 | 4.319 | 31.699 | 23.393 |
| MCD | 16 | 15.463 | 3.700 | 2.733 | 5.715 | 4.725 |
We use 128 identical queries/map, four threads on a Xeon Gold 6326, RTX 4090 encoding, and one warm-up with three interleaved passes. HNSW reuses its saved index (M=32, efConstruction=200, efSearch=128); F³Loc uses causal W=40, Top-4, 50-frame cores, and 10-frame boundaries. Lookup covers CPU candidate selection, fine matching and MapPose; Full-query adds encoding, calibration, and online transfers. Offline index construction is excluded. B=16 is amortized ms/query, not single-query response latency.
On MCD, F³Loc improves route-wide TE (7.22 vs. 12.16 m) and matched B=16 full-query time (4.725 vs. 5.715 ms/query) over HNSW+G. On Oxford, HNSW+G is slightly faster (6.427 vs. 6.899 ms/query). Section 4.3 states this trade-off, while revised Table 13 gives matched B=1/B=16 CPU lookup and full-query times for the remaining retrieval baselines in Table 2 (including the original single-cell IVF-Flat). Sparse routing gives approximately 15–32× faster CPU lookup than matched dense temporal search, not an end-to-end speedup. Earlier per-system times followed a separate protocol.
Table R5. All eight routes; mean TE (m), same calibrated banks.
| Route | HNSW + G | F³Loc causal | F³Loc symmetric |
|---|---|---|---|
| Oxford 15-13 | 5.01 | 4.78 | 5.53 |
| Oxford 17-13 | 4.69 | 3.45 | 2.15 |
| Oxford 17-14 | 4.54 | 3.09 | 3.11 |
| NCLT 02-12 | 1.81 | 1.51 | 1.51 |
| NCLT 02-19 | 1.99 | 1.83 | 1.42 |
| NCLT 03-31 | 2.00 | 1.53 | 1.46 |
| NCLT 05-26 | 6.38 | 5.52 | 4.99 |
| MCD day10 | 12.16 | 7.22 | 6.04 |
| Route macro | 4.82 | 3.62 | 3.28 |
Oxford 17-13's 3.45 m is recomputed from archived MapPose IDs (submitted summary: 3.43 m). The submitted HNSW+G reference is 4.26 m; the rebuilt-index evaluation gives 4.69 m.
Causal F³Loc lowers TE on all eight routes versus HNSW + G. Symmetric uses future context and is offline. Against HNSW+G, F³Loc has lower CPU lookup in five of six batch/map settings, but HNSW+G is faster in Oxford B=16 full-query timing. This does not alter the submitted accuracy comparison.
The earlier ANN timing used a different query sample and runtime protocol. The new comparison fixes queries, hardware, indices, and timing scopes.
Please let us know if any questions or concerns remain; we will do our best to address them.
I appreciate the author’s detailed response and experiments, particularly the clarifications and corrections regarding the CPU and GPU. In my view, the author’s response has addressed the issues I raised. I will maintain my score of 3.
Response to Reviewer RUqg (1/2)
Thank you for your careful review and for recognizing the useful retrieval design and geographic-hypothesis perspective. We tested your map-construction and timing concerns directly. This part answers W1/Q1; Part 2 addresses W2/Q2. We have uploaded a revised manuscript, with changes highlighted.
R3.1 [W1/Q1]: Does map construction require a single ordered traversal?
The map need not come from one continuous traversal. Within-traversal groups consecutive frames from the same recording; map-pose groups nearby map positions across recordings, so observations from different dates can share a region. Both use cores of at most 50 frames with boundary support, retain every map frame, and need no query pose.
Only map grouping changes: regional scores aggregate calibrated frame descriptors, followed by current-frame matching within selected regions. Storage order is irrelevant if region membership is preserved. Causal (C) uses current/past query frames; symmetric (S) also uses future frames. Neither changes map grouping or current-frame fine matching.
Table R1. Maps from multiple NCLT traversals; mean TE (m) and failures >50 m (FAR).
The first map combines the 02-18 and 03-17 recordings: 32,073 frames and 25,261 eligible 02-12 queries. Adding 3,507 available 06-15 frames gives 35,580 map frames and 25,361 eligible queries. All rows use the same map-specific query mask; encoder/G are unchanged and the 02-12 query recording is absent from the map. Within-traversal C/S pools contain 221/218 and 222/218 frames; map-pose pools contain 153 and 169.
Both constructions improve TE and FAR over Flat + G. A spatial graph partition should cover all searchable map frames, group geographically neighboring observations, keep region sizes bounded, and retain boundary overlap so adjacent regions do not lose useful candidates. The map-pose construction meets these conditions without a global frame order. The experiments test overlapping multi-session maps; arbitrary road-junction graph topology remains untested.
R3.2 [W1/Q1, continued]: What happens when map order or coverage changes?
We shuffled 200-frame submaps and rebuilt regions within each fragment. This tests reordered local submaps, not arbitrary graph partitions. We also removed frames in the central 10% of map X extent and split regions at the gaps. Query context and W=40/50, Top-4, encoder/G stay fixed.
Table R2. Mean TE (m), identical edited maps and query masks. C/S: causal/offline symmetric.
Gap-test eligible/total queries are 38,461/42,778, 23,151/25,546, and 2,394/3,231. These tests concern spatially missing map sections, distinct from combining recordings. Evaluation covers locations still represented in the map. Local neighborhoods and boundary overlap remain necessary; arbitrary index adjacency is insufficient.