SearcharxivSearch

arXiv subjects

Rocio Gonzalez-Diaz

Publications and source records attributed to Rocio Gonzalez-Diaz.

At least 19 recordsLinked to original sources

Persistent Entropy Transform: An entropy-based descriptor for topological data analysis

Persistent entropy provides a compact summary of persistence diagrams, but discards geometric information inherent to the data. This limitation creates a gap between scalar summaries, which are computationally efficient but geometrically coarse, and directional topological transforms, which are expressive but high-dimensional and computationally demanding. In this work, we introduce the Persistent Entropy Transform (PET), a novel directional topological descriptor which can be interpreted as an entropy-based compression of directional topological transforms. We establish basic theoretical properties of PET. In particular, we prove translation invariance, scale invariance under positive uniform scalings, and orthogonal equivariance. Empirically, we use synthetic shapes to assess directional sensitivity, consistency with rotational equivariance, robustness under controlled perturbations, and dependence on directional sampling density. In addition, we test the novel tool on two real time-series benchmark datasets, the TwoLead- ECG and the MIT-BIH, to provide a proof of concept showing that PET embeddings can be used succesfully as compact feature vectors on real time-series benchmarks. These experiments support and validate PET as a compact and computationally tractable descriptor.

math.GN

L-fuzzy simplicial homology

Simplicial homology is a classical tool that assigns a sequence of modules to a simplicial complex, providing invariants for the study of its topological properties. In this article, we introduce the notion of L-fuzzy simplicial homology, a generalization of simplicial homology for L-fuzzy subcomplexes, in which each simplex is assigned a value from a completely distributive lattice L. We present its definition and main properties and describe methods to compute its structure. In addition, we interpret filtrations over a poset and chromatic datasets in this setting, opening a door to further applications in topological data analysis.

math.AT

Barycentric Neural Networks and Length-Weighted Persistent Entropy Loss: A Green Geometric and Topological Framework for Function Approximation

While artificial neural networks are known as universal approximators for continuous functions, many modern approaches rely on overparameterized architectures with high computational cost. In this work, we introduce the Barycentric Neural Network (BNN): a compact shallow architecture that encodes both structure and parameters through a fixed set of base points and their associated barycentric coordinates. We show that the BNN enables the exact representation of continuous piecewise linear functions (CPLFs), ensuring strict continuity across segments. Given that any continuous function on a compact domain can be uniformly approximated by CPLFs, the BNN emerges as a flexible and interpretable tool for function approximation. To enhance geometric fidelity in low-resource scenarios, such as those with few base points to create BNNs or limited training epochs, we propose length-weighted persistent entropy (LWPE): a stable variant of persistent entropy. Our approach integrates the BNN with a loss function based on LWPE to optimize the base points that define the BNN, rather than its internal parameters. Experimental results show that our approach achieves superior and faster approximation performance compared to standard losses (MSE, RMSE, MAE and LogCosh), offering a computationally sustainable alternative for function approximation.

cs.LG

The Induced Matching Distance: A Novel Topological Metric with Applications in Robotics

This paper introduces the induced matching distance, a novel topological metric designed to compare discrete structures represented by a symmetric non-negative function. We apply this notion to analyze agent trajectories over time. We use dynamic time warping to measure trajectory similarity and compute the 0-dimensional persistent homology to identify relevant connected components, which, in our context, correspond to groups of similar trajectories. To track the evolution of these components across time, we compute induced matching distances, which preserve the coherence of their dynamic behavior. We then obtain a 1-dimensional signal that quantifies the consistency of trajectory groups over time. Our experiments demonstrate that our approach effectively differentiates between various agent behaviors, highlighting its potential as a robust tool for topological analysis in robotics and related fields.

math.AT

Topological Quality of Subsets via Persistence Matching Diagrams

Data quality is crucial for the successful training, generalization and performance of machine learning models. We propose to measure the quality of a subset concerning the dataset it represents, using topological data analysis techniques. Specifically, we define the persistence matching diagram, a topological invariant derived from combining embeddings with persistent homology. We provide an algorithm to compute it using minimum spanning trees. Also, the invariant allows us to understand whether the subset ``represents well" the clusters from the larger dataset or not, and we also use it to estimate bounds for the Hausdorff distance between the subset and the complete dataset. In particular, this approach enables us to explain why the chosen subset is likely to result in poor performance of a supervised learning model.

math.AT

Properties and Stability of Persistence Matching Diagrams

We introduce persistence matching diagrams induced by set mappings of metric spaces, based on 0-persistent homology of Vietoris-Rips filtrations. Also, we present a geometric definition of the persistence matching diagram that is more intuitive than the algebraic one. In addition, we show that such matching diagrams encapsulate the information of persistence morphism images, kernels and cokernels induced by embeddings. The main result is a stability theorem for persistence matching diagrams induced by embeddings. At the end, we adapt our stability result for set injections (not embeddings) of finite metric spaces.

math.AT

SIMAP: A simplicial-map layer for neural networks

In this paper, we present SIMAP, a novel layer integrated into deep learning models, aimed at enhancing the interpretability of the output. The SIMAP layer is an enhanced version of Simplicial-Map Neural Networks (SMNNs), an explainable neural network based on support sets and simplicial maps (functions used in topology to transform shapes while preserving their structural connectivity). The novelty of the methodology proposed in this paper is two-fold: Firstly, SIMAP layers work in combination with other deep learning architectures as an interpretable layer substituting classic dense final layers. Secondly, unlike SMNNs, the support set is based on a fixed maximal simplex, the barycentric subdivision being efficiently computed with a matrix-based multiplication algorithm.

cs.LG

Trainable and Explainable Simplicial Map Neural Networks

Simplicial map neural networks (SMNNs) are topology-based neural networks with interesting properties such as universal approximation ability and robustness to adversarial examples under appropriate conditions. However, SMNNs present some bottlenecks for their possible application in high-dimensional datasets. First, SMNNs have precomputed fixed weight and no SMNN training process has been defined so far, so they lack generalization ability. Second, SMNNs require the construction of a convex polytope surrounding the input dataset. In this paper, we overcome these issues by proposing an SMNN training procedure based on a support subset of the given dataset and replacing the construction of the convex polytope by a method based on projections to a hypersphere. In addition, the explainability capacity of SMNNs and an effective implementation are also newly introduced in this paper.

cs.LG

Summary and Distance between Sets of Texts based on Topological Data Analysis

In this paper, we use topological data analysis (TDA) tools such as persistent homology, persistent entropy and bottleneck distance, to provide a {\it TDA-based summary} of any given set of texts and a general method for computing a distance between any two literary styles, authors or periods. To this aim, deep-learning word-embedding techniques are combined with these tools in order to study the topological properties of texts embedded in a metric space. As a case of study, we use the written texts of three poets of the Spanish Golden Age: Francisco de Quevedo, Luis de Góngora and Lope de Vega. As far as we know, this is the first time that word embedding, bottleneck distance, persistent homology and persistent entropy are used together to characterize texts and to compare different literary styles.

cs.CL

Emotion recognition in talking-face videos using persistent entropy and neural networks

The automatic recognition of a person's emotional state has become a very active research field that involves scientists specialized in different areas such as artificial intelligence, computer vision or psychology, among others. Our main objective in this work is to develop a novel approach, using persistent entropy and neural networks as main tools, to recognise and classify emotions from talking-face videos. Specifically, we combine audio-signal and image-sequence information to compute a topology signature(a 9-dimensional vector) for each video. We prove that small changes in the video produce small changes in the signature. These topological signatures are used to feed a neural network to distinguish between the following emotions: neutral, calm, happy, sad, angry, fearful, disgust, and surprised. The results reached are promising and competitive, beating the performance reached in other state-of-the-art works found in the literature.

cs.CV

Topology-based Representative Datasets to Reduce Neural Network Training Resources

One of the main drawbacks of the practical use of neural networks is the long time required in the training process. Such a training process consists of an iterative change of parameters trying to minimize a loss function. These changes are driven by a dataset, which can be seen as a set of labelled points in an n-dimensional space. In this paper, we explore the concept of are representative dataset which is a dataset smaller than the original one, satisfying a nearness condition independent of isometric transformations. Representativeness is measured using persistence diagrams (a computational topology tool) due to its computational efficiency. We prove that the accuracy of the learning process of a neural network on a representative dataset is "similar" to the accuracy on the original dataset when the neural network architecture is a perceptron and the loss function is the mean squared error. These theoretical results accompanied by experimentation open a door to reducing the size of the dataset to gain time in the training process of any neural network.

cs.LG

Two-hidden-layer Feedforward Neural Networks are Universal Approximators: A Constructive Approach

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 feedforward network which approximates the function. Such result proves the existence, but it does not provide a method for finding it. In this paper, a constructive approach to the proof of this property is given for the case of two-hidden-layer feedforward networks. This approach is based on an approximation of continuous functions by simplicial maps. Once a triangulation of the space is given, a concrete architecture and set of weights can be obtained. The quality of the approximation depends on the refinement of the covering of the space by simplicial complexes.

cs.LG

An algorithm to compute minimal Sullivan algebras

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 as (co)homology, cup products on cohomology and persistent homology. Taking as input a (non-minimal) Sullivan algebra $A$ with an ordered finite set of generators preserving the filtration defined on $A$, we obtain as output a minimal Sullivan algebra with the same rational cohomology as $A$.

math.AT

Topological signature for periodic motion recognition

In this paper, we present an algorithm that computes the topological signature for a given periodic motion sequence. Such signature consists of a vector obtained by persistent homology which captures the topological and geometric changes of the object that models the motion. Two topological signatures are compared simply by the angle between the corresponding vectors. With respect to gait recognition, we have tested our method using only the lowest fourth part of the body's silhouette. In this way, the impact of variations in the upper part of the body, which are very frequent in real scenarios, decreases considerably. We have also tested our method using other periodic motions such as running or jumping. Finally, we formally prove that our method is robust to small perturbations in the input data and does not depend on the number of periods contained in the periodic motion sequence.

cs.CV

Topological Tracking of Connected Components in Image Sequences

Persistent homology provides information about the lifetime of homology classes along a filtration of cell complexes. Persistence barcode is a graphical representation of such information. A filtration might be determined by time in a set of spatiotemporal data, but classical methods for computing persistent homology do not respect the fact that we can not move backwards in time. In this paper, taking as input a time-varying sequence of two-dimensional (2D) binary digital images, we develop an algorithm for encoding, in the so-called {\it spatiotemporal barcode}, lifetime of connected components (of either the foreground or background) that are moving in the image sequence over time (this information may not coincide with the one provided by the persistence barcode). This way, given a connected component at a specific time in the sequence, we can track the component backwards in time until the moment it was born, by what we call a {\it spatiotemporal path}. The main contribution of this paper with respect to our previous works lies in a new algorithm that computes spatiotemporal paths directly, valid for both foreground and background and developed in a general context, setting the ground for a future extension for tracking higher dimensional topological features in $nD$ binary digital image sequences.

cs.CV

Persistent Entropy for Separating Topological Features from Noise in Vietoris-Rips Complexes

Persistent homology studies the evolution of k-dimensional holes along a nested sequence of simplicial complexes (called a filtration). The set of bars (i.e. intervals) representing birth and death times of k-dimensional holes along such sequence is called the persistence barcode. k-Dimensional holes with short lifetimes are informally considered to be "topological noise", and those with long lifetimes are considered to be "topological features" associated to the filtration. Persistent entropy is defined as the Shannon entropy of the persistence barcode of a given filtration. In this paper we present new important properties of persistent entropy of Cech and Vietoris-Rips filtrations. Among the properties, we put a focus on the stability theorem that allows to use persistent entropy for comparing persistence barcodes. Later, we derive a simple method for separating topological noise from features in Vietoris-Rips filtrations.

cs.OH

A new topological entropy-based approach for measuring similarities among piecewise linear functions

In this paper we present a novel methodology based on a topological entropy, the so-called persistent entropy, for addressing the comparison between discrete piecewise linear functions. The comparison is certified by the stability theorem for persistent entropy. The theorem is used in the implementation of a new algorithm. The algorithm transforms a discrete piecewise linear function into a filtered simplicial complex that is analyzed with persistent homology and persistent entropy. Persistent entropy is used as discriminant feature for solving the supervised classification problem of real long length noisy signals of DC electrical motors. The quality of classification is stated in terms of the area under receiver operating characteristic curve (AUC=94.52%).

cs.DM