Robust lossless data hiding scheme

作     者：Xian-ting ZENG Xue-zeng PAN Ling-di PING Zhuo LI 

作者机构：School of Computer Science and Technology Zhejiang University Hangzhou 310027 China College of Information Engineering China Jiliang University Hangzhou 310018 China 

出 版 物：《Journal of Zhejiang University-Science C(Computers and Electronics)》 (浙江大学学报C辑（计算机与电子（英文版）)

年 卷 期：2010年第11卷第2期

页      面：101-110页

核心收录：

学科分类：0810[工学-信息与通信工程] 08[工学] 0839[工学-网络空间安全] 0805[工学-材料科学与工程（可授工学、理学学位）] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported in part by the Major Science and Technology Special Project of Zhejiang Province, China (No. 2007C11088) the Science and Technology Project of Zhejiang Province, China (No. 2008C21077) 

主　　题：Watermarking Lossless data hiding Reversible data hiding Robust lossless data hiding Semi-fragile authentication 

摘      要：This paper presents a robust lossless data hiding scheme. The original cover image can be recovered without any distortion after data extraction if the stego-image remains intact, and conversely, the hidden data can still be extracted correctly if the stego-image goes through JPEG compression to some extent. A cover image is divided into a number of non-overlapping blocks, and the arithmetic difference of each block is calculated. By shifting the arithmetic difference value, we can embed bits into the blocks. The shift quantity and shifting rule are fixed for all blocks, and reversibility is achieved. Furthermore, because the bit-0- and bit-1-zones are separated and the particularity of the arithmetic differences, minor changes applied to the stego-image generated by non-malicious attacks such as JPEG compression will not cause the bit-0- and bit-l-zones to overlap, and robustness is achieved. The new embedding mechanism can enhance embedding capacity and the addition of a threshold can make the al- gorithm more robust. Experimental results showed that, compared with previous schemes, the performance of the proposed scheme is significantly improved.