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.
Relation:
International Conference on Audio, Language and Image Processing (ICALIP 2008) , pp. 490-494 , 2008-07. Shanghai, China.
