Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the ch...Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the chaotic nature of grain structures, some of the most popular routines are based on the Monte Carlo method, statistical distributions, and random walk methods, which can be easily programmed and included in nested loops. Nevertheless, grain structures are not well defined as the results of computational errors and numerical incon- sistencies on mathematical methods. Due to the finite definition of numbers or the numerical restrictions during the simulation of solidifica- tion, damaged images appear on the screen. These images must be repaired to obtain a good measurement of grain geometrical properties. Some mathematical algorithms were developed to repair, measure, and characterize grain structures obtained from cellular automata in the present work. An appropriate measurement of grain size and the corrected identification of interfaces and length are very important topics in materials science because they are the representation and validation of mathematical models with real samples. As a result, the developed al- gorithms are tested and proved to be appropriate and efficient to eliminate the errors and characterize the grain structures.展开更多
In this paper,a new scheme for image encryption is presented by reversible cellular automata.The presented scheme is applied in three individual steps.Firstly,the image is blocked and the pixels are substituted by a r...In this paper,a new scheme for image encryption is presented by reversible cellular automata.The presented scheme is applied in three individual steps.Firstly,the image is blocked and the pixels are substituted by a reversible cellular automaton.Then,image pixels are scrambled by an elementary cellular automata and finally the blocks are attached and pixels are substituted by an individual reversible cellular automaton.Due to reversibility of used cellular automata,decryption scheme can reversely be applied.The experimental results show that encrypted image is suitable visually and this scheme has satisfied quantitative performance.展开更多
Purpose–The purpose of this paper is to investigate two-dimensional outer totalistic cellular automata(2D-OTCA)rules other than the Game of Life rule for image scrambling.This paper presents a digital image scramblin...Purpose–The purpose of this paper is to investigate two-dimensional outer totalistic cellular automata(2D-OTCA)rules other than the Game of Life rule for image scrambling.This paper presents a digital image scrambling(DIS)technique based on 2D-OTCA for improving the scrambling degree.The comparison of scrambling performance and computational effort of proposed technique with existing CA-based image scrambling techniques is also presented.Design/methodology/approach–In this paper,a DIS technique based on 2D-OTCA with von Neumann neighborhood(NvN)is proposed.Effect of three important cellular automata(CA)parameters on gray difference degree(GDD)is analyzed:first the OTCA rules,afterwards two different boundary conditions and finally the number of CA generations(k)are tested.The authors selected a random sample of gray-scale images from the Berkeley Segmentation Data set and Benchmark,BSDS300(www2.eecs.berkeley.edu/Research/Projects/CS/vision/bsds/)for the experiments.Initially,the CA is setup with a random initial configuration and the GDD is computed by testing all OTCA rules,one by one,for CA generations ranging from 1 to 10.A subset of these tested rules produces high GDD values and shows positive correlation with the k values.Subsequently,this sample of rules is used with different boundary conditions and applied to the sample image data set to analyze the effect of these boundary conditions on GDD.Finally,in order to compare the scrambling performance of the proposed technique with the existing CA-based image scrambling techniques,the authors use same initial CA configuration,number of CA generations,k紏10,periodic boundary conditions and the same test images.Findings–The experimental results are evaluated and analyzed using GDD parameter and then compared with existing techniques.The technique results in better GDD values with 2D-OTCA rule 171 when compared with existing techniques.The CPU running time of the proposed algorithm is also considerably small as compared to existing techniques.Originality/value–In this paper,the authors focused on using von Neumann neighborhood(NvN)to evolve the CA for image scrambling.The use of NvN reduced the computational effort on one hand,and reduced the CA rule space to 1,024 as compared to about 2.62 lakh rule space available with Moore neighborhood(NM)on the other.The results of this paper are based on original analysis of the proposed work.展开更多
文摘Computational models are developed to create grain structures using mathematical algorithms based on the chaos theory such as cellular automaton, geometrical models, fractals, and stochastic methods. Because of the chaotic nature of grain structures, some of the most popular routines are based on the Monte Carlo method, statistical distributions, and random walk methods, which can be easily programmed and included in nested loops. Nevertheless, grain structures are not well defined as the results of computational errors and numerical incon- sistencies on mathematical methods. Due to the finite definition of numbers or the numerical restrictions during the simulation of solidifica- tion, damaged images appear on the screen. These images must be repaired to obtain a good measurement of grain geometrical properties. Some mathematical algorithms were developed to repair, measure, and characterize grain structures obtained from cellular automata in the present work. An appropriate measurement of grain size and the corrected identification of interfaces and length are very important topics in materials science because they are the representation and validation of mathematical models with real samples. As a result, the developed al- gorithms are tested and proved to be appropriate and efficient to eliminate the errors and characterize the grain structures.
文摘In this paper,a new scheme for image encryption is presented by reversible cellular automata.The presented scheme is applied in three individual steps.Firstly,the image is blocked and the pixels are substituted by a reversible cellular automaton.Then,image pixels are scrambled by an elementary cellular automata and finally the blocks are attached and pixels are substituted by an individual reversible cellular automaton.Due to reversibility of used cellular automata,decryption scheme can reversely be applied.The experimental results show that encrypted image is suitable visually and this scheme has satisfied quantitative performance.
文摘Purpose–The purpose of this paper is to investigate two-dimensional outer totalistic cellular automata(2D-OTCA)rules other than the Game of Life rule for image scrambling.This paper presents a digital image scrambling(DIS)technique based on 2D-OTCA for improving the scrambling degree.The comparison of scrambling performance and computational effort of proposed technique with existing CA-based image scrambling techniques is also presented.Design/methodology/approach–In this paper,a DIS technique based on 2D-OTCA with von Neumann neighborhood(NvN)is proposed.Effect of three important cellular automata(CA)parameters on gray difference degree(GDD)is analyzed:first the OTCA rules,afterwards two different boundary conditions and finally the number of CA generations(k)are tested.The authors selected a random sample of gray-scale images from the Berkeley Segmentation Data set and Benchmark,BSDS300(www2.eecs.berkeley.edu/Research/Projects/CS/vision/bsds/)for the experiments.Initially,the CA is setup with a random initial configuration and the GDD is computed by testing all OTCA rules,one by one,for CA generations ranging from 1 to 10.A subset of these tested rules produces high GDD values and shows positive correlation with the k values.Subsequently,this sample of rules is used with different boundary conditions and applied to the sample image data set to analyze the effect of these boundary conditions on GDD.Finally,in order to compare the scrambling performance of the proposed technique with the existing CA-based image scrambling techniques,the authors use same initial CA configuration,number of CA generations,k紏10,periodic boundary conditions and the same test images.Findings–The experimental results are evaluated and analyzed using GDD parameter and then compared with existing techniques.The technique results in better GDD values with 2D-OTCA rule 171 when compared with existing techniques.The CPU running time of the proposed algorithm is also considerably small as compared to existing techniques.Originality/value–In this paper,the authors focused on using von Neumann neighborhood(NvN)to evolve the CA for image scrambling.The use of NvN reduced the computational effort on one hand,and reduced the CA rule space to 1,024 as compared to about 2.62 lakh rule space available with Moore neighborhood(NM)on the other.The results of this paper are based on original analysis of the proposed work.