Handling uneven embedding capacity in binary images: A revisit

被引:5
作者
Wu, M [1 ]
Fridrich, J [1 ]
Goljan, B [1 ]
Gou, HM [1 ]
机构
[1] Univ Maryland, ECE Dept, College Pk, MD 20742 USA
来源
SECURITY, STEGANOGRAPHY, AND WATERMARKING OF MULTIMEDIA CONTENTS VII | 2005年 / 5681卷
关键词
data hiding; binary image; wet-paper codes; uneven embedding capacity;
D O I
10.1117/12.587379
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hiding data in binary images can facilitate the authentication and annotation of important document images in digital domain. A representative approach is to first identify pixels whose binary color can be flipped without introducing noticeable artifacts, and then embed one bit in each non-overlapping block by adjusting the flippable pixel values to obtain the desired block parity. The distribution of these flippable pixels is highly uneven across the image, which is handled by random shuffling in the literature. In this paper, we revisit the problem of data embedding for binary images and investigate the incorporation of a most recent steganography framework known as the wetpaper coding to improve the embedding capacity. The wet paper codes naturally handle the uneven embedding capacity through randomized projections. In contrast to the previous approach, where only a small portion of the flippable pixels are actually utilized in the embedding, the wet paper codes allow for a high utilization of pixels that have high flippability score for embedding, thus giving a significantly improved embedding capacity than the previous approach. The performance of the proposed technique is demonstrated on several representative images. We also analyze the perceptual impact and capacity-robustness relation of the new approach.
引用
收藏
页码:194 / 205
页数:12
相关论文
共 23 条
[1]   On the limits of steganography [J].
Anderson, RJ ;
Petitcolas, FAP .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (04) :474-481
[2]   Random Krylov spaces over finite fields [J].
Brent, RP ;
Gao, SH ;
Lauder, AGB .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (02) :276-287
[3]   APPLICATIONS OF CODING THEORY TO COMMUNICATION COMBINATORIAL PROBLEMS [J].
COHEN, GD .
DISCRETE MATHEMATICS, 1990, 83 (2-3) :237-248
[4]  
Cooper C, 2000, RANDOM STRUCT ALGOR, V16, P209, DOI 10.1002/(SICI)1098-2418(200003)16:2<209::AID-RSA6>3.0.CO
[5]  
2-1
[6]  
Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
[7]  
FRIDRICH I, 2004, P ACM MULT SEC WORKS, P4
[8]  
FRIDRICH J, 2005, SPIE ELECT IMAGING S
[9]  
FRIDRICH J, 2005, 7 INT WORKSH INF HID
[10]  
FRIDRICH J, 2005, UNPUB IEEE T SIG P