Recent Submissions

  • Icon

    Computing Optimal Shortcuts for Networks  [Presentation]

    Garijo Royo, Delia; Márquez Pérez, Alberto; Rodríguez, Natalia; Silveira, Rodrigo I. (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 ...
  • Icon

    Topological Homogeneity for Electron Microscopy Images  [Presentation]

    Molina Abril, Helena; Díaz del Río, Fernando; Guerrero Lebrero, María P.; Real Jurado, Pedro; Barcena, Guillermo; Braza, Verónica; Guerrero, Elisa; González, David; Galindo, Pedro L. (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 ...
  • Icon

    Topo-Geometric Filtration Scheme for Geometric Active Contours and Level Sets: Application to Cerebrovascular Segmentation  [Presentation]

    Molina Abril, Helena; Frangi, Alejandro F. (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 ...
  • Icon

    Multi-stage Biomarker Models for Progression Estimation in Alzheimer’s Disease  [Presentation]

    Schmidt-Richberg, Alexander; Guerrero, Ricardo; Ledig, Christian; Molina Abril, Helena; Frangi, Alejandro F.; Rueckert, Daniel (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 ...
  • Icon

    Homological Region Adjacency Tree for a 3D Binary Digital Image via HSF Model  [Presentation]

    Real Jurado, Pedro; Molina Abril, Helena; Díaz del Río, Fernando; Blanco Trejo, Sergio (Springer, 2019)
    Given a 3D binary digital image I, we define and compute an edge-weighted tree, called Homological Region Tree (or Hom-Tree, for short). It coincides, as unweighted graph, with the classical Region Adjacency Tree of ...
  • Icon

    Generating Second Order (Co)homological Information within AT-Model Context  [Presentation]

    Real Jurado, Pedro; Molina Abril, Helena; Díaz del Río, Fernando; Onchis, Darian M. (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 AT-model (Algebraic Topological Model) AT(C) of a finite cell complex C These ...
  • Icon

    Enhanced Parallel Generation of Tree Structures for the Recognition of 3D Images  [Presentation]

    Real Jurado, Pedro; Molina Abril, Helena; Díaz del Río, Fernando; Blanco Trejo, Sergio; Onchis, Darian M. (Springer, 2019)
    Segmentations of a digital object based on a connectivity criterion at n-xel or sub-n-xel level are useful tools in image topological analysis and recognition. Working with cell complex analogous of digital objects, an ...
  • Icon

    Computing the Component-Labeling and the Adjacency Tree of a Binary Digital Image in Near Logarithmic-Time  [Presentation]

    Díaz del Río, Fernando; Molina Abril, Helena; Real Jurado, Pedro (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 region-based representation where each ...
  • Icon

    Constant mean curvature surfaces in 3-dimensional Thurston geometries  [Presentation]

    Fernández Delgado, Isabel; Mira, Pablo (World Scientific, 2011)
    This is a survey on the global theory of constant mean curvature surfaces in Riemannian homogeneous 3-manifolds. These ambient 3-manifolds include the eight canonical Thurston 3-dimensional geometries, i.e. R3, H3, S3, ...
  • Icon

    Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets  [Presentation]

    Hartillo Hermoso, Isabel; Jiménez Cobano, J.M.; Ucha Enríquez, José María (Springer, 2018)
    We explain how to compute all the solutions of a nonlinear integer problem using the algebraic test-sets associated to a suitable linear subproblem. These test-sets are obtained using Gröbner bases. The main advantage ...
  • Icon

    Matemática Discreta con GeoGebra  [xmlui.item.others]

    Falcón Ganfornina, Raúl Manuel (2014-09)
    No consta
  • Icon

    Spatiotemporal Barcodes for Image Sequence Analysis  [Presentation]

    González Díaz, Rocío; Jiménez Rodríguez, María José; Medrano Garfia, Belén (Springer, 2015)
    Taking as input a time-varying sequence of two-dimensional (2D) binary images, we develop an algorithm for computing a spatiotemporal 0–barcode encoding lifetime of connected components on the image sequence over time. ...
  • Icon

    Encoding Specific 3D Polyhedral Complexes Using 3D Binary Images  [Presentation]

    González Díaz, Rocío; Jiménez Rodríguez, María José; Medrano Garfia, Belén (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 “well-composed” polyhedral complex P(I), homotopy ...
  • Icon

    Designing a Topological Algorithm for 3D Activity Recognition  [Presentation]

    Jiménez Rodríguez, María José; Medrano Garfia, Belén; Monaghan, David S.; O'Connor, Noel E. (Springer, 2016)
    Voxel carving is a non-invasive and low-cost 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 ...
  • Icon

    Separating Topological Noise from Features Using Persistent Entropy  [Presentation]

    Atienza Martínez, María Nieves; González Díaz, Rocío; Rucco, Matteo (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 ...
  • Icon

    Characterising epithelial tissues using persistent entropy  [Presentation]

    Atienza Martínez, María Nieves; Escudero, L.M.; Jiménez Rodríguez, María José; Soriano Trigueros, Manuel (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 ...
  • Icon

    A Heuristic Procedure with Guided Reproduction for Constructing Cocyclic Hadamard Matrices  [Presentation]

    Álvarez Solano, Víctor; Frau García, María Dolores; Osuna Lucena, Amparo (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 ...
  • Icon

    Searching for partial Hadamard matrices  [Presentation]

    Álvarez Solano, Víctor; Armario Sampalo, José Andrés; Frau García, María Dolores; Gudiel Rodríguez, Félix; Güemes Alzaga, María Belén; Martín García, Elena; Osuna Lucena, Amparo (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. ...
  • Icon

    Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t  [Presentation]

    Álvarez Solano, Víctor; Armario Sampalo, José Andrés; Frau García, María Dolores; Gudiel Rodríguez, Félix; Osuna Lucena, Amparo (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 ...
  • Icon

    Error correcting codes from quasi-Hadamard matrices  [Presentation]

    Álvarez Solano, Víctor; Armario Sampalo, José Andrés; Frau García, María Dolores; Martín García, Elena; Osuna Lucena, Amparo (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 ...

View more