DocumentCode
2423377
Title
Generalized running coding for efficient data hiding
Author
Chang, Chinchen ; Zhang, Xinpeng ; Wang, Shuozhong
Author_Institution
Dept. of Inf. Eng. & Comput. Sci., Feng Chia Univ., Taichung
fYear
2008
fDate
7-9 July 2008
Firstpage
490
Lastpage
494
Abstract
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.
Keywords
cryptography; data encapsulation; image coding; cover value; data hiding; generalized running coding method; image coding; prime-base notational system; steganography; Computer science; Data encapsulation; Data engineering; Data mining; Encoding; Image coding; Linear code; Payloads; Performance analysis; Steganography;
fLanguage
English
Publisher
ieee
Conference_Titel
Audio, Language and Image Processing, 2008. ICALIP 2008. International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4244-1723-0
Electronic_ISBN
978-1-4244-1724-7
Type
conf
DOI
10.1109/ICALIP.2008.4590038
Filename
4590038
Link To Document