Dirac signal processing of higher-order topological signals

• URL: http://arxiv.org/abs/2301.10137v2
• Date: Wed, 23 Aug 2023 11:17:19 GMT
• Title: Dirac signal processing of higher-order topological signals
• Authors: Lucille Calmon, Michael T. Schaub, Ginestra Bianconi
• Abstract summary: We propose an adaptive, unsupervised signal processing algorithm that learns to jointly filter topological signals supported on nodes, links and triangles. We test our algorithms on noisy synthetic data and noisy data of drifters in the ocean.
• Score: 5.70896453969985
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Higher-order networks can sustain topological signals which are variables associated not only to the nodes, but also to the links, to the triangles and in general to the higher dimensional simplices of simplicial complexes. These topological signals can describe a large variety of real systems including currents in the ocean, synaptic currents between neurons and biological transportation networks. In real scenarios topological signal data might be noisy and an important task is to process these signals by improving their signal to noise ratio. So far topological signals are typically processed independently of each other. For instance, node signals are processed independently of link signals, and algorithms that can enforce a consistent processing of topological signals across different dimensions are largely lacking. Here we propose Dirac signal processing, an adaptive, unsupervised signal processing algorithm that learns to jointly filter topological signals supported on nodes, links and triangles of simplicial complexes in a consistent way. The proposed Dirac signal processing algorithm is formulated in terms of the discrete Dirac operator which can be interpreted as "square root" of a higher-order Hodge Laplacian. We discuss in detail the properties of the Dirac operator including its spectrum and the chirality of its eigenvectors and we adopt this operator to formulate Dirac signal processing that can filter noisy signals defined on nodes, links and triangles of simplicial complexes. We test our algorithms on noisy synthetic data and noisy data of drifters in the ocean and find that the algorithm can learn to efficiently reconstruct the true signals outperforming algorithms based exclusively on the Hodge Laplacian.

Related papers

• Graph Neural Networks for Edge Signals: Orientation Equivariance and Invariance [50.277959544420455]
  We develop EIGN, an architecture composed of novel direction-aware edge-level graph shift operators. EIGN outperforms prior work in edge-level tasks, for example, improving in RMSE on flow simulation tasks by up to 43.5%.
  arXiv  Detail & Related papers  (2024-10-22T12:12:43Z)
• Implicit Neural Representations and the Algebra of Complex Wavelets [36.311212480600794]
  Implicit neural representations (INRs) have arisen as useful methods for representing signals on Euclidean domains. By parameterizing an image as a multilayer perceptron (MLP) on Euclidean space, INRs effectively represent signals in a way that couples and spectral features of the signal that is not obvious in the usual discrete representation.
  arXiv  Detail & Related papers  (2023-10-01T02:01:28Z)
• Deep Equilibrium Assisted Block Sparse Coding of Inter-dependent Signals: Application to Hyperspectral Imaging [71.57324258813675]
  A dataset of inter-dependent signals is defined as a matrix whose columns demonstrate strong dependencies. A neural network is employed to act as structure prior and reveal the underlying signal interdependencies. Deep unrolling and Deep equilibrium based algorithms are developed, forming highly interpretable and concise deep-learning-based architectures.
  arXiv  Detail & Related papers  (2022-03-29T21:00:39Z)
• Meta-Learning Sparse Implicit Neural Representations [69.15490627853629]
  Implicit neural representations are a promising new avenue of representing general signals. Current approach is difficult to scale for a large number of signals or a data set. We show that meta-learned sparse neural representations achieve a much smaller loss than dense meta-learned models.
  arXiv  Detail & Related papers  (2021-10-27T18:02:53Z)
• 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)
• Hierarchical compressed sensing [5.39680014668952]
  Compressed sensing is a paradigm within signal processing that provides the means for recovering structured signals from linear measurements. We present recovery algorithms based on efficient hierarchical hard-thresholding. Building upon this machinery, we sketch practical applications of this framework in machine-type communications and quantum tomography.
  arXiv  Detail & Related papers  (2021-04-06T18:00:01Z)
• 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)
• Discriminative Singular Spectrum Classifier with Applications on Bioacoustic Signal Recognition [67.4171845020675]
  We present a bioacoustic signal classifier equipped with a discriminative mechanism to extract useful features for analysis and classification efficiently. Unlike current bioacoustic recognition methods, which are task-oriented, the proposed model relies on transforming the input signals into vector subspaces. The validity of the proposed method is verified using three challenging bioacoustic datasets containing anuran, bee, and mosquito species.
  arXiv  Detail & Related papers  (2021-03-18T11:01:21Z)
• 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)
• Activation Relaxation: A Local Dynamical Approximation to Backpropagation in the Brain [62.997667081978825]
  Activation Relaxation (AR) is motivated by constructing the backpropagation gradient as the equilibrium point of a dynamical system. Our algorithm converges rapidly and robustly to the correct backpropagation gradients, requires only a single type of computational unit, and can operate on arbitrary computation graphs.
  arXiv  Detail & Related papers  (2020-09-11T11:56:34Z)
• Data-Driven Symbol Detection via Model-Based Machine Learning [117.58188185409904]
  We review a data-driven framework to symbol detection design which combines machine learning (ML) and model-based algorithms. In this hybrid approach, well-known channel-model-based algorithms are augmented with ML-based algorithms to remove their channel-model-dependence. Our results demonstrate that these techniques can yield near-optimal performance of model-based algorithms without knowing the exact channel input-output statistical relationship.
  arXiv  Detail & Related papers  (2020-02-14T06:58:27Z)

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.