Faster Optimization in S-Graphs Exploiting Hierarchy
- URL: http://arxiv.org/abs/2308.11242v1
- Date: Tue, 22 Aug 2023 07:35:15 GMT
- Title: Faster Optimization in S-Graphs Exploiting Hierarchy
- Authors: Hriday Bavle, Jose Luis Sanchez-Lopez, Javier Civera, Holger Voos
- Abstract summary: We present an improved version of S-Graphs exploiting the hierarchy to reduce the graph size by marginalizing redundant robot poses.
We show similar accuracy compared to the baseline while showing a 39.81% reduction in the computation time with respect to the baseline.
- Score: 8.17925295907622
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 3D scene graphs hierarchically represent the environment appropriately
organizing different environmental entities in various layers. Our previous
work on situational graphs extends the concept of 3D scene graph to SLAM by
tightly coupling the robot poses with the scene graph entities, achieving
state-of-the-art results. Though, one of the limitations of S-Graphs is
scalability in really large environments due to the increased graph size over
time, increasing the computational complexity.
To overcome this limitation in this work we present an initial research of an
improved version of S-Graphs exploiting the hierarchy to reduce the graph size
by marginalizing redundant robot poses and their connections to the
observations of the same structural entities. Firstly, we propose the
generation and optimization of room-local graphs encompassing all graph
entities within a room-like structure. These room-local graphs are used to
compress the S-Graphs marginalizing the redundant robot keyframes within the
given room. We then perform windowed local optimization of the compressed graph
at regular time-distance intervals. A global optimization of the compressed
graph is performed every time a loop closure is detected. We show similar
accuracy compared to the baseline while showing a 39.81% reduction in the
computation time with respect to the baseline.
Related papers
- CoRe-GD: A Hierarchical Framework for Scalable Graph Visualization with
GNNs [20.706469085872516]
We introduce a scalable Graph Neural Network (GNN) based Graph Drawing framework with sub-quadratic that can learn to optimize stress.
Inspired by classical stress optimization techniques and force-directed layout algorithms, we create a coarsening hierarchy for the input graph.
To enhance information propagation within the network, we propose a novel positional rewiring technique.
arXiv Detail & Related papers (2024-02-09T10:50:45Z) - Graph Transformers for Large Graphs [57.19338459218758]
This work advances representation learning on single large-scale graphs with a focus on identifying model characteristics and critical design constraints.
A key innovation of this work lies in the creation of a fast neighborhood sampling technique coupled with a local attention mechanism.
We report a 3x speedup and 16.8% performance gain on ogbn-products and snap-patents, while we also scale LargeGT on ogbn-100M with a 5.9% performance improvement.
arXiv Detail & Related papers (2023-12-18T11:19:23Z) - Structure-free Graph Condensation: From Large-scale Graphs to Condensed
Graph-free Data [91.27527985415007]
Existing graph condensation methods rely on the joint optimization of nodes and structures in the condensed graph.
We advocate a new Structure-Free Graph Condensation paradigm, named SFGC, to distill a large-scale graph into a small-scale graph node set.
arXiv Detail & Related papers (2023-06-05T07:53:52Z) - Distributed Graph Embedding with Information-Oriented Random Walks [16.290803469068145]
Graph embedding maps graph nodes to low-dimensional vectors, and is widely adopted in machine learning tasks.
We present a general-purpose, distributed, information-centric random walk-based graph embedding framework, DistGER, which can scale to embed billion-edge graphs.
D DistGER exhibits 2.33x-129x acceleration, 45% reduction in cross-machines communication, and > 10% effectiveness improvement in downstream tasks.
arXiv Detail & Related papers (2023-03-28T03:11:21Z) - Graph-based Global Robot Localization Informing Situational Graphs with
Architectural Graphs [8.514420632209811]
We develop a method for converting the plan of a building into what we denote as an architectural graph (A-Graph)
When the robot starts moving in an environment, we assume it has no knowledge about it, and it estimates an online situational graph representation (S-Graph) of its surroundings.
We develop a novel graph-to-graph matching method, in order to relate the S-Graph estimated online from the robot sensors and the A-Graph extracted from the building plans.
arXiv Detail & Related papers (2023-03-03T16:48:38Z) - S-Graphs+: Real-time Localization and Mapping leveraging Hierarchical
Representations [9.13466172688693]
S-Graphs+ is a novel four-layered factor graph that includes: (1) a pose layer with robot pose estimates, (2) a walls layer representing wall surfaces, (3) a rooms layer encompassing sets of wall planes, and (4) a floors layer gathering the rooms within a given floor level.
The above graph is optimized in real-time to obtain a robust and accurate estimate of the robots pose and its map, simultaneously constructing and leveraging high-level information of the environment.
arXiv Detail & Related papers (2022-12-22T15:06:21Z) - Advanced Situational Graphs for Robot Navigation in Structured Indoor
Environments [9.13466172688693]
We present an advanced version of the Situational Graphs (S-Graphs+), consisting of the five layered optimizable graph.
S-Graphs+ demonstrates improved performance over S-Graphs efficiently extracting the room information.
arXiv Detail & Related papers (2022-11-16T08:30:05Z) - E-Graph: Minimal Solution for Rigid Rotation with Extensibility Graphs [61.552125054227595]
A new minimal solution is proposed to solve relative rotation estimation between two images without overlapping areas.
Based on E-Graph, the rotation estimation problem becomes simpler and more elegant.
We embed our rotation estimation strategy into a complete camera tracking and mapping system which obtains 6-DoF camera poses and a dense 3D mesh model.
arXiv Detail & Related papers (2022-07-20T16:11:48Z) - Scaling R-GCN Training with Graph Summarization [71.06855946732296]
Training of Relation Graph Convolutional Networks (R-GCN) does not scale well with the size of the graph.
In this work, we experiment with the use of graph summarization techniques to compress the graph.
We obtain reasonable results on the AIFB, MUTAG and AM datasets.
arXiv Detail & Related papers (2022-03-05T00:28:43Z) - GraphDCA -- a Framework for Node Distribution Comparison in Real and
Synthetic Graphs [72.51835626235368]
We argue that when comparing two graphs, the distribution of node structural features is more informative than global graph statistics.
We present GraphDCA - a framework for evaluating similarity between graphs based on the alignment of their respective node representation sets.
arXiv Detail & Related papers (2022-02-08T14:19:19Z) - Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming [48.99614465020678]
We introduce a novel self-supervised graph representation learning algorithm via Graph Contrastive Adjusted Zooming.
This mechanism enables G-Zoom to explore and extract self-supervision signals from a graph from multiple scales.
We have conducted extensive experiments on real-world datasets, and the results demonstrate that our proposed model outperforms state-of-the-art methods consistently.
arXiv Detail & Related papers (2021-11-20T22:45:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.