Related papers: A computer based classification of caps in PG(5,2)
Discrete point cloud objects lack sufficient shape descriptors of 3D geometries. In this paper, we present a novel method for aggregating hypothetical curves in point clouds. Sequences of connected points (curves) are initially grouped by…
Capsule networks (CapsNets) have recently shown promise to excel in most computer vision tasks, especially pertaining to scene understanding. In this paper, we explore CapsNet's capabilities in optical flow estimation, a task at which…
Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.
This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…
Most image-search approaches today are based on the text based tags associated with the images which are mostly human generated and are subject to various kinds of errors. The results of a query to the image database thus can often be…
LiDAR-based 3D object detection is an important task for autonomous driving and current approaches suffer from sparse and partial point clouds of distant and occluded objects. In this paper, we propose a novel two-stage approach, namely…
Recent work on deep clustering has found new promising methods also for constrained clustering problems. Their typically pairwise constraints often can be used to guide the partitioning of the data. Many problems however, feature…
We propose a similarity-based method, using the similarity between nodes, to address the problem of classification in partially labeled networks. The basic assumption is that two nodes are more likely to be categorized into the same class…
Capsule networks (see e.g. Hinton et al., 2018) aim to encode knowledge and reason about the relationship between an object and its parts. In this paper we specify a \emph{generative} model for such data, and derive a variational algorithm…
Every polygon $P$ can be companioned by a cap polygon $\hat P$ such that $P$ and $\hat P$ serve as two parts of the boundary surface of a polyhedron $V$. Pairs of vertices on $P$ and $\hat P$ are identified successively to become vertices…
In this paper we give a complete classification of cyclically graded semisimple Lie algebras that afford cuspidal character sheaves and determine the support of the cuspidal character sheaves. This constitutes a major step towards the…
In this paper we give a complete characterization of the statistical equivalence classes of CEGs and of staged trees. We are able to show that all graphical representations of the same model share a common polynomial description. Then,…
We classify all compact simply connected biquotients of dimension 4 and 5. In particular, all pairs of groups $(G,H)$ and embeddings $H\rightarrow G\times G$ giving rise to a particular biquotient are classified.
We study edge-to-edge tilings of the sphere by edge congruent pentagons, under the assumption that there are tiles with all vertices having degree 3. We develop the technique of neighborhood tilings and apply the technique to completely…
In this paper, we consider a simple class of stratified spaces -- 2-complexes. We present an algorithm that learns the abstract structure of an embedded 2-complex from a point cloud sampled from it. We use tools and inspiration from…
Terrestrial laser scanning (TLS) can obtain tree point cloud with high precision and high density. Efficient classification of wood points and leaf points is essential to study tree structural parameters and ecological characteristics. By…
The rapid increase in data on galaxy images at low and high redshift calls for re-examination of the classification schemes and for new automatic objective methods. Here we present a classification method by Artificial Neural Networks. We…
We give a complete derived equivalence classification of all nonstandard representation-infinite domestic selfinjective algebras over an algebraically closed field. As a consequence, also a complete stable equivalence classification of…
We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…
Integrated Gradients (IG) and PatternAttribution (PA) are two established explainability methods for neural networks. Both methods are theoretically well-founded. However, they were designed to overcome different challenges. In this work,…