Parallel Thinning with Complex Objects and Actors

Based on our earlier complex objects proposal, we present three novel concurrent membrane computing models for a fundamental image processing task: the thinning (or skeletonisation) of binary images, based on the classical Guo-Hall algorithm (A2). The first model is synchronous and uses one cell per pixel and relies on inter-cell parallelism; the second model is an asynchronous version of the first; the third model uses one single cell, with one sub-cellular object per pixel, and relies on intra-cell parallelism. The static and dynamic qualities of our models validate our complex objects proposal: (i) the proposed models are crisp (comparable to the best pseudocode); and (ii) complex objects concurrency and messaging can be efficiently emulated on a message-based Actors framework (which opens a novel research path).

[1]  Radu Nicolescu,et al.  BFS Solution for Disjoint Paths in P Systems , 2011, UC.

[2]  Florentin Ipate,et al.  Programming P Systems with Complex Objects , 2013, Int. Conf. on Membrane Computing.

[3]  Xuefeng Yu.  Dynamic programming based coordinated ramp metering algorithms : a thesis presented in partial fulfillment of the requirements for the degree of PhD of Englineeriing in Mechatronics at Massey University, Auckland, New Zealand , 2014 .

[4]  Radu Nicolescu,et al.  P System Implementation of Dynamic Programming Stereo , 2012, Journal of Mathematical Imaging and Vision.

[5]  Tom Lyche,et al.  From Object-Orientation to Formal Methods , 2004, Lecture Notes in Computer Science.

[6]  Radu Nicolescu,et al.  Asynchronous P Systems , 2011, Int. J. Nat. Comput. Res..

[7]  Radu Nicolescu,et al.  A Faster P Solution for the Byzantine Agreement Problem , 2010, Int. Conf. on Membrane Computing.

[8]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[9]  Miguel Ángel Gutiérrez Naranjo,et al.  Cell Complexes and Membrane Computing for Thinning 2D and 3D Images , 2012 .

[10]  Francisco José Romero Campero,et al.  Tenth Brainstorming Week on Membrane Computing , 2012 .

[11]  Pawel Dlotko,et al.  Computational Topology in Text Mining , 2012, CTIC.

[12]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[13]  Zicheng Guo,et al.  Parallel thinning with two-subiteration algorithms , 1989, Commun. ACM.

[14]  Daniel Díaz-Pernil,et al.  A parallel algorithm for skeletonizing images by using spiking neural P systems , 2013, Neurocomputing.

[15]  Hossam ElGindy,et al.  Fast Distributed DFS Solutions for Edge-Disjoint Paths in Digraphs , 2012, Int. Conf. on Membrane Computing.

[16]  Radu Nicolescu,et al.  P Systems in Stereo Matching , 2011, CAIP.

[17]  Radu Nicolescu,et al.  New solutions for disjoint paths in P systems , 2012, Natural Computing.

[18]  Radu Nicolescu,et al.  Regularising Ill-posed Discrete Optimisation: Quests with P Systems , 2014, Fundam. Informaticae.

[19]  Carl Hewitt,et al.  Viewing Control Structures as Patterns of Passing Messages , 1977, Artif. Intell..

[20]  Daniel Díaz-Pernil,et al.  Parallel Skeletonizing of Digital Images by Using Cellular Automata , 2012, CTIC.

[21]  Radu Nicolescu.  Parallel and Distributed Algorithms in P Systems , 2011, Int. Conf. on Membrane Computing.

[22]  Gul A. Agha,et al.  An Algebraic Theory of Actors and Its Application to a Simple Object-Based Language , 2004, Essays in Memory of Ole-Johan Dahl.

[23]  Radu Nicolescu,et al.  P systems and the Byzantine agreement , 2010, J. Log. Algebraic Methods Program..

[24]  Daniel Díaz Pernil,et al.  Bioinspired parallel 2D or 3D skeletonization , 2013 .

[25]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.