Introduction to data compression
Introduction to data compression
DE-based reversible data hiding with improved overflow location map
IEEE Transactions on Circuits and Systems for Video Technology
Complete video quality-preserving data hiding
IEEE Transactions on Circuits and Systems for Video Technology
Reversible image watermarking using interpolation technique
IEEE Transactions on Information Forensics and Security
Lossless generalized-LSB data embedding
IEEE Transactions on Image Processing
Expansion Embedding Techniques for Reversible Watermarking
IEEE Transactions on Image Processing
Reversible data embedding using a difference expansion
IEEE Transactions on Circuits and Systems for Video Technology
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
By reversible data hiding, the original cover can be losslessly restored after the embedded information is extracted. Kalker and Willems established a rate-distortion model for reversible data hiding, in which they proved the capacity bound and proposed a recursive code construction. In this paper we improve the recursive construction by designing a data embedding method for all-zero covers and a more efficient compression algorithm. We prove that the proposed codes can approach the capacity bound under various distortion constraints. We also apply this coding method to RS method for spatial images, and the experimental results show that the novel codes can significantly reduce the embedding distortion.