Organizations: Division of Robotics, Perception, and Learning (RPL), KTH Royal Institute of Technology, Stockholm 114 28, Sweden · School of Mechanical and Mining Engineering (SMME), The University of Queensland, Brisbane, QLD 4072, Australia · Department of Computer Science and Artificial Intelligence, University of Technology Nuremberg, 90461 Nürnberg, Germany
3D scene graphs provide semantically rich and hierarchical representations for robot perception. However, existing systems do not maintain uncertainty as an explicit belief or propagate it through the operations that construct and refine the graph. We introduce Probabilistic Scene Graph (PSG), a generalization of the conventional scene graph that represents a posterior over possible graphs, factorized into a discrete graph structure of entities, relations, and semantic attributes, and continuous states that ground them spatially, with uncertainty maintained over both components. Geometry is carried directly by the nodes rather than selected from a separately constructed metric map, so a metric map, where needed, follows from the graph rather than preceding it. We instantiate PSG's probabilistic spatial grounding with hierarchical graphs of Gaussians (HGG): each object primitive is represented by a full-covariance Gaussian under a Normal-Inverse-Wishart belief, and the same parametrization applied recursively within a node yields a geometry graph that resolves its surface at finer resolution. We then build a mapping pipeline that preserves these beliefs throughout graph construction and refinement: a purely graph-based coarse-to-fine alignment registers observations by comparing node beliefs, while a nested Expectation-Maximization and factor-graph optimization jointly refines poses, object parameters, and internal geometry. Across six datasets spanning indoor RGB-D, outdoor LiDAR, and cross-modality deployment, HGG operates at sensor rate with near-constant memory and achieves state-of-the-art object accuracy and zero-shot graph alignment.
Figures & tables
Fig. 1 : Our hierarchical probabilistic scene graph (HGG). Top: a symbolic object graph Go , with a belief over centroid and full covariance, connected by relational edges. Middle: the geometry graph Gig held inside each object, the same definition applied one level down, whose combined means and covariances provide a belief over continuous surface geometry. Bottom: detail of the geometry graph (left). Realizations of dense semantic point clouds of the scene can be sampled from our PSG (right), comparable to the original measurements. Color denotes the semantic label.
Fig. 2 : System overview. Given a semantic point cloud frame and odometry, we create a hierarchical local graph Gt , align it with the global graph Gt−1 through coarse-to-fine graph alignment, and update the global graph Gt through map registration. The resulting representation is refined through nested optimization within a sliding window, followed by global optimization.
Notations
Description
t
Frame index
Gt
Local scene graph created from frame t
Gt
Global scene graph registered up to frame t
Go , Go
Superscript o denotes the object graph
Gig , Gig
Superscript g denotes the geometry graph belonging to
ith -node of the object graph Go , Go
TABLE I : Notation for the Probabilistic Scene Graph
Fig. 3 : Coarse-to-fine graph alignment between the local graph Gto and the global graph Gt−1o . Top: object-node-level correspondences combine geometric and structural costs, solved by the Hungarian algorithm. Bottom: the resulting correspondences initialize geometry-level matching, which combines spatial and Weisfeiler–Lehman structural costs.
Dataset
Sensor
Environment
Semantic Labels
uHumans2
RGB-D
indoor
Simulator [ 4 ]
KITTI
LiDAR
outdoor
RangeNet++ [ 76 ]
KITTI-Carla
LiDAR
outdoor
Simulator [ 77 ]
MCD
LiDAR
outdoor
2DPASS [ 78 ]
ScanNet-SG
RGB-D
indoor
ScanNet-SG [ 79 ]
In-house
LiDAR+RGB
indoor+outdoor
Mask2Former [ 80 ] +SAM2 [ 81 ]
TABLE II : Evaluation Datasets
Fig. 4 : Qualitative object accuracy on uHumans2-Subway. All panels share Ground-truth rgb point cloud map and objects colored by classes in (a), and matching accuracy in (b-d). Hydra (b) is dominated by missed detection (blue), since a graph abstracted from a dense reconstruction can contain only what that reconstruction builds. ConceptGraph (c) reaches most instances but re-instantiates them, surrounding recovered objects with ghosts (red). HGG (d) cover almost all object nodes with high precision.
Apartment
Office
Subway
Method
Δp
Recall
Prec.
F1
t (ms)
Δp
Recall
Prec.
F1
t (ms)
Δp
Recall
Prec.
F1
t (ms)
Kimera
0.13
0.30
0.51
0.38
2018.5
0.26
0.29
0.50
0.36
1956.7
0.73
0.34
0.78
0.47
3742.8
Hydra
0.14
0.26
0.58
0.35
62.8
0.18
0.18
0.49
0.26
58.4
1.46
0.34
0.93
0.50
41.6
ConceptGraph
0.21
0.23
0.77
0.36
1033.8
0.26
0.24
0.47
0.32
3169.1
0.82
0.65
0.23
0.34
4672.7
HGG
0.06
0.79
0.94
0.86
29.3
0.11
0.79
0.86
0.83
28.5
0.55
0.97
0.80
0.88
30.6
TABLE III : Object Accuracy Evaluation
Apartment
Office
Subway
Method
Δp
Recall
Prec.
F1
Δp
Recall
Prec.
F1
Δp
Recall
Prec.
F1
Hydra+GT
0.12
0.36
0.76
0.50
0.14
0.33
0.89
0.48
0.60
0.37
1.00
0.54
ConceptGraph+GT
0.06
0.15
0.62
0.24
0.12
0.20
0.57
0.30
0.40
0.62
0.37
0.46
HGG+GT
0.04
0.87
0.98
0.92
0.05
0.88
0.90
0.89
0.10
0.98
0.97
0.97
TABLE IV : Object Accuracy Evaluation with Ground-Truth Poses and Different Odometry.
Apartment
Office
Subway
Δp
Recall
Precision
F1-score
Δp
Recall
Precision
F1-score
Δp
Recall
Precision
F1-score
OA-SLAM
0.23
0.17
0.33
0.23
0.46
0.33
0.50
0.40
1.53
0.10
1.00
0.19
VOOM
0.41
0.18
0.27
0.21
0.60
0.30
0.38
0.33
0.76
0.05
0.13
0.08
HGG
0.06
0.79
0.94
0.86
0.11
0.79
0.86
0.83
0.55
0.97
0.80
0.88
TABLE V : Object Accuracy Evaluation Against Object SLAM on Indoor Datasets
Sequence
Dataset
Method
Δp
R
Prec.
F1
HGG
Subway
w/o NIW
1.21
0.97
0.58
0.73
with NIW
0.55
0.97
0.80
0.88
In-house- 02
w/o NIW
0.21
0.62
0.65
0.63
with NIW
0.05
0.92
0.85
0.88
MCDNTU
w/o NIW
0.87
0.83
0.69
0.74
with NIW
0.75
0.84
0.82
0.82
TABLE VI : Evaluation on the effect of NIW posterior belief in our scene graph representation.
TABLE IX : Effect of EM optimization and loop closure (LC)
Sequence
Method
R@1
R@2
R@3
Apartment
Conceptgraphs
0.35
0.41
0.59
HGG (centroid edges)
0.47
0.82
0.94
HGG
0.65
0.88
0.94
Office
Conceptgraphs
0.20
0.47
0.47
HGG (centroid edges)
0.47
0.67
0.93
HGG
0.47
0.87
0.93
TABLE X : Language Grounded Object Retrieval Results. HGG (centroid edges) replaces the distributional edge weight of ( 8 ) with the Euclidean distance between centroids.
Open-vocabulary 3D Scene Graphs (3DSGs) ground each object node in a vision-language embedding, yet they record every entry as equally certain, so a robot querying the map cannot tell which of its entries are unreliable. Estimators of semantic uncertainty could supply that distinction, but they require repeated sampling of a model, training, or held-out labels, none of which are available to a deployed system at query time. We present a framework that exploits the detector confidence and the embeddings a 3DSG already stores, converts them into a probability that an entry is correct, and propagates that probability through the containment hierarchy into a belief that a room contains a queried class. Four signals, each paired with the object-level error it indicates, are converted to probabilities at the logit scale learned by the vision-language model and combined in closed form with no additional perception or training. Objects sharing a detector and a vocabulary fail together, so the framework aggregates them in the fully correlated limit, where an aggregation under independence would treat one repeated error as repeated evidence. Evaluated on HM3DSem against a state-of-the-art 3DSG system, the framework improves object retrieval and lowers the error of the room-level assertions of the graph it reads.
Carlos Cueto Zumaya, Iacopo Catalano, Wallace Moreira Bessa +1
University of Turku, Finland · Aragón Institute of Technology (ITA) and the University of Zaragoza, Spain
Integrating open-vocabulary semantic information into dynamic 3D scene representations is essential for long-term embodied scene understanding. However, existing methods often suffer from fragile instance association due to incomplete cross-view cues, while their limited ability to handle object-level topological changes restricts long-term robotic task execution. Moreover, current 3D scene understanding methods either rely on simple feature matching without explicit spatial reasoning or assume offline ground-truth 3D geometry. To address these challenges, we present DGSG-Mind, a hybrid instance-aware 3D Gaussian dynamic scene graph system with an embodied reasoning agent. Our system couples a probabilistic voxel grid with explicit 3D Gaussians to enable robust cross-modal instance fusion and incremental semantic mapping. It handles dynamic changes through Gaussian-based visual relocalization and localized masked refinement guided by geometric-semantic consistency. Built on the instance Gaussian map, DGSG-Mind further constructs a hierarchical scene graph and develops the 3D Gaussian Mind, which integrates structural relations, spatial-semantic information, and visually annotated RoI Gaussian renderings for multimodal reasoning. Extensive experiments show that DGSG-Mind achieves the best zero-shot 3DVG performance among methods operating on self-reconstructed maps, while also delivering strong performance in 3D open-vocabulary semantic segmentation and scene reconstruction. We further deploy DGSG-Mind on real-world robots to demonstrate its target-oriented reasoning and dynamic update capabilities. The project page of DGSG-Mind is available at https://icr-lab.github.io/DGSG-Mind
Luzhou Ge, Xiangyu Zhu, Jinyan Liu +1
School of Computer Science, Beijing Institute of Technology, Beijing 100081, China.
We present DeWorldSG, a novel framework that generates spatio-temporally robust 3D Semantic Scene Graphs from RGB-D sequences. Existing methods often struggle to construct reliable 3D scene graphs due to unstable 3D object representations and missing relations caused by frame-wise inference. DeWorldSG addresses these issues by estimating instance-level geometric 3D Gaussian distributions through depth-guided filtering and representing each object as a probabilistic 3D node rather than a single projected point. To mitigate relational sparsity from frame-wise inference, our framework further aggregates spatiotemporal evidence across object pairs and refines relations using contextual priors derived from a world model (V-JEPA 2). Experiments on the 3DSSG and ReplicaSSG datasets demonstrate state-of-the-art (SoTA) performance in both object and predicate prediction, while producing temporally consistent scene structures. In particular, our method improves triplet recall by 77.4% and predicate recall by 23.2% over prior SoTA approaches, making it suitable for robotic manipulation and AR applications. Our code and models are open-sourced.
Seok-Young Kim, Abdelrahman Elskhawy, Taewook Ha +4
Korea Advanced Institute of Science and Technology · Technical University of Munich · Munich Center for Machine Learning (MCML) +1