Local Spectral Graph Convolution for Point Set Feature Learning

By Chu Wang, Babak Samari, Kaleem Siddiqi. 2018

401 citations recorded by the source corpus.

Feature learning on point clouds has shown great promise, with the introduction of effective and generalizable deep learning frameworks such as pointnet++. Thus far, however, point features have been abstracted in an independent and isolated manner, ignoring the relative layout of neighboring points as well as their features. In the present article, we propose to overcome this limitation by using spectral graph convolution on a local graph, combined with a novel graph pooling strategy. In our approach, graph convolution is carried out on a nearest neighbor graph constructed from a point's neighborhood, such that features are jointly learned. We replace the standard max pooling step with a recursive clustering and pooling strategy, devised to aggregate information from within clusters of nodes that are close to one another in their spectral coordinates, leading to richer overall feature descriptors. Through extensive experiments on diverse datasets, we show a consistent demonstrable advantage for the tasks of both point set classification and segmentation.

Subfields: Computational Mechanics, Environmental Engineering, Geology

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

  1. Binh-Son Hua
  2. Sai-Kit Yeung
  3. Leonidas J. Guibas
  4. Or Litany
  5. Charles Ruizhongtai Qi
  6. Hengshuang Zhao
  7. Dinh C. Nguyen
  8. Cheng Wang

In Environmental Engineering

  1. Cheng Wang
  2. Saifullahi Aminu Bello
  3. Shangshu Yu
  4. Sai-Kit Yeung
  5. Binh-Son Hua
  6. Charles Ruizhongtai Qi
  7. Fei Liu
  8. Chunhong Pan

In Geology

  1. Or Litany
  2. Leonidas J. Guibas
  3. Binh-Son Hua
  4. Sai-Kit Yeung
  5. Hengshuang Zhao
  6. Charles Ruizhongtai Qi
  7. Saining Xie
  8. Qingyong Hu

Citations in the corpus