id |
oapen-20.500.12657-89044
|
record_format |
dspace
|
spelling |
oapen-20.500.12657-890442024-04-03T02:22:48Z Chapter Topological Relationship Modelling for Industrial Facility Digitisation Using Graph Neural Networks Jayasinghe, Haritha Brilakis, Ioannis BIM Digital twin GNN machine learning thema EDItEUR::U Computing and Information Technology::UT Computer networking and communications::UTV Virtualization There is rising demand for automated digital twin construction based on point cloud scans, especially in the domain of industrial facilities. Yet, current automation approaches focus almost exclusively on geometric modelling. The output of these methods is a disjoint cluster of individual elements, while element relationships are ignored. This research demonstrates the feasibility of adopting Graph Neural Networks (GNN) for automated detection of connectivity relationships between elements in industrial facility scans. We propose a novel method which represents elements and relationships as graph nodes and edges respectively. Element geometry is encoded into graph node features. This allows relationship inference to be modelled as a graph link prediction task. We thereby demonstrate that connectivity relationships can be learned from existing design files, without requiring domain specific, hand-coded rules, or manual annotations. Preliminary results show that our method performs successfully on a synthetic point cloud testset generated from design files with a 0.64 F1 score. We further demonstrate that the method adapts to occluded real-world scans. The method can be further extended with the introduction of more descriptive node features. Additionally, we present tools for relationship annotation and visualisation to aid relationship detection 2024-04-02T15:44:40Z 2024-04-02T15:44:40Z 2023 chapter ONIX_20240402_9791221502893_13 2704-5846 9791221502893 https://library.oapen.org/handle/20.500.12657/89044 eng Proceedings e report application/pdf n/a 9791221502893_88.pdf https://books.fupress.com/doi/capitoli/979-12-215-0289-3_88 Firenze University Press 10.36253/979-12-215-0289-3.88 10.36253/979-12-215-0289-3.88 bf65d21a-78e5-4ba2-983a-dbfa90962870 9791221502893 137 8 Florence open access
|
institution |
OAPEN
|
collection |
DSpace
|
language |
English
|
description |
There is rising demand for automated digital twin construction based on point cloud scans, especially in the domain of industrial facilities. Yet, current automation approaches focus almost exclusively on geometric modelling. The output of these methods is a disjoint cluster of individual elements, while element relationships are ignored. This research demonstrates the feasibility of adopting Graph Neural Networks (GNN) for automated detection of connectivity relationships between elements in industrial facility scans. We propose a novel method which represents elements and relationships as graph nodes and edges respectively. Element geometry is encoded into graph node features. This allows relationship inference to be modelled as a graph link prediction task. We thereby demonstrate that connectivity relationships can be learned from existing design files, without requiring domain specific, hand-coded rules, or manual annotations. Preliminary results show that our method performs successfully on a synthetic point cloud testset generated from design files with a 0.64 F1 score. We further demonstrate that the method adapts to occluded real-world scans. The method can be further extended with the introduction of more descriptive node features. Additionally, we present tools for relationship annotation and visualisation to aid relationship detection
|
title |
9791221502893_88.pdf
|
spellingShingle |
9791221502893_88.pdf
|
title_short |
9791221502893_88.pdf
|
title_full |
9791221502893_88.pdf
|
title_fullStr |
9791221502893_88.pdf
|
title_full_unstemmed |
9791221502893_88.pdf
|
title_sort |
9791221502893_88.pdf
|
publisher |
Firenze University Press
|
publishDate |
2024
|
url |
https://books.fupress.com/doi/capitoli/979-12-215-0289-3_88
|
_version_ |
1799945270368141312
|