Gaussian Semantic Field for One-shot LiDAR Global Localization

Pengyu Yin, Shenghai Yuan, Haozhi Cao, Xingyu Ji, Ruofei Bai, Siyu Chen, Lihua XiearXiv 2025 · DOI · arXiv

Introduction

LiDAR-based global localization is a cornerstone of autonomous navigation, yet it faces significant challenges in environments characterized by "semantic ambiguity." In settings like massive warehouses, repetitive parking structures, or dense forests, standard LiDAR sensors often perceive geometrically identical features. This leads to the "mirror image" problem, where a robot cannot distinguish between two locations because their spatial layouts—and even the centroids of detected objects—are indistinguishable.

Existing state-of-the-art methods utilizing 3D scene graphs typically group points into object-level nodes. However, by focusing primarily on object centers, these methods discard the subtle environmental context that could break symmetry. To overcome this, we present Outram-GSF, a localization system that leverages "Gaussian Semantic Fields" to capture the unique geo-semantic signature of an area.

The Gaussian Semantic Field Approach

The fundamental shift in this work is moving from discrete semantic labels to continuous semantic distributions. Instead of simply noting that a point belongs to a "tree" or a "building," the system models how these semantics are distributed in the space surrounding an object.

Visualization of the Gaussian Semantic Field (GSF) capturing unique local signatures in repetitive environments.

By using Gaussian Processes (GPs), the system transforms sparse, noisy semantic data into a continuous, differentiable function. This function acts as a local "fingerprint." Even if two pillars in a garage are spaced identically, the specific distribution of background vegetation or ground geometry behind them is rarely perfectly symmetric. The GSF leverages this "background noise" as a robust feature for localization.

Methodology

The Outram-GSF pipeline is built upon a tri-layered scene graph architecture, integrating metric, semantic, and field-based information.

  1. Tri-layered Graph Generation: The architecture consists of a Metric Semantic Layer (raw points), a Gaussian Semantic Field Layer (continuous distributions), and an Object Layer (high-level entities).
  2. Metric Semantic Feature Generation: To handle the computational intensity of GPs on dense LiDAR data, the authors developed a semantic-based sparsification algorithm. This method intelligently downsamples points based on their class, ensuring the GP learns the most representative features while maintaining efficiency.
  3. Substructure Matching via Wasserstein Metric: To compare the semantic field of a current scan against the map, the system employs the 2-Wasserstein metric. This mathematical framework is ideal for measuring the similarity between probability distributions, allowing for precise matching even under slight viewpoint variations.
  4. Semantic Stability Mask: Not all landmarks are equally reliable. The system applies a weighting mask that prioritizes stable infrastructure (e.g., buildings) over natural elements (e.g., bushes) and transient objects (e.g., vehicles).
The proposed tri-layered 3D scene graph generation and localization pipeline.

Experimental Evaluation

The researchers evaluated Outram-GSF on the MulRan and MCD NTU datasets, with a specific focus on highly repetitive sequences.

  • Robustness in Repetitive Environments: In the MCD NTU "repetitive" test, Outram-GSF achieved an 87.36% success rate, a dramatic improvement over the previous best method, SGTD, which reached only 55.26%.
  • High Precision: On standard urban benchmarks, the system achieved a 99.32% success rate. When paired with Generalized Iterative Closest Point (GICP) refinement, the Average Translation Error (ATE) was reduced to just 0.41 meters.
  • Generalization: The method demonstrated consistent performance across different sensor setups and urban environments without requiring extensive per-scene tuning.

Limitations and Future Work

While highly accurate, the system's complexity results in a computational latency of approximately 563ms per frame. This is suitable for "one-shot" global relocalization (e.g., when a robot first wakes up) but may be too slow for real-time high-frequency tracking.

Future research directions include optimizing the Gaussian Process inference for real-time performance and developing "localizability certificates." Such certificates would allow the system to autonomously identify areas that are too symmetric for reliable localization, prompting the robot to seek more distinctive landmarks before confirming its position.

Summary updated

Abstract

We present a one-shot LiDAR global localization algorithm featuring semantic disambiguation ability based on a lightweight tri-layered scene graph. While landmark semantic registration-based methods have shown promising performance improvements in global localization compared with geometric-only methods, landmarks can be repetitive and misleading for correspondence establishment. We propose to mitigate this problem by modeling semantic distributions with continuous functions learned from a population of Gaussian processes. Compared with discrete semantic labels, the continuous functions capture finer-grained geo-semantic information and also provide more detailed metric information for correspondence establishment. We insert this continuous function as the middle layer between the object layer and the metric-semantic layer, forming a tri-layered 3D scene graph, serving as a light-weight yet performant backend for one-shot localization. We term our global localization pipeline Outram-GSF (Gaussian semantic field) and conduct a wide range of experiments on publicly available data sets, validating the superior performance against the current state-of-the-art.
BibTeX
@misc{yin2025gaussian,
  author = {Pengyu Yin and Shenghai Yuan and Haozhi Cao and Xingyu Ji and Ruofei Bai and Siyu Chen and Lihua Xie},
  title = {{Gaussian Semantic Field for One-shot LiDAR Global Localization}},
  year = {2025},
  eprint = {2510.12101},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2510.12101},
}
Figure