Buscar
Mostrando ítems 31-40 de 51
Artículo
Chain Homotopies for Object Topological Representations
(2011)
This paper presents a set of tools to compute topological information of simplicial complexes, tools that are applicable to extract topological information from digital pictures. A simplicial complex is encoded in a ...
Artículo
A combinatorial method for computing Steenrod squares
(Elsevier, 1999)
We present here a combinatorial method for computing Steenrod squares of a simplicial set X. This method is essentially based on the determination of explicit formulae for the component morphisms of a higher diagonal ...
Artículo
Strong Euler well-composedness
(Springer, 2021)
In this paper, we define a new flavour of well-composedness, called strong Euler well composedness. In the general setting of regular cell complexes, a regular cell complex of dimension n is strongly Euler well-composed ...
Artículo
Two-hidden-layer Feedforward Neural Networks are Universal Approximators: A Constructive Approach
(Cornell University, 2019)
It is well known that Artificial Neural Networks are universal approximators. The classical result proves that, given a continuous function on a compact set on an n-dimensional space, then there exists a one-hidden-layer ...
Artículo
Representative datasets for neural networks
(Elsevier, 2018)
Neural networks present big popularity and success in many fields. The large training time process problem is a very important task nowadays. In this paper, a new approach to get over this issue based on reducing dataset ...
Artículo
Topological tracking of connected components in image sequences
(Elsevier, 2018)
Persistent homology provides information about the lifetime of homology classes along a filtration of cell complexes. Persistence barcode is a graphi- cal representation of such information. A filtration might be determined ...
Artículo
Invariant representative cocycles of cohomology generators using irregular graph pyramids
(2011)
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology ...
Artículo
Persistence Partial Matchings Induced by Morphisms between Persistence Modules
(Cornell University, 2021)
The notion of persistence partial matching, as a generalization of partial matchings between persistence modules, is introduced. We study how to obtain a persistence partial matching Gf , and a partial matching Mf , ...
Artículo
An algorithm to compute minimal Sullivan algebras
(Cornell University, 2019)
In this note, we give an algorithm that starting with a Sullivan algebra gives us its minimal model. This algorithm is a kind of modified AT-model algorithm used to compute in the past other kinds of topology information such ...
Artículo
Persistent-homology-based gait recognition
(Cornell University, 2017)
Gait recognition is an important biometric technique for video surveillance tasks, due to the advantage of using it at distance. In this paper, we present a persistent homology-based method to extract topological features ...