Cited by 7,1993D Shape Modeling and AnalysisAdvanced Neural Network ApplicationsTopological and Geometric Data Analysis

Dynamic Graph CNN for Learning on Point Clouds

Open access
Wang, Yue, Sun, Yongbin, Liu, Ziwei, Sarma, Sanjay E., Bronstein, Michael M., Solomon, Justin M.·2019·ACM Transactions on Graphics

Abstract

Point clouds provide a flexible geometric representation suitable for countless applications in computer graphics; they also comprise the raw output of most 3D data acquisition devices. While hand-designed features on point clouds have long been proposed in graphics and vision, however, the recent overwhelming success of convolutional neural networks (CNNs) for image analysis suggests the value of adapting insight from CNN to the point cloud world. Point clouds inherently lack topological information, so designing a model to recover topology can enrich the representation power of point clouds. To this end, we propose a new neural network module dubbed EdgeConv suitable for CNN-based high-level tasks on point clouds, including classification and segmentation. EdgeConv acts on graphs dynamically computed in each layer of the network. It is differentiable and can be plugged into existing architectures. Compared to existing modules operating in extrinsic space or treating each point independently, EdgeConv has several appealing properties: It incorporates local neighborhood information; it can be stacked applied to learn global shape properties; and in multi-layer systems affinity in feature space captures semantic characteristics over potentially long distances in the original embedding. We show the performance of our model on standard benchmarks, including ModelNet40, ShapeNetPart, and S3DIS.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3326362

Cites

86 of 86 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • RigNet's graph neural network builds upon and adapts the edge convolution operator proposed in [Wang et al. 2019] to perform edge convolutions within mesh-based and geodesic neighborhoods.

    “Our method instead learns edge feature representations within both mesh and geodesic neighborhoods, and combines them into vertex representations inspired by the edge convolution scheme of [Wang et al. 2019].”

    From RigNet: Neural Rigging for Articulated Characters (2020) · cites this paper as Wang et al. 2019

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

4 of the 90 references couldn’t be matched to a known paper.

Research works printed but not linked: 3

  1. Michaël Defferrard , Xavier Bresson , and Pierre Vandergheynst . 2016 . Convolutional neural networks on graphs with fast localized spectral filtering . In Proceedings of the NIPS. Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In Proceedings of the NIPS.
  2. Ian Goodfellow , Jean Pouget-Abadie , Mehdi Mirza , Bing Xu , David Warde-Farley , Sherjil Ozair , Aaron Courville , and Yoshua Bengio . 2014 . Generative adversarial nets . In Proceedings of the NIPS. Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014. Generative adversarial nets. In Proceedings of the NIPS.
  3. Diederik P. Kingma and Max Welling . 2013 . Auto-encoding variational bayes. arXiv:1312.6114 (2013). Diederik P. Kingma and Max Welling. 2013. Auto-encoding variational bayes. arXiv:1312.6114 (2013). · arXiv

Cited by

Sorted by citations

Authors
Wang, Y., Sun, Y., Liu, Z., Sarma, S. E., Bronstein, M. M., & Solomon, J. M.
Affiliations
  • Massachusetts Institute of Technology (US)
  • International Computer Science Institute (US)
  • Imperial College London (GB)
Venue
ACM Transactions on Graphics
Published
2019-10-10
Volume
38
Issue
5
Pages
1-12
ISSN
  • 0730-0301 (ISSN-L)
  • 1557-7368
OpenAlex
W2979750740
Cited by
7,199
References
90
Citations by year
2026: 865 · 2025: 1221 · 2024: 1301 · 2023: 1160 · 2022: 924 · 2021: 887 · 2020: 570 · 2019: 233 · 2018: 37 · 2012: 1
FWCI
443.99
Type
journal article
Language
en
Open access
Locations
  • ACM Transactions on Graphics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc-sa)
  • arXiv (Cornell University)
Funders
  • Air Force Office of Scientific Research (FA9550-19-1-0319)
  • Toyota-CSAIL Joint Research Center
  • National Science Foundation (IIS-1838071)
  • Amazon Research Award
  • MITIBM Watson AI Laboratory
  • Skoltech-MIT Next Generation Program
  • Army Research Office (W911NF-12-R-0011)
  • ERC Consolidator (724228 (LEMAN))
  • Google Faculty Research Award
Topics
  • Physical Sciences › Engineering › Computational Mechanics › 3D Shape Modeling and Analysis
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
Keywords
point clouds, dynamic graph convolution, graph neural networks, 3D shape classification, 3D shape segmentation, point cloud topology, local neighborhood information, 3D object recognition

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review