Simplicial Convolutional Filters

• URL: http://arxiv.org/abs/2201.11720v3
• Date: Tue, 20 Feb 2024 17:53:38 GMT
• Title: Simplicial Convolutional Filters
• Authors: Maosheng Yang, Elvin Isufi, Michael T. Schaub, Geert Leus
• Abstract summary: We study linear filters for processing signals supported on abstract topological spaces modeled as simplicial complexes. We develop simplicial convolutional filters defined as matrixs of the lower and upper Hodge Laplacians. These filters can be implemented in a distributed fashion with a low computational complexity.
• Score: 29.792143749770442
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: We study linear filters for processing signals supported on abstract topological spaces modeled as simplicial complexes, which may be interpreted as generalizations of graphs that account for nodes, edges, triangular faces etc. To process such signals, we develop simplicial convolutional filters defined as matrix polynomials of the lower and upper Hodge Laplacians. First, we study the properties of these filters and show that they are linear and shift-invariant, as well as permutation and orientation equivariant. These filters can also be implemented in a distributed fashion with a low computational complexity, as they involve only (multiple rounds of) simplicial shifting between upper and lower adjacent simplices. Second, focusing on edge-flows, we study the frequency responses of these filters and examine how we can use the Hodge-decomposition to delineate gradient, curl and harmonic frequencies. We discuss how these frequencies correspond to the lower- and the upper-adjacent couplings and the kernel of the Hodge Laplacian, respectively, and can be tuned independently by our filter designs. Third, we study different procedures for designing simplicial convolutional filters and discuss their relative advantages. Finally, we corroborate our simplicial filters in several applications: to extract different frequency components of a simplicial signal, to denoise edge flows, and to analyze financial markets and traffic networks.

Related papers

• HoloNets: Spectral Convolutions do extend to Directed Graphs [59.851175771106625]
  Conventional wisdom dictates that spectral convolutional networks may only be deployed on undirected graphs. Here we show this traditional reliance on the graph Fourier transform to be superfluous. We provide a frequency-response interpretation of newly developed filters, investigate the influence of the basis used to express filters and discuss the interplay with characteristic operators on which networks are based.
  arXiv  Detail & Related papers  (2023-10-03T17:42:09Z)
• On the Shift Invariance of Max Pooling Feature Maps in Convolutional Neural Networks [0.0]
  Subsampled convolutions with Gabor-like filters are prone to aliasing, causing sensitivity to small input shifts. We highlight the crucial role played by the filter's frequency and orientation in achieving stability. We experimentally validate our theory by considering a deterministic feature extractor based on the dual-tree complex wavelet packet transform.
  arXiv  Detail & Related papers  (2022-09-19T08:15:30Z)
• Computational Doob's h-transforms for Online Filtering of Discretely Observed Diffusions [65.74069050283998]
  We propose a computational framework to approximate Doob's $h$-transforms. The proposed approach can be orders of magnitude more efficient than state-of-the-art particle filters.
  arXiv  Detail & Related papers  (2022-06-07T15:03:05Z)
• Deep Learning for the Benes Filter [91.3755431537592]
  We present a new numerical method based on the mesh-free neural network representation of the density of the solution of the Benes model. We discuss the role of nonlinearity in the filtering model equations for the choice of the domain of the neural network.
  arXiv  Detail & Related papers  (2022-03-09T14:08:38Z)
• Convolutional Filtering in Simplicial Complexes [13.604803091781926]
  This paper proposes convolutional filtering for data whose structure can be modeled by a simplicial complex (SC) SCs are mathematical tools that not only capture pairwise relationships as graphs but account also for higher-order network structures.
  arXiv  Detail & Related papers  (2022-01-29T13:13:57Z)
• Reverse image filtering using total derivative approximation and accelerated gradient descent [82.93345261434943]
  We address a new problem of reversing the effect of an image filter, which can be linear or nonlinear. The assumption is that the algorithm of the filter is unknown and the filter is available as a black box. We formulate this inverse problem as minimizing a local patch-based cost function and use total derivative to approximate the gradient which is used in gradient descent to solve the problem.
  arXiv  Detail & Related papers  (2021-12-08T05:16:11Z)
• Learning Versatile Convolution Filters for Efficient Visual Recognition [125.34595948003745]
  This paper introduces versatile filters to construct efficient convolutional neural networks. We conduct theoretical analysis on network complexity and an efficient convolution scheme is introduced. Experimental results on benchmark datasets and neural networks demonstrate that our versatile filters are able to achieve comparable accuracy as that of original filters.
  arXiv  Detail & Related papers  (2021-09-20T06:07:14Z)
• Stability to Deformations of Manifold Filters and Manifold Neural Networks [89.53585099149973]
  The paper defines and studies manifold (M) convolutional filters and neural networks (NNs) The main technical contribution of the paper is to analyze the stability of manifold filters and MNNs to smooth deformations of the manifold.
  arXiv  Detail & Related papers  (2021-06-07T15:41:03Z)
• 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)
• Fourier-based and Rational Graph Filters for Spectral Processing [0.0]
  Our overall goal is the definition of novel Fourier-based filters for graph processing. For efficient evaluation of discrete spectral-based and wavelet operators, we introduce a spectrum-free approach. Approximating arbitrary graph filters with rationals provides a more accurate and numerically stable alternative with respect to sparses.
  arXiv  Detail & Related papers  (2020-11-08T19:02:52Z)
• Efficient Spatially Adaptive Convolution and Correlation [11.167305713900074]
  We provide a representation-theoretic framework that allows for spatially varying linear transformations to be applied to the filter. This framework allows for efficient implementation of extended convolution and correlation for transformation groups such as rotation (in 2D and 3D) and scale. We present applications to pattern matching, image feature description, vector field visualization, and adaptive image filtering.
  arXiv  Detail & Related papers  (2020-06-23T17:41:10Z)

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.