Related papers: Connected Components on Lie Groups and Application…
In this paper we consider undirected graphs with no loops and multiple edges, consisting of k connected components. In these cases, it is well known that one can find a numbering of the vertices such that the adjacency matrix A is block…
We survey the application of a relatively new branch of statistical physics--"community detection"-- to data mining. In particular, we focus on the diagnosis of materials and automated image segmentation. Community detection describes the…
Diffractive lenses have recently been applied to the domain of multispectral imaging in the X-ray and UV regimes where they can achieve very high resolution as compared to reflective and refractive optics. Conventionally, spectral…
The goal of this diploma thesis is to give a detailed description of Kirillov's Orbit Method for the case of compact connected Lie groups. The theory of Kirillov aims at finding all irreducible unitary representations of a given Lie group…
Despite the widespread application of latent factor analysis, existing methods suffer from the following weaknesses: requiring the number of factors to be known, lack of theoretical guarantees for learning the model structure, and…
Group lattices (Cayley digraphs) of a discrete group are in natural correspondence with differential calculi on the group. On such a differential calculus geometric structures can be introduced following general recipes of noncommutative…
In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the…
We carry an intrinsic approach to the study of the connectedness of the moduli space $\mathcal{M}_G$ of $G$-Higgs bundles, over a compact Riemann surface, when $G$ is a complex reductive (not necessarily connected) Lie group. We prove that…
Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint…
The Weisfeiler-Leman procedure is a widely-used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Meanwhile, a fundamental tool in structural graph theory, which…
The maximal complexifications adapted to the Levi Civita connection for a distinguished one-parameter family of left-invariant metrics on a real semisimple Lie group G are determined. For G = SL(2,R) their realizations as invariant Riemann…
Stereo matching estimates the disparity between a rectified image pair, which is of great importance to depth sensing, autonomous driving, and other related tasks. Previous works built cost volumes with cross-correlation or concatenation of…
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. In practice it is not uncommon to obtain two topologically distinct trees for the same set of species, and this motivates the use of distance measures to…
The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modification problem centered around transforming a given graph into…
Invariance and equivariance to geometrical transformations have proven to be very useful inductive biases when training (convolutional) neural network models, especially in the low-data regime. Much work has focused on the case where the…
An effective way to model the complex real world is to view the world as a composition of basic components of objects and transformations. Although humans through development understand the compositionality of the real world, it is…
In image set classification, a considerable advance has been made by modeling the original image sets by second order statistics or linear subspace, which typically lie on the Riemannian manifold. Specifically, they are Symmetric Positive…
A result from Gromov ensures the existence of a contact structure on any connected non-compact odd dimensional Lie group. But in general such structures are not invariant under left translations of the Lie group. The problem of finding…
We elaborate on a general method that we recently introduced for characterizing the "natural" structures in complex physical systems via a multiscale network based approach for the data mining of such structures. The approach is based on…
We introduce a technique that is capable to filter out information from complex systems, by mapping them to networks, and extracting a subgraph with the strongest links. This idea is based on the Minimum Spanning Tree, and it can be applied…