• Title/Summary/Keyword: Cellular automata method

Search Result 104, Processing Time 0.025 seconds

Image Encryption using 90/150 NBCA structure (90/150 NBCA 구조를 이용한 영상 암호화)

  • Nam, Tae-Hee;Kim, Seok-Tae;Cho, Sung-Jin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.152-155
    • /
    • 2009
  • In this paper, we propose the image encryption method using complemented MLCA based on 90/150 NBCA(Null Boundary Cellular Automata). The encryption method is processed in the following order. First, complemented MLCA, which is derived from linear LFSR, is used to produce a PN(pseudo noise) sequence, which matches the size of the original image. Then, the created complemented MLCA sequence goes through a XOR operation with the original image to become encrypted. Lastly, an experiment is processed to verify the effectiveness of this method.

  • PDF

A Novel Watermarking using Cellular Automata Transform (셀룰러 오토마타 변환을 이용한 새로운 워터마킹)

  • Piao, Yong-Ri;Kim, Seok-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.155-158
    • /
    • 2008
  • In this paper, we propose a novel blind watermarking Method using 2D CAT (Two dimensional cellular automata transform). In our scheme, firstly, we obtain the gateway values to generate a dual-state, dual-coefficients basis function. Secondly, the basis function transforms images into cellular automata space. Lastly, we use the cellular automata transform coefficients to embed random noise watermark in the cover images. The proposed scheme allows only one 2D CAT basis function per gateway value. Since there are $2^{96}$ possible gateway values, better security is guaranteed. Moreover, the new method not only verifies higher fidelity than the existing method but also stronger stability on JPEG lossy compression, filtering, sharpening and noise through tests for robustness.

  • PDF

Image Encryption Based on One Dimensional Nonlinear Group Cellular Automata (1차원 비선형 그룹 셀룰라 오토마타 기반의 영상 암호)

  • Choi, Un-Sook;Cho, Sung-Jin;Kim, Tae-Hong
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.12
    • /
    • pp.1462-1467
    • /
    • 2015
  • Pixel values of original image can be changed by XORing pixel values of original image and pixel values of the basis image obtained by pseudo random sequences. This is a simple method for image encryption. This method is an effect method for easy hardware implementation and image encryption with high speed. In this paper we propose a method to obtain basis image with pseudo random sequences with large nonlinearity using nonlinear cellular automata and maximum length linear cellular automata. And experimental results showed that the proposed image encryption scheme has large key space and low correlation of adjacent cipher pixel values.

Analysis of Hybrid Additive Cellular Automata (하이브리드 가산 셀룰라 오토마타의 분석)

  • Cho, Sung-Jin;Choi, Un-Sook;Kim, Han-Doo;Hwang, Yoon-Hee;Kim, Jin-Gyoung;Kim, Bong-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.221-224
    • /
    • 2008
  • Anghelescu et al. proposed a block cryptosystem based on 8-cell hybrid additive cellular automata with cycle length 8 using state transition rules 51, 60 (or 102). All states must divided into the same cycles in the diagram of the cellular automata. But there exist cellular automata which don't satisfy this condition in Anghelescu et al.'s cryptosystem. In this paper we analyze hybrid additive cellular automata and propose an improved method.

  • PDF

Image Encryption using Complemented MLCA based on IBCA and 2D CAT (IBCA에 기초한 여원 MLCA와 2D CAT를 이용한 영상 암호화)

  • Nam, Tae-Hee;Kim, Seok-Tae;Cho, Sung-Jin
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.4
    • /
    • pp.34-41
    • /
    • 2009
  • In this paper we propose a new image encryption method which utilizes Complemented MLCA(Complemented Maximum Length Cellular Automata) based on IBCA(Intermediate Boundary CA) and 2D CAT(Cellular Automata Transform). The encryption method is processed in the following order. First, Complemented MLCA is used to create a PN (pseudo noise) sequence, which matches the size of the original image. And, the original image goes through a XOR operation with the created sequence to convert the image into Complemented MLCA image. Then, the gateway value is set to produce a 2D CAT basis function. The produced basis function is multiplied by the encrypted MLCA image that has been converted to process the encipherment. Lastly, the stability analysis and PSNR(Peak Signal to Noise Ratio) verifies that the proposed method holds a high encryption quality status.

Inversion of Spread-Direction and Alternate Neighborhood System for Cellular Automata-Based Image Segmentation Framework

  • Lee, Kyungjae;Lee, Junhyeop;Hwang, Sangwon;Lee, Sangyoun
    • Journal of International Society for Simulation Surgery
    • /
    • v.4 no.1
    • /
    • pp.21-23
    • /
    • 2017
  • Purpose In this paper, we proposed alternate neighborhood system and reverse spread-direction approach for accurate and fast cellular automata-based image segmentation method. Materials and Methods On the basis of a simple but effective interactive image segmentation technique based on a cellular automaton, we propose an efficient algorithm by using Moore and designed neighborhood system alternately and reversing the direction of the reference pixels for spreading out to the surrounding pixels. Results In our experiments, the GrabCut database were used for evaluation. According to our experimental results, the proposed method allows cellular automata-based image segmentation method to faster while maintaining the segmentation quality. Conclusion Our results proved that proposed method improved accuracy and reduced computation time, and also could be applied to a large range of applications.

Noise Reduction Method for Image Using Transition-Parameter of Cellular Automata (셀룰러 오토마타의 천이 파라미터를 이용한 영상의 잡음제거 방법)

  • Kim, Tai-Suk;Lee, Seok-Ki;Kwon, Soon-Kak;Kwon, Oh-Jun
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.9
    • /
    • pp.1329-1336
    • /
    • 2010
  • Cellular Automata is a discrete dynamical system which natural phenomena may be specified completely in terms of local relation, can increase and decrease the difference of luminance locally according to transition rule by keeping the characteristic of target image. In this paper, we propose a noise reduction method by keeping the characteristic using transition rule of Cellular Automata, also we propose methods of effective transition rule, the selection of parameters, the selection of number of neighborhood pixels. For uniform distribution noise, Gaussian noise, impulse noise, we do an experiment on adaptive state using different mathematical operations and compare its results. It was confirmed that the proposed transition rule is based on fast convergence speed and has stabile results.

A Potts Automata algorithm for Noise Removal and Edge Detection (Potts Automata를 이용한 영상의 잡음 제거 및 에지 주줄)

  • 이석기;김석태;조성진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3C
    • /
    • pp.327-335
    • /
    • 2003
  • Cellular Automata is discrete dynamical systems which natural phenomena may be specified completely in terms of local relation. In this Paper we Propose noise removal and edge detection algorithm using a Potts Automata which is based on Cellular Automata. The proposed method is aimed to locally increase or decrease the differences in gray level values between pixel of the image without loss of the main characteristics of the image. The dynamical behavior of these automata is determined by Lyapunov operators for sequential and parallel update. We have found that proposed automata rules Present very fast convergence to fixed points, stability in front of random noisy images. Based on the experimental results we discuses the advantage and efficiency.

Cellular Automata Transform based Invisible Digital Watermarking in Middle Domain for Gray Images

  • Li, Xiao-Wei;Kim, Seok-Tae
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.6
    • /
    • pp.689-694
    • /
    • 2011
  • Cellular automata are discrete dynamical systems, which provide the basis for the synthesis of complex emergent behavior. This paper proposes a new algorithm of digital watermarking based on cellular automata transform (CAT). The idea of two-dimensional CAT is introduced into the algorithm. After the original image is disassembled with 2D CAT, the watermark information is embedded into the Middle-frequency of the carrier picture. Cellular automata have a huge number of combinations, such as gateway values, rule numbers, initial configuration, boundary condition, etc. Using CAT, the robustness of the watermark will be tremendous strengthened as well as its imperceptibility. Experimental results show that this algorithm can resist some usual attacks such as compression, sharpening and so on. The proposed method is robust to different attacks and is more security.

Digital Watermarking using Multi-resolution Characteristic of 2D Cellular Automata Transform (다 해상도 특성을 갖는 2D 셀룰러 오토마타 변환을 이용한 디지털 워터마킹)

  • Piao, Yong-Ri;Kim, Seok-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.105-112
    • /
    • 2009
  • In this paper, we propose a digital watermarking method using Multi-resolution Characteristic of 2D CAT (2D cellular automata transform). Firstly, we select the gateway values to generate a basis function and the basis function transforms images into cellular automata space. Then, we embed the random bit sequence as watermark in specific parts of cellular automata transform coefficients. The proposed method not only verifies higher fidelity than the existing method but also stronger stability on JPEG lossy compression, filtering, sharpening and noise through tests for robustness. Moreover, the proposed scheme allows only one 2D CAT basis function per gateway value. Since there are $2^{96}$ possible gateway values.