A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Lossless recovery of a VQ index table with embedded secret data
Journal of Visual Communication and Image Representation
A multiple-level visual secret-sharing scheme without image size expansion
Information Sciences: an International Journal
A high quality steganographic method with pixel-value differencing and modulus function
Journal of Systems and Software
A novel secret image sharing scheme in color images using small shadow images
Information Sciences: an International Journal
A novel lossless data compression scheme based on the error correcting Hamming codes
Computers & Mathematics with Applications
High-performance JPEG steganography using complementary embedding strategy
Pattern Recognition
High-capacity reversible data hiding in binary images using pattern substitution
Computer Standards & Interfaces
Reversible data hiding of a VQ index table based on referred counts
Journal of Visual Communication and Image Representation
A path optional lossless data hiding scheme based on VQ joint neighboring coding
Information Sciences: an International Journal
Secret image sharing based on cellular automata and steganography
Pattern Recognition
Segmentation of Multivariate Mixed Data via Lossy Data Coding and Compression
IEEE Transactions on Pattern Analysis and Machine Intelligence
Lossless generalized-LSB data embedding
IEEE Transactions on Image Processing
Hi-index | 0.00 |
In this paper, we propose a reversible data hiding technology based on a Vector Quantization (VQ) index table. To improve the hiding capacity, every VQ image has its own corresponding codebook in which the index sequence is reorganized according to the index appearance frequency in the VQ index table. Our proposed scheme is flexible in hiding capacity. That is, the proposed scheme can meet the needs of the user who wants to embed a large amount of secret information in an image and the user who desires a compact final output. The experimental results show that our proposed scheme offers good data hiding capacity and has a good bit rate. Furthermore, to illustrate the performance of our proposed scheme, it was compared with the scheme that Yang and Lin proposed in 2009. Experimental results show that our proposed scheme outperforms the scheme proposed by Yang and Lin.