Convolutional Filtering in Simplicial Complexes

by   Elvin Isufi, et al.

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. These filters are built by following the shift-and-sum principle of the convolution operation and rely on the Hodge-Laplacians to shift the signal within the simplex. But since in SCs we have also inter-simplex coupling, we use the incidence matrices to transfer the signal in adjacent simplices and build a filter bank to jointly filter signals from different levels. We prove some interesting properties for the proposed filter bank, including permutation and orientation equivariance, a computational complexity that is linear in the SC dimension, and a spectral interpretation using the simplicial Fourier transform. We illustrate the proposed approach with numerical experiments.


Finite Impulse Response Filters for Simplicial Complexes

In this paper, we study linear filters to process signals defined on sim...

Simplicial Convolutional Filters

We study linear filters for processing signals supported on abstract top...

Digraph Signal Processing with Generalized Boundary Conditions

Signal processing on directed graphs (digraphs) is problematic, since th...

Adaptive System Identification Using LMS Algorithm Integrated with Evolutionary Computation

System identification is an exceptionally expansive topic and of remarka...

Mixed-Order Spectral Clustering for Networks

Clustering is fundamental for gaining insights from complex networks, an...

Adaptive Denoising of Signals with Shift-Invariant Structure

We study the problem of discrete-time signal denoising, following the li...

Mathematical Modeling of Sediments in the Filter and Improvement of the Filter Construction

The filters work in many areas of technology. There constructions are di...