Distance-Geometric Graph Convolutional Network (DG-GCN) for Three-Dimensional (3D) Graphs

• URL: http://arxiv.org/abs/2007.03513v4
• Date: Mon, 22 Mar 2021 17:53:03 GMT
• Title: Distance-Geometric Graph Convolutional Network (DG-GCN) for Three-Dimensional (3D) Graphs
• Authors: Daniel T. Chang
• Abstract summary: We propose a message-passing graph convolutional network based on the distance-geometric graph representation: DG-GCN. It enables learning of filter weights from distances, thereby incorporating the geometry of 3D graphs in graph convolutions. Our work demonstrates the utility and value of DG-GCN for end-to-end deep learning on 3D graphs, particularly molecular graphs.
• Score: 0.8722210937404288
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The distance-geometric graph representation adopts a unified scheme (distance) for representing the geometry of three-dimensional(3D) graphs. It is invariant to rotation and translation of the graph and it reflects pair-wise node interactions and their generally local nature. To facilitate the incorporation of geometry in deep learning on 3D graphs, we propose a message-passing graph convolutional network based on the distance-geometric graph representation: DG-GCN (distance-geometric graph convolution network). It utilizes continuous-filter convolutional layers, with filter-generating networks, that enable learning of filter weights from distances, thereby incorporating the geometry of 3D graphs in graph convolutions. Our results for the ESOL and FreeSolv datasets show major improvement over those of standard graph convolutions. They also show significant improvement over those of geometric graph convolutions employing edge weight / edge distance power laws. Our work demonstrates the utility and value of DG-GCN for end-to-end deep learning on 3D graphs, particularly molecular graphs.

Related papers

• Point Cloud Denoising With Fine-Granularity Dynamic Graph Convolutional Networks [58.050130177241186]
  Noise perturbations often corrupt 3-D point clouds, hindering downstream tasks such as surface reconstruction, rendering, and further processing. This paper introduces finegranularity dynamic graph convolutional networks called GDGCN, a novel approach to denoising in 3-D point clouds.
  arXiv  Detail & Related papers  (2024-11-21T14:19:32Z)
• 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)
• Distance-Geometric Graph Attention Network (DG-GAT) for 3D Molecular Geometry [0.8722210937404288]
  3D distance-geometric graph representation (DG-GR) adopts a unified scheme (distance) for representing the geometry of 3D graphs. We propose the 3D distance-geometric graph attention network (DG-GAT) for use with DG-GR. Experimental results show major improvement over those of the standard graph convolution network based on 2D molecular graphs.
  arXiv  Detail & Related papers  (2022-07-16T21:39:31Z)
• Hierarchical Graph Networks for 3D Human Pose Estimation [50.600944798627786]
  Recent 2D-to-3D human pose estimation works tend to utilize the graph structure formed by the topology of the human skeleton. We argue that this skeletal topology is too sparse to reflect the body structure and suffer from serious 2D-to-3D ambiguity problem. We propose a novel graph convolution network architecture, Hierarchical Graph Networks, to overcome these weaknesses.
  arXiv  Detail & Related papers  (2021-11-23T15:09:03Z)
• Joint 3D Human Shape Recovery from A Single Imag with Bilayer-Graph [35.375489948345404]
  We propose a dual-scale graph approach to estimate the 3D human shape and pose from images. We use a coarse graph, derived from a dense graph, to estimate the human's 3D pose, and the dense graph to estimate the 3D shape. We train our model end-to-end and show that we can achieve state-of-the-art results for several evaluation datasets.
  arXiv  Detail & Related papers  (2021-10-16T05:04:02Z)
• Pre-training Molecular Graph Representation with 3D Geometry [39.35244035710228]
  Molecular graphs are typically modeled by their 2D topological structures. Lack of 3D information in real-world scenarios has significantly impeded the learning of geometric graph representation. We propose the Graph Multi-View Pre-training (GraphMVP) framework where self-supervised learning is performed by leveraging the correspondence and consistency between 2D topological structures and 3D geometric views.
  arXiv  Detail & Related papers  (2021-10-07T17:48:57Z)
• Spectral Graph Convolutional Networks With Lifting-based Adaptive Graph Wavelets [81.63035727821145]
  Spectral graph convolutional networks (SGCNs) have been attracting increasing attention in graph representation learning. We propose a novel class of spectral graph convolutional networks that implement graph convolutions with adaptive graph wavelets.
  arXiv  Detail & Related papers  (2021-08-03T17:57:53Z)
• Joint Deep Multi-Graph Matching and 3D Geometry Learning from Inhomogeneous 2D Image Collections [57.60094385551773]
  We propose a trainable framework for learning a deformable 3D geometry model from inhomogeneous image collections. We in addition obtain the underlying 3D geometry of the objects depicted in the 2D images.
  arXiv  Detail & Related papers  (2021-03-31T17:25:36Z)
• Graph Pooling with Node Proximity for Hierarchical Representation Learning [80.62181998314547]
  We propose a novel graph pooling strategy that leverages node proximity to improve the hierarchical representation learning of graph data with their multi-hop topology. Results show that the proposed graph pooling strategy is able to achieve state-of-the-art performance on a collection of public graph classification benchmark datasets.
  arXiv  Detail & Related papers  (2020-06-19T13:09:44Z)
• Geometric Graph Representations and Geometric Graph Convolutions for Deep Learning on Three-Dimensional (3D) Graphs [0.8722210937404288]
  The geometry of three-dimensional (3D) graphs, consisting of nodes and edges, plays a crucial role in many important applications. We define three types of geometric graph representations: positional, angle-geometric and distance-geometric. For proof of concept, we use the distance-geometric graph representation for geometric graph convolutions. The results of geometric graph convolutions, for the ESOL and Freesol datasets, show significant improvement over those of standard graph convolutions.
  arXiv  Detail & Related papers  (2020-06-02T17:08:59Z)
• Geom-GCN: Geometric Graph Convolutional Networks [15.783571061254847]
  We propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN, to perform transductive learning on graphs.
  arXiv  Detail & Related papers  (2020-02-13T00:03:09Z)

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.