A locally adaptive data compression scheme
Communications of the ACM
Introduction to Cryptography: With Coding Theory
Introduction to Cryptography: With Coding Theory
A difference expansion oriented data hiding scheme for restoring the original host images
Journal of Systems and Software
Reversible information hiding for VQ indices based on locally adaptive coding
Journal of Visual Communication and Image Representation
A reversible data hiding scheme for VQ indices using locally adaptive coding
Journal of Visual Communication and Image Representation
Side match and overlap match vector quantizers for images
IEEE Transactions on Image Processing
A novel VQ-based reversible data hiding scheme by using hybrid encoding strategies
Journal of Systems and Software
Hi-index | 0.00 |
Reversible data hiding is a method that not only embeds secret data but also reconstructs the original cover image without distortion after the confidential data are extracted. In this paper, we propose novel reversible data hiding scheme that can embed high capacity of secret bits and recover image after data extraction. Our proposed scheme depends on the locally adaptive coding scheme (LAC) as Chang&Nguyen's scheme and SMVQ scheme. Experimental results show that the compression rate of our proposed scheme is 0.33bpp on average. To embed secret bits we propose the normal-hiding scheme and the over-hiding scheme which have an average embedding rate of 2.01bpi and 3.01bpi, more than that of Chang&Nguyen's scheme (1.36bpi). The normal-hiding scheme and the over-hiding scheme also has high embedding efficiency of 0.28 and 0.36 on average, which are better than that of Chang&Kieu's scheme (0.12), Chang&Nguyen's scheme (0.18) and Chang&Nguyen's scheme (0.16).