Javascript must be enabled to continue!
Evolution of Hybrid Cellular Automata for Density Classification Problem
View through CrossRef
This paper describes a solution for the image density classification problem (DCP) using an entirely distributed system with only local processing of information named cellular automata (CA). The proposed solution uses two cellular automata’s features, density conserving and translation of the information stored in the cellular automata’s cells through the lattice, in order to obtain the solution for the density classification problem. The motivation for choosing a bio-inspired technique based on CA for solving the DCP is to investigate the principles of self-organizing decentralized computation and to assess the capabilities of CA to achieve such computation, which is applicable to many real-world decentralized problems that require a decision to be taken by majority voting, such as multi-agent holonic systems, collaborative robots, drones’ fleet, image analysis, traffic optimization, forming and then separating clusters with different values. The entire application is coded using the C# programming language, and the obtained results and comparisons between different cellular automata configurations are also discussed in this research.
Title: Evolution of Hybrid Cellular Automata for Density Classification Problem
Description:
This paper describes a solution for the image density classification problem (DCP) using an entirely distributed system with only local processing of information named cellular automata (CA).
The proposed solution uses two cellular automata’s features, density conserving and translation of the information stored in the cellular automata’s cells through the lattice, in order to obtain the solution for the density classification problem.
The motivation for choosing a bio-inspired technique based on CA for solving the DCP is to investigate the principles of self-organizing decentralized computation and to assess the capabilities of CA to achieve such computation, which is applicable to many real-world decentralized problems that require a decision to be taken by majority voting, such as multi-agent holonic systems, collaborative robots, drones’ fleet, image analysis, traffic optimization, forming and then separating clusters with different values.
The entire application is coded using the C# programming language, and the obtained results and comparisons between different cellular automata configurations are also discussed in this research.
Related Results
PERBAIKAN CITRA INFRA MERAH DENGAN METODE CELLULAR AUTOMATA
PERBAIKAN CITRA INFRA MERAH DENGAN METODE CELLULAR AUTOMATA
Image enhancement is needed because not all images have good quality, such as noise, too low contrast or blurry image. These problems are commonly found in images generated from in...
Сyberphysical representation of robots of the neuro-network collective of automata on a chip
Сyberphysical representation of robots of the neuro-network collective of automata on a chip
The article examines modern innovative technologies, which are a continuation, generalization of previously created technologies, deepening and expanding existing concepts, their a...
Fundamental Concepts and Methodology for the Analysis of Animal Population Dynamics, with Particular Reference to Univoltine Species
Fundamental Concepts and Methodology for the Analysis of Animal Population Dynamics, with Particular Reference to Univoltine Species
This paper presents some concepts and methodology essential for the analysis of population dynamics of univoltine species. Simple stochastic difference equations, comprised of endo...
Optimal Cellular Automata Technique for Image Segmentation
Optimal Cellular Automata Technique for Image Segmentation
Leukemia death secured 10 thplace among the most dangerous death in the world. The main reason is due to the delay in diagnosis which in turn delayed the treatment process. Hence i...
Early Warning Signals for Critical Transitions in Sandpile Cellular Automata
Early Warning Signals for Critical Transitions in Sandpile Cellular Automata
The sandpile cellular automata, despite the simplicity of their basic rules, are adequate mathematical models of real-world systems, primarily open nonlinear systems capable to sel...
Epsilon-removal constructions of fuzzy finite automata based on fuzzy matrices
Epsilon-removal constructions of fuzzy finite automata based on fuzzy matrices
Abstract
The equivalence of different forms of automata provides a lot of convenience for us to solve practical problems. Sometimes, for efficient use of a fuzzy finite aut...
Pemodelan Evakuasi Pejalan Kaki di Ruang Koridor dengan Cellular Automata Studi Kasus Gempa Bumi
Pemodelan Evakuasi Pejalan Kaki di Ruang Koridor dengan Cellular Automata Studi Kasus Gempa Bumi
Pemodelan Sistem Evakuasi Pejalan Kaki adalah sebuah sistem pemodelan untuk memodelkan pergerakan objek manusia untuk memberikan analisis pada kejadian evakuasi dalam studi kasus b...
Duration-constrained regular expressions
Duration-constrained regular expressions
Abstract.
This paper investigates the logic-automata-connection for Duration Calculus. It has been frequently observed that Duration Calculus with linear dur...

