|
|
Robust lossless data hiding scheme |
Xian-ting ZENG*,1,2, Xue-zeng PAN1, Ling-di PING1, Zhuo LI1 |
1 School of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China
2 College of Information Engineering, China Jiliang University, Hangzhou 310018, China
|
|
|
Abstract 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-1-zones to overlap, and robustness is achieved. The new embedding mechanism can enhance embedding capacity and the addition of a threshold can make the algorithm more robust. Experimental results showed that, compared with previous schemes, the performance of the proposed scheme is significantly improved.
|
Received: 29 March 2009
Published: 01 January 2010
|
|
Fund: Project supported in part by the Major Science and Technology Special Project of Zhejiang Province, China (No. 2007C11088) and the
Science and Technology Project of Zhejiang Province, China (No. 2008C21077) |
Robust lossless data hiding scheme
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-1-zones to overlap, and robustness is achieved. The new embedding mechanism can enhance embedding capacity and the addition of a threshold can make the algorithm more robust. Experimental results showed that, compared with previous schemes, the performance of the proposed scheme is significantly improved.
关键词:
Watermarking,
Lossless data hiding,
Reversible data hiding,
Robust lossless data hiding,
Semi-fragile authentication
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|