Comparison of Evolving Uniform, Non-uniform Cellular Automaton, and Genetic Programming for Centroid Detection with Hardware Agents

  • Marcus Komann
  • Andreas Mainka
  • Dietmar Fey
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4671)


Current industrial applications require fast and robust image processing in systems with low size and power dissipation. One of the main tasks in industrial vision is fast detection of centroids of objects. This paper compares three different approaches for finding geometric algorithms for centroid detection which are appropriate for a fine-grained parallel hardware architecture in an embedded vision chip. The algorithms shall comprise emergent capabilities and high problem-specific functionality without requiring large amounts of states or memory. For that problem, we consider uniform and non-uniform cellular automata (CA) as well as Genetic Programming. Due to the inherent complexity of the problem, an evolutionary approach is applied. The appropriateness of these approaches for centroid detection is discussed.


Genetic Program Cellular Automaton Cellular Automaton Output Image Processor Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adorni, G., Bergenti, F., Cagnoni, S.: A cellular-programming approach to pattern classification. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 142–150. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  2. 2.
    Baeck, T.: Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford Univ. Press, New York (1996)zbMATHGoogle Scholar
  3. 3.
    Fey, D., Schmidt, D.: Marching-pixels: a new organic computing paradigm for smart sensor processor arrays. In: CF 2005. Proceedings of the 2nd conference on Computing Frontiers, pp. 1–9. ACM Press, New York (2005)CrossRefGoogle Scholar
  4. 4.
    Fey, D., Schmidt, D.: Marching pixels: A new organic computing principle for smart cmos camera chips. In: Proc. Workshop on Self-Organization and Emergence – Organic Computing and its Neighboring Disciplines, LNI, pp. 123–130 (2005)Google Scholar
  5. 5.
    Komann, M., Fey, D.: Marching pixels - using organic computing principles in embedded parallel hardware. In: International Conference on Parallel Computing in Electrical Engineering (PARELEC 2006), pp. 369–373 (2006)Google Scholar
  6. 6.
    Komann, M., Fey, D.: Realising emergent image pre-processing tasks in cellular-automaton-alike massively parallel hardware. Int. Journ. of Parallel, Emergent and Distributed Systems 22, 79–89 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection (Complex Adaptive Systems). MIT Press, Cambridge (1992)Google Scholar
  8. 8.
    Sipper, M.: Evolution of parallel cellular machines: the cellular programming approach. Springer, Heidelberg (1997)Google Scholar
  9. 9.
    Sipper, M., Tomassini, M.: Computation in artificially evolved, non-uniform cellular automata. Theor. Comput. Sci. 217(1), 81–98 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Neumann, J.v.: Theory of Self-Reproducing Automata. University of Illinois Press, Urbana (1966)Google Scholar
  11. 11.
    Wolfram, S.: A new kind of science. Wolfram Media, Champaign, IL, USA (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Marcus Komann
    • 1
  • Andreas Mainka
    • 1
  • Dietmar Fey
    • 1
  1. 1.Institute of Computer Science, University of Jena, Ernst-Abbe-Platz 2, 07743 JenaGermany

Personalised recommendations