CHRISTINAL , Hepzibah A.

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.

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...

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...

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 follow a new research line using tissue-like P systems to do a parallel color segmentation of images using a...

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...

Effective Homology is an algebraic-topological method based on the computational concept of chain homotopy equivalence on a cell complex. Using this algebraic data structure, Effective Homology gives answers to some important computability problems in Algebraic Topology. In a discrete context, Effective Homology can be seen as a combinatorial...

The ability of tissue P systems with 2-division for solving NP problems in polynomial time is well-known and many solutions can be found in the literature to several of such problems. Nonetheless, there are very few papers devoted to the Bin-packing problem. The reason may be the difficulties for dealing with different number of bins, capacity...

Smoothing is often used in Digital Imagery to reduce noise within an image. In this paper we present a Membrane Computing algorithm for smoothing 2D images in the framework of tissue-like P systems. The algorithm has been implemented by using a novel device architecture called CUDATM, (Compute Unified Device Architecture). We present some...

Array grammars have been studied in the framework of Membrane Comput- ing by using rewriting rules from transition P systems. In this paper we present a new approach to dealing with array grammars by using tissue-like P systems and present an application to the segmentation of images in two dimensional computer graphics.

Thresholding is the process of splitting a digital image into sets of pixels in order to make it easier to analyze. Pixels are ordered according to a scale of one of their features as brightness or color and the ¯nal image is obtained by comparing the measure of the feature with some thresholds. In this paper we present a family of cell-like P...

In this paper we present a tissue-like P systems model with cell division the environment has been replaced by an extra cell. In such model, we present a uniform family of recognizer P systems which solves the Subset Sum problem. This solution establishes a new frontier for the tractability of computationally hard problems in Membrane...