Theory and Applications of Two-dimensional, Null-boundary, Nine-Neighborhood, Cellular Automata Linear rules

Abstract

This paper deals with the theory and application of 2-Dimensional, nine-neighborhood, null- boundary, uniform as well as hybrid Cellular Automata (2D CA) linear rules in image processing. These rules are classified into nine groups depending upon the number of neighboring cells influences the cell under consideration. All the Uniform rules have been found to be rendering multiple copies of a given image depending on the groups to which they belong where as Hybrid rules are also shown to be characterizing the phenomena of zooming in, zooming out, thickening and thinning of a given image. Further, using hybrid CA rules a new searching algorithm is developed called Sweepers algorithm which is found to be applicable to simulate many inter disciplinary research areas like migration of organisms towards a single point destination, Single Attractor and Multiple Attractor Cellular Automata Theory, Pattern Classification and Clustering Problem, Image compression, Encryption and Decryption problems, Density Classification problem etc.

arXiv comment17 pages, 41 figures, a portion of this paper is accepted in the journal as well as proceedings at WSEAS,2006

Cited by in corpus (6)

• A Cellular Automata based Optimal Edge Detection Technique using Twenty-Five Neighborhood Model
• A Survey on Two Dimensional Cellular Automata and Its Application in Image Processing
• Classification of Cellular Automata Rules Based on Their Properties
• Encompression Using Two-dimensional Cellular Automata Rules
• An Efficient Edge Detection Technique by Two Dimensional Rectangular Cellular Automata
• Issues on drawing the State Transition Diagram for arbitrary Cellular Automata