A locally adaptive data compression scheme
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Invertible Authentication Watermark for JPEG Images
ITCC '01 Proceedings of the International Conference on Information Technology: Coding and Computing
A Reversible Data Hiding Scheme with Modified Side Match Vector Quantization
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Reversible hiding in DCT-based compressed images
Information Sciences: an International Journal
Digital watermarking based on chaotic map and reference register
Pattern Recognition
Reversible information hiding for VQ indices based on locally adaptive coding
Journal of Visual Communication and Image Representation
Reversible data hiding of a VQ index table based on referred counts
Journal of Visual Communication and Image Representation
Reversible Steganography for VQ-Compressed Images Using Side Matching and Relocation
IEEE Transactions on Information Forensics and Security
A Reversible Data Hiding Scheme Based on Side Match Vector Quantization
IEEE Transactions on Circuits and Systems for Video Technology
High capacity reversible data hiding scheme based upon discrete cosine transformation
Journal of Systems and Software
Journal of Visual Communication and Image Representation
Hi-index | 0.00 |
Data hiding is designed to solve the problem of secure information exchange through public networks such as Internet. In this paper, we present an improved reversible data hiding scheme that can recover original VQ indices after data extraction. As with Chang et al.'s scheme, our proposed scheme also depends on the locally adaptive coding scheme. However, experimental results confirm that the hiding capacity of our proposed scheme is around 1.36 bpi in most digital images, which is typically higher than that of Chang et al.'s [17]. Moreover, the average compression rate that can be achieved with our proposed scheme is 0.49 bpp, which outperforms both Lin and Chang's scheme (0.50bpp), Tsai (0.50 bpp), Chang et al.'s scheme (0.53 bpp), and Yang and Lin's scheme (0.53 bpp).