Improving embedding efficiency of covering codes for applications in steganography

被引:61
作者
Zhang, Weiming [1 ]
Wang, Shuozhong
Zhang, Xinpeng
机构
[1] Shanghai Univ, Sch Commun & Informat Engn, Shanghai 200076, Peoples R China
[2] Informat Engn Inst, Dept Informat Res, Zhengzhou 450002, Peoples R China
基金
中国国家自然科学基金;
关键词
covert communication; steganography; embedding efficiency; covering codes; matrix encoding;
D O I
10.1109/LCOMM.2007.070438
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In image steganography, each pixel can carry a ternary message by choosing adding/subtracting one to/from the gray value. Although ternary covering functions can provide embedding efficiency higher than binary ones, it is necessary to convert the binary message into a ternary format. We propose a novel method that improves the embedding efficiency of binary covering functions by fully exploiting the information contained in the choice of addition or subtraction in the embedding. The improved scheme can perform, equally well with, or even outperform, ternary covering functions without ternary conversion of the message.
引用
收藏
页码:680 / 682
页数:3
相关论文
共 11 条
[1]  
BIERBRAUER J, 2006, INTRO CODING THEORY
[2]  
BIERBRAUER J, 2006, CONSTRUCTING GOOD CO
[3]  
Crandall R, 1998, Some notes on steganograohy [EB/OL]
[4]   Matrix embedding for large payloads [J].
Fridrich, Jessica ;
Soukal, David .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2006, 1 (03) :390-395
[5]  
GALAND F, 2004, P IEEE INF THEOR WOR, P151
[6]   LSB matching revisited [J].
Mielikainen, J .
IEEE SIGNAL PROCESSING LETTERS, 2006, 13 (05) :285-287
[7]  
Schonfeld D., 2006, P 8 WORKSH MULT SEC, P214
[8]   A secure data hiding scheme for binary images [J].
Tseng, YC ;
Chen, YY ;
Pan, HK .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (08) :1227-1231
[9]  
WESTFELD A, 2001, LNCS, V2137, P289, DOI DOI 10.1007/3-540-45496-9_
[10]   Capacity and codes for embedding information in gray-scale signals [J].
Willems, FMJ ;
van Dijk, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) :1209-1214