Skip to main content
SpringerLink
Log in

Parallel Thinning with Complex Objects and Actors

  • Conference paper
  • First Online:
Membrane Computing (CMC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8961))

Included in the following conference series:

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agha, G., Thati, P.: An algebraic theory of actors and its application to a simple object-based language. In: Owe, O., Krogdahl, S., Lyche, T. (eds.) From OO to FM (Dahl Festschrift). LNCS, vol. 2635, pp. 26–57. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Bălănescu, T., Nicolescu, R., Wu, H.: Asynchronous P systems. International Journal of Natural Computing Research 2(2), 1–18 (2011)

    Article  Google Scholar 

  3. Díaz-Pernil, D., Peña-Cantillana, F., Gutiérrez-Naranjo, M.A.: A parallel algorithm for skeletonizing images by using spiking neural P systems. Neurocomputing 115, 81–91 (2013)

    Article  Google Scholar 

  4. Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: A faster P solution for the Byzantine agreement problem. In: Gheorghe, M., Hinze, T., Păun, Gh., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 175–197. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Dinneen, M.J., Kim, Y.B., Nicolescu, R.: P systems and the Byzantine agreement. Journal of Logic and Algebraic Programming 79(6), 334–349 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  6. ElGindy, H., Nicolescu, R., Wu, H.: Fast distributed DFS solutions for edge-disjoint paths in digraphs. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, Gy. (eds.) CMC 2012. LNCS, vol. 7762, pp. 173–194. Springer, Heidelberg (2013). http://dx.doi.org/10.1007/978-3-642-36751-9_13

    Chapter  Google Scholar 

  7. Floyd, R.W.: Nondeterministic algorithms. J. ACM 14(4), 636–644 (1967). http://doi.acm.org/10.1145/321420.321422

    Article  MATH  Google Scholar 

  8. Gimelfarb, G., Nicolescu, R., Ragavan, S.: P systems in stereo matching. In: Real, P., Diaz-Pernil, D., Molina-Abril, H., Berciano, A., Kropatsch, W. (eds.) CAIP 2011, Part II. LNCS, vol. 6855, pp. 285–292. Springer, Heidelberg (2011). http://dx.doi.org/10.1007/978-3-642-23678-5_33

    Chapter  Google Scholar 

  9. Gimelfarb, G., Nicolescu, R., Ragavan, S.: P system implementation of dynamic programming stereo. Journal of Mathematical Imaging and Vision 47(1–2), 13–26 (2013). http://dx.doi.org/10.1007/s10851-012-0367-6

    Article  Google Scholar 

  10. Guo, Z., Hall, R.W.: Parallel thinning with two-subiteration algorithms. Commun. ACM 32(3), 359–373 (1989). http://doi.acm.org/10.1145/62065.62074

    Article  MathSciNet  Google Scholar 

  11. Hewitt, C.: Viewing control structures as patterns of passing messages. Artificial Intelligence 8(3), 323–364 (1977). http://www.sciencedirect.com/science/article/pii/0004370277900339

    Article  Google Scholar 

  12. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)

    MATH  Google Scholar 

  13. Nicolescu, R.: Parallel and distributed algorithms in P systems. In: Gheorghe, M., Păun, Gh., Rozenberg, G., Salomaa, A., Verlan, S. (eds.) CMC 2011. LNCS, vol. 7184, pp. 35–50. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Nicolescu, R., Gimelfarb, G., Morris, J., Gong, R., Delmas, P.: Regularising ill-posed discrete optimisation: Quests with P systems. Fundam. Inf. 131(3–4), 465–483 (2014)

    MATH  MathSciNet  Google Scholar 

  15. Nicolescu, R., Ipate, F., Wu, H.: Programming P systems with complex objects. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Yu., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 280–300. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  16. Nicolescu, R., Ipate, F., Wu, H.: Towards high-level P systems programming using complex objects. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Yu. (eds.) 14th International Conference on Membrane Computing, CMC14, Chişinău, Moldova, August 20-23, 2013, Proceedings, pp. 255–276. Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chişinău (2013)

    Google Scholar 

  17. Nicolescu, R., Wu, H.: BFS solution for disjoint paths in P systems. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds.) UC 2011. LNCS, vol. 6714, pp. 164–176. Springer, Heidelberg (2011). http://dx.doi.org/10.1007/978-3-642-21341-0_20

    Chapter  Google Scholar 

  18. Nicolescu, R., Wu, H.: New solutions for disjoint paths in P systems. Natural Computing 11, 637–651 (2012). http://dx.doi.org/10.1007/s11047-012-9342-9

    Article  MathSciNet  Google Scholar 

  19. Nicolescu, R., Wu, H.: Complex objects for complex applications. Romanian Journal of Information Science and Technology (2014, to appear)

    Google Scholar 

  20. Peña-Cantillana, F., Berciano, A., Díaz-Pernil, D., Gutiérrez-Naranjo, M.A.: Parallel skeletonizing of digital images by using cellular automata. In: Ferri, M., Frosini, P., Landi, C., Cerri, A., Di Fabio, B. (eds.) CTIC 2012. LNCS, vol. 7309, pp. 39–48. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  21. Păun, Gh., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press Inc., New York (2010)

    Book  MATH  Google Scholar 

  22. Reina-Molina, R., Díaz-Pernil, D.: Bioinspired parallel 2D or 3D skeletonization. IMAGEN-A 3(5), 41–44 (2013)

    Google Scholar 

  23. Reina-Molina, R., Díaz-Pernil, D., Gutiérrez-Naranjo, M.A.: Cell complexes and membrane computing for thinning 2D and 3D images. In: del Amor, M.A.M., Păun, Gh., Pérez-Hurtado, I., Romero-Campero, F.J. (eds.) Tenth Brainstorming Week on Membrane Computing. RGNC REPORT, vol. 1, pp. 91–110. Universidad de Sevilla (2012)

    Google Scholar 

  24. Syme, D., Granicz, A., Cisternino, A.: Expert F# 3.0, 3rd edn. Apress, Berkely (2012)

    Book  Google Scholar 

  25. Wu, H.: Minimum spanning tree in P systems. In: Pan, L., Păun, Gh., Song, T. (eds.) Proceedings of the Asian Conference on Membrane Computing (ACMC2012), pp. 88–104. Huazhong University of Science and Technology, Wuhan (2012)

    Google Scholar 

  26. Wu, H.: Distributed Algorithms in P Systems. Ph.D. thesis, The University of Auckland, Auckland, New Zealand (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Radu Nicolescu

Authors
  1. Radu Nicolescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Radu Nicolescu .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Sheffield, Sheffield, United Kingdom

    Marian Gheorghe

  2. Leiden Inst. Advanced Computer Science, Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Center for Computer Science, Turku, Finland

    Arto Salomaa

  4. Dept. Mathematics & Computer Science, Silesian University, Opava, Czech Republic

    Petr Sosík

  5. D.I.S.Co, University of Milan-Bicocca, Milan, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Nicolescu, R. (2014). Parallel Thinning with Complex Objects and Actors. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Sosík, P., Zandron, C. (eds) Membrane Computing. CMC 2014. Lecture Notes in Computer Science(), vol 8961. Springer, Cham. https://doi.org/10.1007/978-3-319-14370-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14370-5_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14369-9

  • Online ISBN: 978-3-319-14370-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation