Linear building pattern recognition via spatial knowledge graph
- URL: http://arxiv.org/abs/2304.10733v1
- Date: Fri, 21 Apr 2023 04:05:02 GMT
- Title: Linear building pattern recognition via spatial knowledge graph
- Authors: Wei Zhiwei, Xiao Yi, Tong Ying, Xu Wenjia, Wang Yang
- Abstract summary: Building patterns are important urban structures that reflect the effect of the urban material and social-economic on a region.
Previous researches are mostly based on the graph isomorphism method and use rules to recognize building patterns, which are not efficient.
This paper tries to apply the knowledge graph to recognize linear building patterns.
- Score: 2.3274138116397736
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Building patterns are important urban structures that reflect the effect of
the urban material and social-economic on a region. Previous researches are
mostly based on the graph isomorphism method and use rules to recognize
building patterns, which are not efficient. The knowledge graph uses the graph
to model the relationship between entities, and specific subgraph patterns can
be efficiently obtained by using relevant reasoning tools. Thus, we try to
apply the knowledge graph to recognize linear building patterns. First, we use
the property graph to express the spatial relations in proximity, similar and
linear arrangement between buildings; secondly, the rules of linear pattern
recognition are expressed as the rules of knowledge graph reasoning; finally,
the linear building patterns are recognized by using the rule-based reasoning
in the built knowledge graph. The experimental results on a dataset containing
1289 buildings show that the method in this paper can achieve the same
precision and recall as the existing methods; meanwhile, the recognition
efficiency is improved by 5.98 times.
Related papers
- From Latent to Lucid: Transforming Knowledge Graph Embeddings into Interpretable Structures [2.6451388057494283]
This paper introduces a post-hoc explainable AI method tailored for Knowledge Graph Embedding models.
Our approach directly decodes the latent representations encoded by Knowledge Graph Embedding models.
By identifying distinct structures within the subgraph neighborhoods of similarly embedded entities, our method translates these insights into human-understandable symbolic rules and facts.
arXiv Detail & Related papers (2024-06-03T19:54:11Z) - Rule-Guided Joint Embedding Learning over Knowledge Graphs [6.831227021234669]
This paper introduces a novel model that incorporates both contextual and literal information into entity and relation embeddings.
For contextual information, we assess its significance through confidence and relatedness metrics.
We validate our model performance with thorough experiments on two established benchmark datasets.
arXiv Detail & Related papers (2023-12-01T19:58:31Z) - Inferring High-level Geographical Concepts via Knowledge Graph and
Multi-scale Data Integration: A Case Study of C-shaped Building Pattern
Recognition [23.13018761290839]
Building pattern recognition is critical for understanding urban form, automating map generalization, and visualizing 3D city models.
Most existing studies use object-independent methods based on visual perception rules and proximity graph models to extract patterns.
We integrate multi-scale data using a knowledge graph, focusing on the recognition of C-shaped building patterns.
arXiv Detail & Related papers (2023-04-19T03:03:50Z) - Spectral Augmentations for Graph Contrastive Learning [50.149996923976836]
Contrastive learning has emerged as a premier method for learning representations with or without supervision.
Recent studies have shown its utility in graph representation learning for pre-training.
We propose a set of well-motivated graph transformation operations to provide a bank of candidates when constructing augmentations for a graph contrastive objective.
arXiv Detail & Related papers (2023-02-06T16:26:29Z) - State of the Art and Potentialities of Graph-level Learning [54.68482109186052]
Graph-level learning has been applied to many tasks including comparison, regression, classification, and more.
Traditional approaches to learning a set of graphs rely on hand-crafted features, such as substructures.
Deep learning has helped graph-level learning adapt to the growing scale of graphs by extracting features automatically and encoding graphs into low-dimensional representations.
arXiv Detail & Related papers (2023-01-14T09:15:49Z) - Counterfactual Fairness with Partially Known Causal Graph [85.15766086381352]
This paper proposes a general method to achieve the notion of counterfactual fairness when the true causal graph is unknown.
We find that counterfactual fairness can be achieved as if the true causal graph were fully known, when specific background knowledge is provided.
arXiv Detail & Related papers (2022-05-27T13:40:50Z) - Knowledge Sheaves: A Sheaf-Theoretic Framework for Knowledge Graph
Embedding [1.5469452301122175]
We show that knowledge graph embedding is naturally expressed in the topological and categorical language of textitcellular sheaves
A knowledge graph embedding can be described as an approximate global section of an appropriate textitknowledge sheaf over the graph.
The resulting embeddings can be easily adapted for reasoning over composite relations without special training.
arXiv Detail & Related papers (2021-10-07T20:54:40Z) - Joint Graph Learning and Matching for Semantic Feature Correspondence [69.71998282148762]
We propose a joint emphgraph learning and matching network, named GLAM, to explore reliable graph structures for boosting graph matching.
The proposed method is evaluated on three popular visual matching benchmarks (Pascal VOC, Willow Object and SPair-71k)
It outperforms previous state-of-the-art graph matching methods by significant margins on all benchmarks.
arXiv Detail & Related papers (2021-09-01T08:24:02Z) - GraphOpt: Learning Optimization Models of Graph Formation [72.75384705298303]
We propose an end-to-end framework that learns an implicit model of graph structure formation and discovers an underlying optimization mechanism.
The learned objective can serve as an explanation for the observed graph properties, thereby lending itself to transfer across different graphs within a domain.
GraphOpt poses link formation in graphs as a sequential decision-making process and solves it using maximum entropy inverse reinforcement learning algorithm.
arXiv Detail & Related papers (2020-07-07T16:51:39Z) - A Heterogeneous Graph with Factual, Temporal and Logical Knowledge for
Question Answering Over Dynamic Contexts [81.4757750425247]
We study question answering over a dynamic textual environment.
We develop a graph neural network over the constructed graph, and train the model in an end-to-end manner.
arXiv Detail & Related papers (2020-04-25T04:53:54Z)
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.