Invariant Representations of Embedded Simplicial Complexes
Not on the map. Why?
Abstract (arXiv)
Analyzing embedded simplicial complexes, such as triangular meshes and graphs, is an important problem in many fields. We propose a new approach for analyzing embedded simplicial complexes in a subdivision-invariant and isometry-invariant way using only topological and geometric information. Our approach is based on creating and analyzing sufficient statistics and uses a graph neural network. We demonstrate the effectiveness of our approach using a synthetic mesh data set.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 37 references that are in the map. First posted on arXiv 27 Feb 2023.
Builds on
14 of 37 references.
References · 14
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2018Spherical CNNscited by 452
- 2019Gauge Equivariant Convolutional Networks and the Icosahedral CNNcited by 262
- 2017Learning SO(3) Equivariant Representations with Spherical CNNscited by 244
- 2015Persistence Images: A Stable Vector Representation of Persistent Homologycited by 235
- 2019Ripser: efficient computation of Vietoris-Rips persistence barcodescited by 115
- 2020Gauge Equivariant Mesh CNNs: Anisotropic convolutions on geometric graphscited by 90
- 2020DeepSphere: a graph-based spherical CNNcited by 65
- 2020giotto-tda: A Topological Data Analysis Toolkit for Machine Learning and Data Explorationcited by 55
- 2018The persistence landscape and some of its propertiescited by 18
2 more
- 2017Graph-Based Classification of Omnidirectional Imagescited by 16
- 2020The Weighted Euler Curve Transform for Shape and Image Analysiscited by 10
Built on by
Not cited yet.