DÍAZ PERNIL , Daniel

The integration of symbolic reasoning systems based on logic and connectionist systems based on thefunctioning of living neurons is a vivid research area in computer science. In the literature, one can findmany efforts where different reasoning systems based on different logics are linked to classic artificialneural networks. In this paper, we...

Algebraic Topology has been proved to be an useful tool to be used in image processing. In this case we will borrow some elements from Algebraic Topology in order to show a parallel algorithm for thinning a binary 3D image respecting its shape information. The parallelization of the thinning algorithm is based on Membrane Computing. This...

In this paper we present a new way to determine the geometrical objects associated to the Homology groups of a 2D-digital binary image. In fact, using Membrane Computing with techniques of spanning forests, we are able to define a parallel algorithm which calculates not only the Betti numbers, but also the geometric objects which generate these holes.

The integration of symbolic reasoning systems based on logic and connectionist systems based on the functioning of living neurons is a vivid research area in computer science. In the literature, one can found many e orts where di erent reasoning systems based on di erent logics are linked to classic arti cial neural networks. In this paper, we...

No description

Membrane computing is a well-known research area in computer science inspired by the organization and behavior of live cells and tissues. Their computational devices, called P systems, work in parallel and distributed mode and the information is encoded by multisets in a localized manner. All these features make P systems appropriate for...

Membrane Computing is a biologically inspired computational model. Its devices are called P systems and they perform computations by applying a finite set of rules in a synchronous, maximally parallel way. In this paper, we open a new research line: P systems are used in Computational Topology within the context of the Digital Image. We choose...

Membrane Computing is a new paradigm inspired from cellular communication. Until now, P systems have been used in research areas like modeling chemical process, several ecosystems, etc. In this paper, we apply P systems to Computational Topology within the context of the Digital Image. We work with a variant of P systems called tissue-like P...

Membrane Computing is a new paradigms inspired from cellular communication. We use in this paper the computational devices called P systems to calculate in a general maximally parallel manner the homology groups of binary 2D images. So, the computational time to calculate this homology information only depends on the thickness of them.

The 3-COL problem consists on deciding if the regions of a map can be coloured with only three colors bearing in mind that two adjacent regions must be coloured with different colors. It is a NP problem and it has been previously used in complexity studies in membrane computing to check the ability of a model for solving problems of such...

The 3-COL problem consists on deciding if the regions of a map can be coloured with only three colors bearing in mind that two adjacent regions must be coloured with di erent colors. It is a NP problem and it has been previously used in complexity studies in membrane computing to check the ability of a model for solving problems of such...

Ramsey numbers deal with conditions when a combinatorial object necessarily contains some smaller given objects. It is well known that it is very difficult to obtain the values of Ramsey numbers. In this work, a theoretical chemical/biological solution is presented in terms of membrane computing for the decision version of Ramsey number...

The application of Membrane Computing techniques to the study of digital images has been a vivid research area in the last years. In this paper, some of the research lines are presented and many of the main published papers are cited in the bibliography.

Membrane Computing is a biologically inspired computational model. Its devices are called P systems and they perform computations by applying a finite set of rules in a synchronous, maximally parallel way. In this paper, we develop a variant of P-system, called tissue-like P system in order to design in this computational setting, a...

Membrane Computing is a paradigm inspired from biological cellular communication. Membrane computing devices are called P systems. In this paper we calculate some algebraic-topological information of 2D and 3D images in a general and parallel manner using P systems. First, we present a new way to obtain the homology groups of 2D digital images...

In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create an exponential number of membranes in polynomial time. Working with P systems whose membrane structure does not increase in...

In the literature, several examples of the efficiency of cell-like P systems in order to solve NP-complete problems in polynomial time can be found. Recently, various new models of tissue-like P systems have received important attention from the scientific community. In this paper we present a linear-time solution to an NP-complete problem, the...

The set of NP-complete problems is split into weakly and strongly NP- complete ones. The di erence consists in the in uence of the encoding scheme of the input. In the case of weakly NP-complete problems, the intractability depends on the encoding scheme, whereas in the case of strongly NP-complete problems the problem is intractable even if...

In this paper we report a work-in-progress whose final target is the implementation of tissue-like P system in a cluster of computers which solves some instances of the segmentation problem in 2D Digital Imagery. We focus on the theoretical aspects and the problem of choosing a maximal number of application of rules by using Integer Linear...

The problem of automatically marking the interior and exterior regions of a simple curve in a digital image becomes a hard task due to the noise and the intrinsic difficulties of the media where the image is taken. In this paper, we propose a definition of the interior of a partially bounded region and present a bio-inspired algorithm for...

Skeletonization is a common type of transformation within image analysis. In general, the image B is a skeleton of the black and white image A, if the image B is made of fewer black pixels than the image A, it does preserve its topological properties and, in some sense, keeps its meaning. In this paper, we aim to use spiking neural P systems (a...

Problems associated with the treatment of digital images have several interesting features from a bio-inspired point of view. One of them is that they can be suitable for parallel processing, since the same sequential algorithm is usually applied in different regions of the image. In this paper we report a work-in-progress of a...

It is well known that the polynomial complexity class of recognizer polarizationless P systems with active membranes, without dissolution and with division for elementary and non-elementary membranes is exactly the complexity class P (see [6], Th. 2). In this paper, we prove that if such P system model is endowed with antimatter and...

P systems can be classi ed in two main groups: P systems with the membrane structure described by a tree, and tissue P systems with the membranes placed in the nodes of an arbitrary graph. NP-complete problems have been solved in linear time by trading space for time in the framework of recognizing tissue P systems with cell division. The...