Comparison of evolving uniform, non-uniform cellular automaton, and genetic programming for centroid detection with hardware agents

  • Authors:
  • Marcus Komann;Andreas Mainka;Dietmar Fey

  • Affiliations:
  • Institute of Computer Science, University of Jena, Jena, Germany;Institute of Computer Science, University of Jena, Jena, Germany;Institute of Computer Science, University of Jena, Jena, Germany

  • Venue:
  • PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.