Ponencias (Matemática Aplicada I)
Recent Submissions

Computing Optimal Shortcuts for Networks [Presentation]
(Dagsthul Publishing, 2018)We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Questions of this type have received ...

Topological Homogeneity for Electron Microscopy Images [Presentation]
(Springer, 2019)In this paper, the concept of homogeneity is defined, from a topological perspective, in order to analyze how uniform is the material composition in 2D electron microscopy images. Topological multiresolution parameters ...

TopoGeometric Filtration Scheme for Geometric Active Contours and Level Sets: Application to Cerebrovascular Segmentation [Presentation]
(Springer, 2014)One of the main problems of the existing methods for the segmentation of cerebral vasculature is the appearance in the segmentation result of wrong topological artefacts such as the kissing vessels. In this paper, a new ...

Multistage Biomarker Models for Progression Estimation in Alzheimer’s Disease [Presentation]
(Springer, 2015)The estimation of disease progression in Alzheimer’s disease (AD) based on a vector of quantitative biomarkers is of high interest to clinicians, patients, and biomedical researchers alike. In this work, quantile ...

Homological Region Adjacency Tree for a 3D Binary Digital Image via HSF Model [Presentation]
(Springer, 2019)Given a 3D binary digital image I, we define and compute an edgeweighted tree, called Homological Region Tree (or HomTree, for short). It coincides, as unweighted graph, with the classical Region Adjacency Tree of ...

Generating Second Order (Co)homological Information within ATModel Context [Presentation]
(Springer, 2019)In this paper we design a new family of relations between (co)homology classes, working with coefficients in a field and starting from an ATmodel (Algebraic Topological Model) AT(C) of a finite cell complex C These ...

Enhanced Parallel Generation of Tree Structures for the Recognition of 3D Images [Presentation]
(Springer, 2019)Segmentations of a digital object based on a connectivity criterion at nxel or subnxel level are useful tools in image topological analysis and recognition. Working with cell complex analogous of digital objects, an ...

Computing the ComponentLabeling and the Adjacency Tree of a Binary Digital Image in Near LogarithmicTime [Presentation]
(Springer, 2019)Connected component labeling (CCL) of binary images is one of the fundamental operations in real time applications. The adjacency tree (AdjT) of the connected components offers a regionbased representation where each ...

Constant mean curvature surfaces in 3dimensional Thurston geometries [Presentation]
(World Scientific, 2011)This is a survey on the global theory of constant mean curvature surfaces in Riemannian homogeneous 3manifolds. These ambient 3manifolds include the eight canonical Thurston 3dimensional geometries, i.e. R3, H3, S3, ...

Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic TestSets [Presentation]
(Springer, 2018)We explain how to compute all the solutions of a nonlinear integer problem using the algebraic testsets associated to a suitable linear subproblem. These testsets are obtained using Gröbner bases. The main advantage ...

Spatiotemporal Barcodes for Image Sequence Analysis [Presentation]
(Springer, 2015)Taking as input a timevarying sequence of twodimensional (2D) binary images, we develop an algorithm for computing a spatiotemporal 0–barcode encoding lifetime of connected components on the image sequence over time. ...

Encoding Specific 3D Polyhedral Complexes Using 3D Binary Images [Presentation]
(Springer, 2016)We build upon the work developed in [4] in which we presented a method to “locally repair” the cubical complex Q(I) associated to a 3D binary image I, to obtain a “wellcomposed” polyhedral complex P(I), homotopy ...

Designing a Topological Algorithm for 3D Activity Recognition [Presentation]
(Springer, 2016)Voxel carving is a noninvasive and lowcost technique that is used for the reconstruction of a 3D volume from images captured from a set of cameras placed around the object of interest. In this paper we propose a method ...

Separating Topological Noise from Features Using Persistent Entropy [Presentation]
(Springer, 2016)Topology is the branch of mathematics that studies shapes and maps among them. From the algebraic definition of topology a new set of algorithms have been derived. These algorithms are identified with “computational ...

Characterising epithelial tissues using persistent entropy [Presentation]
(Springer, 2019)In this paper, we apply persistent entropy, a novel topological statis tic, for characterization of images of epithelial tissues. We have found out that persistent entropy is able to summarize topological and geomet ric ...

A Heuristic Procedure with Guided Reproduction for Constructing Cocyclic Hadamard Matrices [Presentation]
(Springer, 2009)A genetic algorithm for constructing cocyclic Hadamard matrices over a given group is described. The novelty of this algorithm is the guided heuristic procedure for reproduction, instead of the classical crossover and ...

Searching for partial Hadamard matrices [Presentation]
(Universidade de Santiago de Compostela, Servicio de Publicaciones, 2010)Three algorithms looking for pretty large partial Hadamard ma trices are described. Here “large” means that hopefully about a third of a Hadamard matrix (which is the best asymptotic result known so far, [8]) is achieved. ...

Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t [Presentation]
(Springer, 2009)A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new search space adopt the form of a forest ...

Error correcting codes from quasiHadamard matrices [Presentation]
(Springer, 2007)Levenshtein described in [5] a method for constructing error correcting codes which meet the Plotkin bounds, provided suitable Ha damard matrices exist. Uncertainty about the existence of Hadamard matrices on all orders ...