Papers
Topics
Authors
Recent
Search
2000 character limit reached

PHiSSG: Hierarchical Spatial–Semantic Graph

Updated 19 January 2026
  • PHiSSG is a hierarchical data structure that represents 3D environments with nodes encoding spatial positions, orientations, semantic embeddings, and refinement levels.
  • It incrementally updates the graph through anchor selection and local subscene generation, using recursive propagation of rigid-body transforms to maintain spatial and semantic consistency.
  • Empirical evaluations show PHiSSG’s effectiveness in real-time mapping and generative scene synthesis, achieving robust object detection, localization, and stability under physical constraints.

The Progressive Hierarchical Spatial–Semantic Graph (PHiSSG) is a data structure that underpins hierarchical representations of 3D environments, enabling incremental, scalable, and semantically consistent scene understanding and generation. Originally formalized within the context of spatial perception for robotics (Hughes et al., 2023) and hierarchical scene synthesis (Hong et al., 31 Oct 2025), PHiSSG encodes both spatial geometry and semantic relationships while maintaining a record of hierarchical refinement across progressive steps or levels of detail.

1. Formal Structure and Layered Hierarchy

PHiSSG represents the environment or generated scene as a directed, layered graph Gn=(Vn,En)\mathcal{G}^n = (V^n, E^n), where each node corresponds to a unique 3D object instance introduced at a specific refinement step nn. The graph structure enforces a hierarchy:

  • Node Set (VnV^n): Each node viv_i encodes
    • 3D center position piR3p_i \in \mathbb{R}^3,
    • orientation as a unit quaternion qiR4q_i \in \mathbb{R}^4,
    • semantic category embedding siRks_i \in \mathbb{R}^k,
    • hierarchical index hiNh_i \in \mathbb{N} (generation step).

Collectively, all features are stored as xi=[pi;qi;si;hi]x_i = [p_i; q_i; s_i; h_i].

  • Edge Tensor (A{0,1}N×N×R\mathcal{A} \in \{0,1\}^{N\times N\times R}): Each directed edge e(i,j)e_{(i,j)} links node ii to jj by some relation rRr \in R (e.g., “On,” “Inside,” “Near”). For each relation type rr, A(r)A^{(r)} is a binary adjacency matrix.
  • Layer Partitioning and Levels: Nodes are tagged by their level hih_i, supporting hierarchical visualization and stepwise refinement or expansion.

Edges between nodes encode spatial (“strong," e.g., physical support or containment) or semantic (“soft,” e.g., stylistic similarity, adjacency) relations. Strong dependencies carry relative rigid-body transforms Tij=(Rij,tij)T_{i \to j} = (R_{i\to j}, t_{i\to j}) that link a child's pose rigidly to its parent.

2. Graph Construction and Update Algorithms

The graph evolves incrementally, supporting both new object insertion and scene refinement:

  • Initialization (n=0n = 0): Start with global objects (e.g., room architecture, furniture); extract nodes V0V^0 and relations E0E^0 via vision models, and set hi=0h_i=0 for these nodes.
  • Incremental Update (step n>0n > 0):

    • Assign hj=nh_j = n for jVlocalnj \in V_{\text{local}}^n and append to VnV^n.
    • Set Ai,j,rn=1\mathcal{A}^n_{i,j,r} = 1 for pairwise relations in ElocalnE_{\text{local}}^n.
    • Create cross-level edges from anchors to new nodes (typically with strong dependencies).
    • 4. Recursive Layout Optimization: Any update to a parent’s pose is propagated to its children along “strong” dependency edges using recorded transforms:

    Xj=XiTij,(pj,qj)decompose(Xj)X_j' = X_i' T_{i\to j}, \qquad (p_j', q_j') \leftarrow \operatorname{decompose}(X_j')

  1. Stability Correction: Ensures that “On” relations respect physical plausibility; the child’s projected center onto the parent’s support polygon SiS_i is adjusted by the minimal horizontal shift

    δ=argminδδsubject toπ(pj)+δSi\delta = \arg\min_{\delta'} \|\delta'\| \quad \text{subject to} \quad \pi(p_j) + \delta' \in S_i

A high-level pseudocode captures the entire process, supporting initialization, local refinement, edge updates, recursive position propagation, and stability correction (Hong et al., 31 Oct 2025).

3. Mathematical Objectives and Consistency Enforcement

PHiSSG enforces several objectives, deterministically maintained during graph update rather than through gradient-based learning:

  • Dependency Consistency:

Ldep=(i,j)Estrong(pjpi)tij2+RiRjRijF2\mathcal{L}_{\text{dep}} = \sum_{(i,j) \in E_{\text{strong}}} \| (p_j - p_i) - t_{i\to j} \|^2 + \| R_i^\top R_j - R_{i\to j} \|_F^2

Minimizes deviation between actual and recorded relative transforms.

  • Stability Constraint:

Lstab=(i,j)EOndist(π(pj),Si)2\mathcal{L}_{\text{stab}} = \sum_{(i,j) \in E_{\text{On}}} \operatorname{dist}(\pi(p_j), S_i)^2

Penalizes violation of physical support constraints.

  • Semantic Coherence:

Lsem=(i,j)Esemsisj\mathcal{L}_{\text{sem}} = - \sum_{(i,j) \in E_{\text{sem}}} s_i^\top s_j

Encourages compatible semantic embeddings among linked objects.

The total objective is a weighted sum: Ltotal=λ1Ldep+λ2Lstab+λ3Lsem\mathcal{L}_{\text{total}} = \lambda_1\,\mathcal{L}_{\text{dep}} + \lambda_2\,\mathcal{L}_{\text{stab}} + \lambda_3\,\mathcal{L}_{\text{sem}}.

4. Role in Generative and Perceptual Systems

PHiSSG is integral to frameworks for both real-time spatial perception and generative scene composition:

  • Spatial Perception (Hydra system): Implements a five-layer hierarchy (geometric mesh, objects/agents, places, rooms, building), enabling real-time construction, efficient inference via small treewidth, and global optimization including loop-closure corrections. Layers are built incrementally from sensor data (RGB, depth, odometry), semantic segmentation, object clustering, GVD-based free-space topology, and room classification via neural networks (Hughes et al., 2023). The structure supports efficient optimization and robust mapping in robotic systems.
  • Generative Scene Synthesis (HiGS framework): PHiSSG acts as the persistent memory that spans progressive, user-driven synthesis rounds in 3D scene generation. Its hierarchical tagging and one-to-one node-object mapping ensure spatial, geometric, and semantic consistency as sub-scenes are merged, objects added or refined, and global style is maintained. Recursive update protocols guarantee that changes propagate coherently throughout the hierarchy, preserving both local plausibility and scene-wide constraints (Hong et al., 31 Oct 2025).

5. Ensuring Spatial, Semantic, and Hierarchical Coherence

PHiSSG guarantees consistency by:

  • Maintaining a one-to-one correspondence between nodes and 3D object instances, preventing duplication or omission.
  • Explicitly recording and recursively applying rigid-body transforms on "strong" parent-child dependencies, enabling accurate local-global alignment after layout changes.
  • Enforcing stability, so no object violates physical constraints of support (e.g., a lamp stays atop a table).
  • Encoding semantic coherence through semantic edges, with enforcement via visual-LLMs and embedding similarity.
  • Utilizing the hierarchical index hih_i to restrict refinements to the correct level of abstraction and preserve generational context.
  • Following each graph update with deterministic pose and stability propagation, ensuring end-to-end scene consistency (Hong et al., 31 Oct 2025).

6. Empirical Performance and Implementation

Empirical results in the Hydra system demonstrate PHiSSG’s scalability and efficiency:

  • Real-time 3D mapping with semantic labeling at 1 Hz on embedded hardware.
  • Mesh/object/place updates in sub-100 ms per keyframe; room clustering in 5–15 ms.
  • Significant accuracy for object detection (70–95% found/correct in small/medium scenes), place localization (5–20 cm average error), and room classification (45–55% on synthetic, 30% on real data).
  • Lower memory usage compared to non-hierarchical ESDF-based methods, and improved loop-closure detection rates.

In the HiGS generative setting, PHiSSG facilitates user-guided, multi-step scene expansion, yielding state-of-the-art controllability and scene plausibility compared to single-stage frameworks (Hong et al., 31 Oct 2025).

7. Significance and Broader Implications

PHiSSG represents a key advance in bridging geometric structure with semantic understanding for both autonomous agents and generative models. Its progressive and hierarchical formulation allows dynamic expansion, efficient inference, robust optimization, and coherent scene manipulation at scale. The strict correspondence between objects, graph levels, and relational edges provides a precise scaffold for integrating multi-modal perceptual signals or user intent, suggesting broad applicability across robotics, virtual environment generation, and human-in-the-loop scene design (Hughes et al., 2023, Hong et al., 31 Oct 2025).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Progressive Hierarchical Spatial–Semantic Graph (PHiSSG).