• Title/Summary/Keyword: informed coding and embedding

Search Result 2, Processing Time 0.017 seconds

A Watermarking Method Based on the Informed Coding and Embedding Using Trellis Code and Entropy Masking (Trellis 부호 및 엔트로피 마스킹을 이용한 정보부호화 기반 워터마킹)

  • Lee, Jeong-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2677-2684
    • /
    • 2009
  • In this paper, we study a watermarking method based on the informed coding and embedding by means of trellis code and entropy masking. An image is divided as $8{\times}8$ block with no overlapping and the discrete cosine transform(DCT) is applied to each block. Then the 16 medium-frequency AC terms of each block are extracted. Next it is compared with gaussian random vectors having zero mean and unit variance. As these processing, the embedding vectors with minimum value of linear combination between linear correlation and Watson distance can be obtained by Viterbi algorithm at each stage of trellis coding. For considering the image characteristics, we apply different weight value between the linear correlation and the Watson distance using the entropy masking. To evaluate the performance of proposed method, the average bit error rate of watermark message is calculated from different several images. By the experiments the proposed method is improved in terms of the average bit error rate.

A Watermarking Method Based on the Trellis Code with Multi-layer (다층구조를 갖는 trellis부호를 이용한 워터마킹)

  • Lee, Jeong Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.949-952
    • /
    • 2009
  • In this paper, a watermarking method based on the trellis code with multi-layer is proposed. An image is divided $8{\times}8$ block with no overlapping, and compute the discrete cosine transform(DCT) of each block, and the 12 medium-frequency AC terms from each block are extracted. Next it is compared with gaussian random vectors with zero mean and unit variance. As these processing, the embedding vectors with minimum linear correlation can be obtained by Viterbi algorithm at each layer of trellis coding. To evaluate the performance of proposed method, the average bit error rate of watermark message is calculated from different several images.

  • PDF