Topological representations of binary digital images usually take into consideration different adjacency types between ...

The purpose of this work is to advance in the computational study of connectome graphs from a topological point of view. ...

Underwater imaging has been present for many decades due to its relevance in vision and navigation systems. In recent ...

Los autómatas celulares se componen de un conjunto de celdas (generalmente simples) interactuantes que evolucionan en pasos ...

Given an nD digital image I based on cubical n-xel, to fully characterize the degree of internal topological dissimilarity ...

A novel, flexible (non-unique) and topologically consistent representation called CRIT (Contour-Region incidence Tree) for ...

A new algorithm for computing the α-tree hierarchical repre sentation of a grey-scale digital image is presented here. The ...

In this paper, we propose an analytical rapid method to estimate the endocardial borders of the left ventricular walls on ...

Taking advantage of the topological and isotopic properties of binary digital images, we present here anew algorithm for ...

In this work, a new method to determine and correct the linear drift for any crystalline orientation in a single-column-resolved ...

In this paper we develop a new computational technique called boundary scale-space theory. This tech- nique is based on ...

Segmentations of a digital object based on a connectivity criterion at n-xel or sub-n-xel level are useful tools in image ...

In this paper we design a new family of relations between (co)homology classes, working with coefficients in a field and ...

In this paper, the concept of homogeneity is defined, from a topological perspective, in order to analyze how uniform is ...

Given a 3D binary digital image I, we define and compute an edge-weighted tree, called Homological Region Tree (or ...

Connected component labeling (CCL) of binary images is one of the fundamental operations in real time applications. The ...

In this paper, we make use of the topological invariants of 2D images for an accelerated training and an improved recognition ...

Fractal dimension is a powerful tool employed as a measurement of geometric aspects. In this work we propose a method of ...

Un objeto digital es un conjunto de n-xels en de una imagen digital n-dimensional. El estudio de la conectividad de estos ...

The paper provides a theorem for the characteriza- tion of numerical stability of spline-type systems. These systems are ...

This is an experimental paper in which we introduce the possibility to analyze and to synthesize 3D medical images by using ...

An appropriate generalization of the classical notion of abstract cell complex, called primal-dual abstract cell complex ...

Discrete gradient vector fields are combinatorial structures that can be used for accelerating the homology computation ...

A design of a parallel algorithm for labeling color flat zones (precisely, 4-connected components) of a gray-level or color ...

Homology theory formalizes the concept of hole in a space. For a given subset of the Euclidean space, we define a sequence ...

In this paper, a homotopy-based method is employed for the recovery of speech recordings from missing or corrupted samples ...

In this paper, we explore the possibility of applying the anisotropic generalized Hough transform (AGHT) enhanced with a ...

Image processing is a fundamental operation in many real time applications, where lots of parallelism can be extracted. ...

To prevent the release of large quantities of CO2 into the atmosphere, carbon capture and storage (CCS) represents a ...

Given a binary object (2D or 3D), its Betti numbers characterize the number of holes in each dimension. They are obtained ...

In [14], a topologically consistent framework to support parallel topological analysis and recognition for2 D digital ...

Betti numbers are topological invariants that count the number of holes of each dimension in a space. Cubical complexes ...

In [18], a membrane parallel theoretical framework for computing (co)homology information of fore- ground or background ...

We introduce algorithms for the computation of homology, cohomology, and related operations on cubical cell complexes, ...

In this paper, we propose a bio-inspired membrane computational framework for constructing discrete Morse complexes for ...

Provided that a cohomological model for G is known, we describe a method for constructing a basis for n-cocycles over G, ...

This paper introduces a new kind of skeleton for binary volumes called the cellular skeleton. This skeleton is not a subset ...

The paper analyzes the connectivity information (more precisely, numbers of tunnels and their homological (co)cycle ...

A design and implementation of a parallel algorithm for computing the Region-Adjacency Tree of a given segmentation of a ...

In this work, a multiple generalised anisotropic Hough transform (AGHT) is used to detect the mandibular canal in dental ...

This paper analyses the topological information of a digital object O under a combined combinatorial-algebraic point of ...

n-dimensional discrete objects can be interpreted as cubical complexes which are suitable for the study of their homology ...

Tout objet discret n-dimensionnel peut être transformé en complexe cubique, dont on peut étudier les groupes d’homologie ...

In this paper, we follow up on the studies developed by Kovalevsky (Comput Vis Graph Image Process 46:141–161, 1989) and ...

Computing and representing topological information form an important part in many applications such as image representation ...

A 2D topology-based digital image processing framework is presented here. This framework consists of the computation of a ...

Morse theory is a fundamental tool for analyzing the geometry and topology of smooth manifolds. This tool was translated ...

In this paper, we present a direct computational application of Homological Perturbation Theory (HPT, for short) to computer ...

In this paper we present a new software tool for dealing with the problem of segmentation in Digital Imagery. The ...

Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology ...

Effective Homology is an algebraic-topological method based on the computational concept of chain homotopy equivalence on ...

Let G be a semidirect product of finitely generated Abelian groups. We provide a method for constructing an explicit ...

Membrane Computing is a biologically inspired computational model. Its devices are called P systems and they perform ...

In this paper we show a more efficient algorithm than that in [8] to compute subsets of points non-congruent by isometries. ...

Triangle three-dimensional meshes have been widely used to represent 3D objects in several applications. These meshes are ...

We present here a topo–geometrical description of a subdivided nD object called homological spanning forest representation. ...

In this paper, we formalize the notion of lambda-AT-model (where λ is a non-null integer) for a given chain complex, which ...

This paper presents a set of tools to compute topological information of simplicial complexes, tools that are applicable ...

The goal of this paper is to construct an algebraic-topological representation of a 80–adjacent doxel-based 4–dimensional ...

Membrane Computing is a biologically inspired computational model. Its devices are called P systems and they perform ...

In this paper we show a method to create a look-up table with all the possible bricks which can made up an object. Moreover, ...

It has been an honor and a pleasure to organize the 3rd International Workshop on Computational Topology in Image Context, ...

Segmentation in computer vision refers to the process of partitioning a digital image into multiple segments (sets of ...

In this paper we present a P systems-based solution for the Homology Groups of Binary 2D Image (HGB2I) Problem, a classical ...

We present a new solution for the Homology Groups of Binary 2D Image (HGB2I) Problem by using Membrane Computing techniques. ...

Several features of image segmentation make it suitable for bio–inspired techniques. It can be parallelized, locally solved ...

Membrane Computing is a paradigm inspired from biological cellular communication. Membrane computing devices are called P ...

Once a discrete Morse function has been defined on a finite cell complex, information about its homology can be deduced ...

In this paper, we determine a cell complex representation of a 80–adjacent doxelbased 4-dimensional object. The homological ...

The topic of this paper is the description of procedures to remove the fringes from complicated astronomical data sets, ...

Membrane Computing is a computational model inspired in the structure and function of living cells and tissues. In this ...

En esta comunicación presentaremos resultados de existencia y unicidad de soluciones que verifican una igualdad de energía ...

Membrane Computing is a new paradigms inspired from cellular communication. We use in this paper the computational devices ...

For a simplicial augmented algebra K, Eilenberg–Mac Lane constructed a chain map . They proved that g is a reduction ...

We introduce here a new F2 homology computation algorithm based on a generalization of the spanning tree technique on a ...

An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is described. Provided that a ...

Given an 80-adjacency doxel-based digital four-dimensional hypervolume V, we construct here an associated oriented ...

Membrane Computing is a biologically inspired computational model. Its devices are called P systems and they perform ...

In [4], given a binary 26-adjacency voxel-based digital volume V, the homological information (that related to n-dimensional ...

The homology of binary 3–dimensional digital images (digital volumes) provides concise algebraic description of their ...

Homological characteristics of digital objects can be obtained in a straightforward manner computing an algebraic map φ ...

Membrane Computing is a new paradigm inspired from cellular communication. Until now, P systems have been used in research ...

In this paper, we provide a graph-based representation of the homology (information related to the different “holes” the ...

Given a basis equation image for 2-cocycles equation image over a group G of order equation image, we describe a nonlinear ...

Given a 3D binary voxel-based digital object V, an algorithm for computing homological information for V via a polyhedral ...

Starting from an nD geometrical object, a cellular subdivision of such an object provides an algebraic counterpart from ...

When the ground ring is a field, the notion of algebraic topological model (AT-model) is a useful tool for computing ...

In this article, in the setting of connected DG-modules, we prove that, for any A -algebra M mi i≥1 , there is a chain ...

Given a cell complex K whose geometric realization |K| is embedded in R 3 and a continuous function h: |K|→R (called the ...

Starting from a chain contraction (a special chain homotopy equivalence) connecting a differential graded algebra A with ...

Para introducir este trabajo es necesario hablar de TOPOLOG´IA. La topología es la rama de las matemáticas que estudia las ...

Let G, G′, and G ×τ G′ be three simplicial groups (not necessarily abelian) and C N (G) ⊗ t C N (G′) be the “twisted” ...

Mostramos aquí diversos aspectos importantes relacionados con el estudio de las A∞-estructuras, las cuales juegan un papel ...

We deal with the problem of obtaining explicit simplicial formu- lae defining the classical Adem cohomology operations at ...

In this paper, algorithms for computing integer (co)homology of a simplicial complex of any dimension are designed, extending ...

Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, ...

Let G be a group which admits the structure of an iterated product of central extensions and semidirect products of abelian ...

A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case of dihedral groups, ...

We describe a notebook in Mathematica which, taking as input data a homological model for a finite group G of order |G| = ...

In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an “elementary ...

Let Λ be a commutative ring, A an augmented differential graded algebra over Λ (briefly, DGA-algebra) and X be a relatively ...

This paper offers an algorithmic solution to the problem of obtaining “economical” formulae for some maps in Simplicial ...

This paper introduces an algebraic framework for a topological analysis of time-varying 2D digital binary–valued images, ...

We propose a method for computing the cohomology ring of three-dimensional (3D) digital binary-valued pictures. We obtain ...

We reinterpret the classical theory of cocyclic operations in terms of permutations and homotopy equivalences of ...

Proponemos un método para visualizar conceptos altamente abstractos en objetos tridimensionales, representados éstos como ...

We study here the A(1)-coalgebra structure of the homology H (K( , n);Zp) of an Eilenberg-Mac Lane space K( , n), where ...

We propose a method for calculating cohomology operations on finite simplicial complexes. Of course, there exist well–known ...

We propose a method for computing the Z 2–cohomology ring of a simplicial complex uniquely associated with a three–dimensional ...

This review tackles the problem of the high computational complexity lying in most algorithms in algebraic topology and ...

Steenrod cohomology operations are algebraic tools for distinguishing non–homeomorphic topological spaces. In this paper, ...

En este art´ıculo, se pretende dar una visi´on general y lo m´as divulgativa posible sobre los prop´ositos y objetivos del ...

In [3] “small” 1-homological model H of a commutative differential graded algebra is described. Homological Perturbation ...

An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product offinite abelian groups ...

En esta memoria se establece un enfoque puramente combinatorio de las operaciones cohomológicas de Steenrod y Adem a nivel ...

We use homological perturbation machinery specific for the algebra category [13] to give an algorithm for computing the ...

In this paper, working over Z(p) and using algebra perturbation results from [18], p-minimal homological models of twisted ...

We design here a primary platform for computing the basic homological information of Commutative Differential Graded ...

In this note, working in the context of simplicial sets [17], we give a detailed study of the complexity for computing ...

We present here a combinatorial method for computing Steenrod squares of a simplicial set X. This method is essentially ...

Como es bien conocido, los principales mecanismos algebraicos para obtener información homológica de los espacios fibrados ...

En esta memoria proponemos un método para calcular la n -homología de una DGA-álgebra conmutativa, basado esencialmente ...

Working in the framework of the Simplicial Topology, a method for calculating the p-local homology of a twisted cartesian ...

We establish an algorithm computing the homology of commutative differential graded algebras (briefly, CDGAs). The main ...

An algorithm computing homotopy groups of a reduced simplicial set with effective homology is described, using the Whitehead tower method.

In questo lavoro offriamo in modo esplicito le formule di una serie de morfismi che controUano la mancanza di commutativit~ ...

El propósito esencial de esta memoria es el de describir varios algoritmos de cálculo de homología efectiva de los espacios ...