会议专题

Generalized Running Coding for Efficient Data Hiding

This paper generalizes the running coding method for efficient data hiding. In this way, each secret digit in a prime-base notational system is represented by a series of cover values. Modification on one cover value can be used to embed several secret digits, so that distortion is significantly reduced. The original running coding method can be viewed as a special case of the generalized scheme with a prime base p=2. And theoretical analysis shows that the generalized running coding with p=3 can provide the best performance.

Chinchen Chang Xinpeng Zhang Shuozhong Wang

Department of Information Engineering and Computer Science, Feng Chia University, Taiwan School of Communication and Information Engineering, Shanghai University, China

国际会议

2008 International Conference on Audio,Language and Image Processing(2008国际声音、语言、图像过程大会)

镇江

英文

490-494

2008-07-07(万方平台首次上网日期,不代表论文的发表时间)