Signal Processing on Cell Complexes

• URL: http://arxiv.org/abs/2110.05614v1
• Date: Mon, 11 Oct 2021 21:11:59 GMT
• Title: Signal Processing on Cell Complexes
• Authors: T. Mitchell Roddenberry, Michael T. Schaub, Mustafa Hajij
• Abstract summary: We give an introduction to signal processing on (abstract) regular cell complexes. We discuss how appropriate Hodge Laplacians for these cell complexes can be derived.
• Score: 7.0471949371778795
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The processing of signals supported on non-Euclidean domains has attracted large interest in the last years. Thus far, such non-Euclidean domains have been abstracted primarily as graphs with signals supported on the nodes, though recently the processing of signals on more general structures such as simplicial complexes has also been considered. In this paper, we give an introduction to signal processing on (abstract) regular cell complexes, which provide a unifying framework encompassing graphs, simplicial complexes, cubical complexes and various meshes as special cases. We discuss how appropriate Hodge Laplacians for these cell complexes can be derived. These Hodge Laplacians enable the construction of convolutional filters, which can be employed in linear filtering and non-linear filtering via neural networks defined on cell complexes.

Related papers

• SpaceMesh: A Continuous Representation for Learning Manifold Surface Meshes [61.110517195874074]
  We present a scheme to directly generate manifold, polygonal meshes of complex connectivity as the output of a neural network. Our key innovation is to define a continuous latent connectivity space at each mesh, which implies the discrete mesh. In applications, this approach not only yields high-quality outputs from generative models, but also enables directly learning challenging geometry processing tasks such as mesh repair.
  arXiv  Detail & Related papers  (2024-09-30T17:59:03Z)
• Non Commutative Convolutional Signal Models in Neural Networks: Stability to Small Deformations [111.27636893711055]
  We study the filtering and stability properties of non commutative convolutional filters. Our results have direct implications for group neural networks, multigraph neural networks and quaternion neural networks.
  arXiv  Detail & Related papers  (2023-10-05T20:27:22Z)
• Spectral Convergence of Complexon Shift Operators [38.89310649097387]
  We study the transferability of Topological Signal Processing via a generalized higher-order version of graphon, known as complexon. Inspired by the graphon shift operator and message-passing neural network, we construct a marginal complexon and complexon shift operator. We prove that when a simplicial complex signal sequence converges to a complexon signal, the eigenvalues, eigenspaces, and Fourier transform of the corresponding CSOs converge to that of the limit complexon signal.
  arXiv  Detail & Related papers  (2023-09-12T08:40:20Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Convolutional Filtering and Neural Networks with Non Commutative Algebras [153.20329791008095]
  We study the generalization of non commutative convolutional neural networks. We show that non commutative convolutional architectures can be stable to deformations on the space of operators.
  arXiv  Detail & Related papers  (2021-08-23T04:22:58Z)
• Structure-aware Interactive Graph Neural Networks for the Prediction of Protein-Ligand Binding Affinity [52.67037774136973]
  Drug discovery often relies on the successful prediction of protein-ligand binding affinity. Recent advances have shown great promise in applying graph neural networks (GNNs) for better affinity prediction by learning the representations of protein-ligand complexes. We propose a structure-aware interactive graph neural network (SIGN) which consists of two components: polar-inspired graph attention layers (PGAL) and pairwise interactive pooling (PiPool)
  arXiv  Detail & Related papers  (2021-07-21T03:34:09Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• Signal processing on simplicial complexes [19.035399031968502]
  We focus on a closely related, but distinct third perspective: how can we use higher-order relationships to process signals and data supported on higher-order network structures. In particular, we survey how ideas from signal processing of data supported on regular domains, such as time series or images, can be extended to graphs and simplicial complexes.
  arXiv  Detail & Related papers  (2021-06-14T14:56:51Z)
• Finite Impulse Response Filters for Simplicial Complexes [34.47138649437185]
  We propose a finite impulse response filter based on the Hodge Laplacian. We show how this filter can be designed to amplify or attenuate certain spectral components of simplicial signals. Numerical experiments are conducted to show the potential of simplicial filters for sub-component extraction, denoising and model approximation.
  arXiv  Detail & Related papers  (2021-03-23T14:41:45Z)
• Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyond [20.422050836383725]
  This tutorial paper presents a didactic treatment of the emerging topic of signal processing on higher-order networks. We introduce the building blocks for processing data on simplicial complexes and hypergraphs.
  arXiv  Detail & Related papers  (2021-01-14T09:08:26Z)
• Cell Complex Neural Networks [0.8121462458089141]
  We propose a general, unifying construction for performing neural network-type computations on cell complexes. We show how our cell complex autoencoder construction can give, in the special case textbfcell2vec, a generalization for node2vec.
  arXiv  Detail & Related papers  (2020-10-02T01:38:12Z)

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.