Cellular Learning Automata Model Research Articles

Ripplet-Transform-based Cycle Spinning Denoising and Fuzzy-CLA Segmentation of Retinal Images for Accurate Hard Exudates and Lesion Detection

Aims: Digital retinal images are commonly used for hard exudates and lesion detection. These images are rarely noiseless and therefore before any further processing they should be underwent noise removal. Background: An efficient segmentation method is then needed to detect and discern the lesions from the retinal area. Objective: In this paper, a hybrid method is presented for digital retinal image processing for diagnosis and screening purposes. The aim of this study is to present a supervised/semi-supervised approach for exudate detection in fundus images and also to analyze the method to find the optimum structure. Methods: Ripplet transform and cycle spinning method is first used to remove the noises and artifacts. Results: The noises may be normal or any other commonly occurring forms such as salt and pepper. The image is transformed into fuzzy domain after it is denoised. Conclusion: A cellular learning automata model is used to detect any abnormality on the image which is related to a lesion. The automaton is created with an extra term as the rule updating term to improve the adaptability and efficiency of the cellular automata.Three main statistical criteria are introduced as the sensitivity, specificity and accuracy. A number of 50 retinal images with visually detection hard exudates and lesions are the experimental dataset for evaluation and validation of the method.

A closed asynchronous dynamic model of cellular learning automata and its application to peer-to-peer networks

Cellular Learning Automata (CLAs) are hybrid models obtained from combination of Cellular Automata (CAs) and Learning Automata (LAs). These models can be either open or closed. In closed CLAs, the states of neighboring cells of each cell called local environment affect on the action selection process of the LA of that cell whereas in open CLAs, each cell, in addition to its local environment has an exclusive environment which is observed by the cell only and the global environment which can be observed by all the cells in CLA. In dynamic models of CLAs, one of their aspects such as structure, local rule or neighborhood radius may change during the evolution of the CLA. CLAs can also be classified as synchronous CLAs or asynchronous CLAs. In a synchronous CLA, all LAs in different cells are activated synchronously whereas in an asynchronous CLA, the LAs in different cells are activated asynchronously. In this paper, a new closed asynchronous dynamic model of CLA whose structure and the number of LAs in each cell may vary with time has been introduced. To show the potential of the proposed model, a landmark clustering algorithm for solving topology mismatch problem in unstructured peer-to-peer networks has been proposed. To evaluate the proposed algorithm, computer simulations have been conducted and then the results are compared with the results obtained for two existing algorithms for solving topology mismatch problem. It has been shown that the proposed algorithm is superior to the existing algorithms with respect to communication delay and average round-trip time between peers within clusters.

Multi swarm bare bones particle swarm optimization with distribution adaption

Bare bones PSO is a simple swarm optimization approach that uses a probability distribution like Gaussian distribution in the position update rules. However, due to its nature, Bare bones PSO is highly prone to premature convergence and stagnation. The characteristics of the probability distribution functions used in the update rule have a tense impact on the performance of the bare bones PSO. As a result, this paper investigates the use of different methods for estimating the probability distributions used in the update rule. Four methods or strategies are developed that are using Gaussian or multivariate Gaussian distributions. The choice of an appropriate updating strategy for each particle greatly depends on the characteristics of the fitness landscape that surrounds the swarm. To deal with issue, the cellular learning automata model is incorporated with the proposed bare bones PSO, which is able to adaptively learn suitable updating strategies for the particles. Through the interactions among its elements and the learning capabilities of its learning automata, cellular learning automata gradually learns to select the best updating rules for the particles based on their surrounding fitness landscape. This paper also, investigates a new and simple method for adaptively refining the covariance matrices of multivariate Gaussian distributions used in the proposed updating strategies. The proposed method is compared with some other well-known particle swarm approaches. The results indicate the superiority of the proposed approach in terms of the accuracy of the achieved results and the speed in finding appropriate solutions.

A cellular learning automata model of investment behavior in the stock market

In this paper, we present a cellular learning automata model for the investment behavior in the stock market. In this model, investors decide to hold, buy, or sell the stocks based on the evolution rules and learn how much they can trust on other investors based on the learning rules. We analyze the effects of imitation, reliability and macrofactors on the stock market and compare the obtained results with the previous approach that is based on cellular automata.

A rectification algorithm for the estimation of instantaneous helical axes

Bare bones PSO is a simple swarm optimization approach that uses a probability distribution like Gaussian distribution in the position update rules. However, due to its nature, Bare bones PSO is highly prone to premature convergence and stagnation. The characteristics of the probability distribution functions used in the update rule have a tense impact on the performance of the bare bones PSO. As a result, this paper investigates the use of different methods for estimating the probability distributions used in the update rule. Four methods or strategies are developed that are using Gaussian or multivariate Gaussian distributions. The choice of an appropriate updating strategy for each particle greatly depends on the characteristics of the fitness landscape that surrounds the swarm. To deal with issue, the cellular learning automata model is incorporated with the proposed bare bones PSO, which is able to adaptively learn suitable updating strategies for the particles. Through the interactions among its elements and the learning capabilities of its learning automata, cellular learning automata gradually learns to select the best updating rules for the particles based on their surrounding fitness landscape. This paper also, investigates a new and simple method for adaptively refining the covariance matrices of multivariate Gaussian distributions used in the proposed updating strategies. The proposed method is compared with some other well-known particle swarm approaches. The results indicate the superiority of the proposed approach in terms of the accuracy of the achieved results and the speed in finding appropriate solutions.