• Title/Summary/Keyword: cellular-automata

Search Result 332, Processing Time 0.03 seconds

Characterization of Hierarchical Cellular Automata (계층적 셀룰라 오토마타의 특성에 관한 연구)

  • Choi, U.S.;Cho, S.J.;Choi, H.H.
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.3
    • /
    • pp.493-499
    • /
    • 2008
  • Cellular Automata(CA) has been used as modeling and computing paradigm for a long time. And CA has been used to model many physical systems. While studying the models of such systems, it is seen that as the complexity of the physical system increase, the CA based model becomes very complex and becomes to difficult to track analytically. Also such models fail to recognize the presence of inherent hierarchical nature of a physical system. In this paper we give the characterization of Hierarchical Cellular Automata(HCA). Especially we analyze transition rules, characteristic polynomials and cyclic structures of HCA.

Image Encryption using LFSR and CAT (LFSR과 CAT을 이용한 영상 암호화)

  • Nam, Tae-Hee;Kim, Seok-Tae;Cho, Sung-Jin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.164-167
    • /
    • 2009
  • In this paper, we propose the image encryption using LFSR(Linear Feedback Shift Register) and 2D CAT(Two-Dimensional Cellular Automata Transform). First, a LFSR is used to create a PN(pseudo noise) sequence, which is identical to the size of the original image. Then, the created sequence goes through a XOR operation with the original image to convert the original image. Next, the gateway value is set to produce a 2D CAT basis function. Using the created basis function, multiplication is done with the converted original image to process 2D CAT image encipherment. Lastly, the stability analysis verifies that the proposed method holds a high encryption quality status.

  • PDF

Medical Image Watermarking Based on Visual Secret Sharing and Cellular Automata Transform for Copyright Protection

  • Fan, Tzuo-Yau;Chao, Her-Chang;Chieu, Bin-Chang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.6177-6200
    • /
    • 2018
  • In order to achieve the goal of protecting medical images, some existing watermark techniques for medical image protection mainly focus on improving the invisibility and robustness properties of the method, in order to prevent unnecessary medical disputes. This paper proposes a novel copyright method for medical image protection based on visual secret sharing (VSS) and cellular automata transform (CAT). This method uses the protected medical image feature as well as VSS and a watermark to produce the ownership share image (OSI). The OSI is used for medical image verification and must be registered to a certified authority. In the watermark extraction process, the suspected medical image is used to generate a master share image (MSI). The watermark can be extracted by combining the MSI and the OSI. Different from other traditional methods, the proposed method does not need to modify the medical image in order to protect the copyright of the image. Moreover, the registered OSI used to verify the ownership and its appearance display meaningful information, facilitating image management. Finally, the results of the final experiment can prove the effectiveness of our method.

Generation of Maximum Length Cellular Automata (최대길이를 갖는 셀룰라 오토마타의 생성)

  • Choi Un-Sook;Cho Sung-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.25-30
    • /
    • 2004
  • Linear cellular automata(CA) which generate maximum-length cycles, have wide applications in generation of pseudo-random patterns, signature analysis, cryptography and error correcting codes etc. Linear CA whose characteristic polynomial is primitive has been studied. In this paper Ive propose a effective method for generation of a variety of maximum-length CA(MLCA). And we show that the complemented CA's derived from a linear MLCA are all MLCA. Also we analyze the Properties of complemented MLCA. And we prove that the number of n-cell MLCA is ${\phi}(2^{n}-1)2^{n+1}$/n.

Synthesis of Symmetric 1-D 5-neighborhood CA using Krylov Matrix (Krylov 행렬을 이용한 대칭 1차원 5-이웃 CA의 합성)

  • Cho, Sung-Jin;Kim, Han-Doo;Choi, Un-Sook;Kang, Sung-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.6
    • /
    • pp.1105-1112
    • /
    • 2020
  • One-dimensional 3-neighborhood Cellular Automata (CA)-based pseudo-random number generators are widely applied in generating test patterns to evaluate system performance and generating key sequence generators in cryptographic systems. In this paper, in order to design a CA-based key sequence generator that can generate more complex and confusing sequences, we study a one-dimensional symmetric 5-neighborhood CA that expands to five neighbors affecting the state transition of each cell. In particular, we propose an n-cell one-dimensional symmetric 5-neighborhood CA synthesis algorithm using the algebraic method that uses the Krylov matrix and the one-dimensional 90/150 CA synthesis algorithm proposed by Cho et al. [6].

A ROI Image Encryption Algorithm Based on Cellular Automata in Real-Time Data Transmission Environment (실시간 데이터 전송 환경에서의 셀룰러 오토마타 기반의 ROI 이미지 암호 알고리즘)

  • Un-Sook Choi
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.6
    • /
    • pp.1117-1124
    • /
    • 2023
  • The security of information, including image content, is an essential part of today's communications technology and is critical to secure transmission. In this paper, a new ROI-based image encryption algorithm is proposed that can quickly encrypt images with a security level suitable for environments that require real-time data transmission for images containing sensitive information such as ID cards. The proposed algorithm is based on one dimensional 5-neighbor cellular automata, which can be implemented in hardware and performed hardware-friendly operations. Various experiments and analyses are performed to verify whether the proposed encryption algorithm is safe from various brute-force attacks.

Simulation of land use changes in Hanam city using an object-based cellular automata model (객체기반 셀룰러오토마타 모형을 이용한 하남시 토지이용변화 모의)

  • KIM, Il-Kwon;KWON, Hyuk-Soo
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.21 no.4
    • /
    • pp.202-217
    • /
    • 2018
  • Urban land use changes by human activities affect spatial configuration of urban areas and their surrounding ecosystems. Although it is necessary to identify patterns of urban land use changes and to simulate future changes for sustainable urban management, simulation of land use changes is still challenging due to their uncertainty and complexity. Cellular automata model is widely used to simulate urban land use changes based on cell-based approaches. However, cell-based models can not reflect features of actual land use changes and tend to simulate fragmented patterns. To solve these problems, object-based cellular automata models are developed, which simulate land use changes by land patches. This study simulate future land use changes in Hanam city using an object-based cellular automata model. Figure of merit of the model is 24.1%, which assess accuracy of the simulation results. When a baseline scenario was applied, urban decreased by 16.4% while agriculture land increased by 9.0% and grass increased by 19.3% in a simulation result of 2038 years. In an urban development scenario, urban increased by 22.4% and agriculture land decreased by 26.1% while forest and grass did not have significant changes. In a natural conservation scenario, urban decreased by 29.5% and agriculture land decreased by 8.8% while each forest and grass increased by 6% and 42.8%. The model can be useful to simulate realistic urban land use change effectively, and then, applied as a decision support tool for spatial planning.

High-resolution Urban Flood Modeling using Cellular Automata-based WCA2D in the Oncheon-cheon Catchment in Busan, South Korea (셀룰러 오토마타 기반 WCA2D 모형을 이용한 부산 온천천 유역 고해상도 도시 침수 해석)

  • Choi, Hyeonjin;Lee, Songhee;Woo, Hyuna;Noh, Seong Jin
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.43 no.5
    • /
    • pp.587-599
    • /
    • 2023
  • As climate change increasesthe frequency and risk of flooding in major cities around theworld, the importance ofsimulation technology that can quickly and accurately analyze high-resolution 2D flooding information in large-scale areasis emerging. The physically-based approaches based on the Shallow Water Equations (SWE) often requires huge computer resources hindering high-resolution flood prediction. This study investigated the theoretical background of Weighted Cellular Automata 2D (WCA2D), which simulates spatio-temporal changes offlooding using transition rules and weight-based system, and assessed feasibility to simulate pluvial flooding in the urbancatchment, theOncheon-cheon catchmentinBusan, SouthKorea.Inaddition,the computation performancewas compared by applying versions using OpenComputing Language (OpenCL) andOpenMulti-Processing (OpenMP) parallel computing techniques. Simulationresultsshowed that the maximuminundation depthmap by theWCA2Dmodel cansimilarly reproduce historical inundation maps. Also, it can precisely simulate spatio-temporal changes of flooding extent in the urban catchment with complex topographic characteristics. For computation efficiency, parallel computing schemes, theOpenCLandOpenMP, improved the computation by about 8~14 and 5~6 folds respectively, compared to the sequential computation.

Parallel Simulation of Cellular Automaton Models using a Cell Packing Scheme (원소 밀집을 이용한 원소오토마타 모델의 병렬 시뮬레이션)

  • Seong, Yeong-Rak
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.4
    • /
    • pp.883-891
    • /
    • 1998
  • This paper proposes a scheme to exploit SIMD parallelism in the simulation of Cellular Automata models. The basic idea is to increase the utilization of an ALU in the underlying computer and to reduce simulation time by exploiting the parallelism. Thus, several cells are packed into a computer word and transit their state together. To show the performance of the proposed simulation scheme, two Cellular Automata models are simulated under three distinct hardware environments. The results show considerably high simulation speed-up for every case. Especially, the simulation speedup with the proposed simulation scheme reaches nearly 20 times in the best case.

  • PDF

A New Mathematical Model for Optimum Production of Neural Stem Cells in Large-scale

  • Hossain, S.M. Zakir;Sultana, Nahid;Babar, S.M. Enayetul;Haki, G.D.
    • Molecular & Cellular Toxicology
    • /
    • v.3 no.2
    • /
    • pp.77-84
    • /
    • 2007
  • Millions of individuals worldwide are currently afflicted with neurodegenerative disorders such as Parkinson's disease and multiple sclerosis which are caused by the death of specific types of specialized cells in the Central Nervous System (CNS). Recently, Neural Stem Cells (NSCs) are able to replace these dead cells with new functional cells, thereby providing a cure for devastating neural diseases. The clinical use of neural stem cells (NSCs) for the treatment of neurological diseases requires overcoming the scarcity of the initial in vivo NSC population. Thus, we developed a novel 3-dimentional cellular automata model for optimum production of neural stem cells and their derivatives in large scale to treat neurodegenerative disorder patients.