Analysis of Block Coding Strategies in Watermarking Channel
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Robustness is one of the important requirements of digital watermark. To improve the robustness of watermarks, some algorithms proposed to apply error correcting coding (ECC) in watermarking, intending to lower the detection error rate by correcting some errors. However, there is an important difference between the watermarking channel and the conventional communication channel. Owing to the constraints of imperceptibility, the redundancy introduced by ECC will result in a decrease of embedding strength for watermarking. In other words, the coding rate of ECC affects the amplitude of embedding signal. Hence, a question arises: For improving watermark robustness, how to choose the coding rate of ECC? In this paper, this problem is addressed both analytically and experimentally. By employing Plotkin Bound and Hamming Bound, the coding rate constraints of Q-symbol linear block codes are derived. The conclusions are demonstrated by the experiment results.

    Reference
    Related
    Cited by
Get Citation

谷利民,黄继武.数字水印信道中的分组码编码策略分析.软件学报,2004,15(9):1413-1422

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 27,2003
  • Revised:March 31,2004
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063