Spectral Flow on the Manifold of SPD Matrices for Multimodal Data Processing

• URL: http://arxiv.org/abs/2009.08062v2
• Date: Wed, 2 Feb 2022 09:33:38 GMT
• Title: Spectral Flow on the Manifold of SPD Matrices for Multimodal Data Processing
• Authors: Ori Katz, Roy R. Lederman and Ronen Talmon
• Abstract summary: We consider data acquired by multimodal sensors capturing complementary aspects and features of a measured phenomenon. We focus on a scenario in which the measurements share mutual sources of variability but might also be contaminated by other measurement-specific sources.
• Score: 17.162497914078322
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we consider data acquired by multimodal sensors capturing complementary aspects and features of a measured phenomenon. We focus on a scenario in which the measurements share mutual sources of variability but might also be contaminated by other measurement-specific sources such as interferences or noise. Our approach combines manifold learning, which is a class of nonlinear data-driven dimension reduction methods, with the well-known Riemannian geometry of symmetric and positive-definite (SPD) matrices. Manifold learning typically includes the spectral analysis of a kernel built from the measurements. Here, we take a different approach, utilizing the Riemannian geometry of the kernels. In particular, we study the way the spectrum of the kernels changes along geodesic paths on the manifold of SPD matrices. We show that this change enables us, in a purely unsupervised manner, to derive a compact, yet informative, description of the relations between the measurements, in terms of their underlying components. Based on this result, we present new algorithms for extracting the common latent components and for identifying common and measurement-specific components.

Related papers

• Product Geometries on Cholesky Manifolds with Applications to SPD Manifolds [65.04845593770727]
  We present two new metrics on the Symmetric Positive Definite (SPD) manifold via the Cholesky manifold. Our metrics are easy to use, computationally efficient, and numerically stable.
  arXiv  Detail & Related papers  (2024-07-02T18:46:13Z)
• Partial Symmetry Detection for 3D Geometry using Contrastive Learning with Geodesic Point Cloud Patches [10.48309709793733]
  We propose to learn rotation, reflection, translation and scale invariant local shape features for geodesic point cloud patches. We show that our approach is able to extract multiple valid solutions for this ambiguous problem. We incorporate the detected symmetries together with a region growing algorithm to demonstrate a downstream task.
  arXiv  Detail & Related papers  (2023-12-13T15:48:50Z)
• Learning Radio Environments by Differentiable Ray Tracing [56.40113938833999]
  We introduce a novel gradient-based calibration method, complemented by differentiable parametrizations of material properties, scattering and antenna patterns. We have validated our method using both synthetic data and real-world indoor channel measurements, employing a distributed multiple-input multiple-output (MIMO) channel sounder.
  arXiv  Detail & Related papers  (2023-11-30T13:50:21Z)
• The Fisher-Rao geometry of CES distributions [50.50897590847961]
  The Fisher-Rao information geometry allows for leveraging tools from differential geometry. We will present some practical uses of these geometric tools in the framework of elliptical distributions.
  arXiv  Detail & Related papers  (2023-10-02T09:23:32Z)
• Oracle-Preserving Latent Flows [58.720142291102135]
  We develop a methodology for the simultaneous discovery of multiple nontrivial continuous symmetries across an entire labelled dataset. The symmetry transformations and the corresponding generators are modeled with fully connected neural networks trained with a specially constructed loss function. The two new elements in this work are the use of a reduced-dimensionality latent space and the generalization to transformations invariant with respect to high-dimensional oracles.
  arXiv  Detail & Related papers  (2023-02-02T00:13:32Z)
• Unsupervised Learning Discriminative MIG Detectors in Nonhomogeneous Clutter [0.8984888893275712]
  Principal component analysis (PCA) maps high-dimensional data into a lower-dimensional space maximizing the data variance. Inspired by the principle of PCA, a novel type of learning discriminative matrix information geometry (MIG) detectors are developed. Three discriminative MIG detectors are illustrated with respect to different geometric measures.
  arXiv  Detail & Related papers  (2022-04-24T13:50:05Z)
• Geometric variational inference [0.0]
  Variational Inference (VI) or Markov-Chain Monte-Carlo (MCMC) techniques are used to go beyond point estimates. This work proposes geometric Variational Inference (geoVI), a method based on Riemannian geometry and the Fisher information metric. The distribution, expressed in the coordinate system induced by the transformation, takes a particularly simple form that allows for an accurate variational approximation.
  arXiv  Detail & Related papers  (2021-05-21T17:18:50Z)
• A Unifying and Canonical Description of Measure-Preserving Diffusions [60.59592461429012]
  A complete recipe of measure-preserving diffusions in Euclidean space was recently derived unifying several MCMC algorithms into a single framework. We develop a geometric theory that improves and generalises this construction to any manifold.
  arXiv  Detail & Related papers  (2021-05-06T17:36:55Z)
• Learning Flat Latent Manifolds with VAEs [16.725880610265378]
  We propose an extension to the framework of variational auto-encoders, where the Euclidean metric is a proxy for the similarity between data points. We replace the compact prior typically used in variational auto-encoders with a recently presented, more expressive hierarchical one. We evaluate our method on a range of data-sets, including a video-tracking benchmark.
  arXiv  Detail & Related papers  (2020-02-12T09:54:52Z)
• Inverse Learning of Symmetries [71.62109774068064]
  We learn the symmetry transformation with a model consisting of two latent subspaces. Our approach is based on the deep information bottleneck in combination with a continuous mutual information regulariser. Our model outperforms state-of-the-art methods on artificial and molecular datasets.
  arXiv  Detail & Related papers  (2020-02-07T13:48:52Z)

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.