scholarly journals Graphgen-redux: a Fast and Lightweight Recurrent Model for labeled Graph Generation

Author(s):  
Davide Bacciu ◽  
Marco Podda
Author(s):  
Yanli Feng ◽  
Gongliang Sun ◽  
Zhiyao Liu ◽  
Chenrui Wu ◽  
Xiaoyang Zhu ◽  
...  

2018 ◽  
Vol 9 (11) ◽  
pp. 1712-1716
Author(s):  
R. Palanikumar ◽  
A. Rameshkumar
Keyword(s):  

2020 ◽  
Vol 14 (7) ◽  
pp. 546-553
Author(s):  
Zhenxing Zheng ◽  
Zhendong Li ◽  
Gaoyun An ◽  
Songhe Feng
Keyword(s):  

2021 ◽  
Vol 10 (7) ◽  
pp. 488
Author(s):  
Peng Li ◽  
Dezheng Zhang ◽  
Aziguli Wulamu ◽  
Xin Liu ◽  
Peng Chen

A deep understanding of our visual world is more than an isolated perception on a series of objects, and the relationships between them also contain rich semantic information. Especially for those satellite remote sensing images, the span is so large that the various objects are always of different sizes and complex spatial compositions. Therefore, the recognition of semantic relations is conducive to strengthen the understanding of remote sensing scenes. In this paper, we propose a novel multi-scale semantic fusion network (MSFN). In this framework, dilated convolution is introduced into a graph convolutional network (GCN) based on an attentional mechanism to fuse and refine multi-scale semantic context, which is crucial to strengthen the cognitive ability of our model Besides, based on the mapping between visual features and semantic embeddings, we design a sparse relationship extraction module to remove meaningless connections among entities and improve the efficiency of scene graph generation. Meanwhile, to further promote the research of scene understanding in remote sensing field, this paper also proposes a remote sensing scene graph dataset (RSSGD). We carry out extensive experiments and the results show that our model significantly outperforms previous methods on scene graph generation. In addition, RSSGD effectively bridges the huge semantic gap between low-level perception and high-level cognition of remote sensing images.


1993 ◽  
Vol 2 (2) ◽  
pp. 103-113 ◽  
Author(s):  
Martin Aigner ◽  
Eberhard Triesch

Associate to a finite labeled graph G(V, E) its multiset of neighborhoods (G) = {N(υ): υ ∈ V}. We discuss the question of when a list is realizable by a graph, and to what extent G is determined by (G). The main results are: the decision problem is NP-complete; for bipartite graphs the decision problem is polynomially equivalent to Graph Isomorphism; forests G are determined up to isomorphism by (G); and if G is connected bipartite and (H) = (G), then H is completely described.


Sign in / Sign up

Export Citation Format

Share Document