Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs

April 10, 2017 · Entered Twilight · 🏛 Computer Vision and Pattern Recognition

"Last commit was 7.0 years ago (≥5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: README.md, ecc, main.py, models.py, pointcloud_dataset.py, pointcloud_utils.py

Authors Martin Simonovsky, Nikos Komodakis arXiv ID 1704.02901 Category cs.CV: Computer Vision Cross-listed cs.LG, cs.NE Citations 1.3K Venue Computer Vision and Pattern Recognition Repository https://github.com/mys007/ecc ⭐ 231 Last Checked 1 month ago

Abstract

A number of problems can be formulated as prediction on graph-structured data. In this work, we generalize the convolution operator from regular grids to arbitrary graphs while avoiding the spectral domain, which allows us to handle graphs of varying size and connectivity. To move beyond a simple diffusion, filter weights are conditioned on the specific edge labels in the neighborhood of a vertex. Together with the proper choice of graph coarsening, we explore constructing deep neural networks for graph classification. In particular, we demonstrate the generality of our formulation in point cloud classification, where we set the new state of the art, and on a graph classification dataset, where we outperform other deep learning approaches. The source code is available at https://github.com/mys007/ecc