In this study, we present the idea of using secret bits to repair SMVQ-compressed images. The idea can be viewed as the optimization problem of Using Secret Bits for Image-block Repairing based on Differences under SMVQ (USBIRDS). We propose a novel algorithm named Greedy-USBIRDS to find a near optimal solution for the USBIRDS problem. The experimental results show that, the proposed method provides excellent stego-image quality and large embedding capacity, in particular for complex cover images. While compared with Chen and Lin’s steganographic method, which is the known best method based on VQ/SMVQ, the proposed method achieves about 53% more dB of PSNR of the stego-image quality and about 4.2% more bits of the embedding capacity on average.
CITATION STYLE
Wang, W. J., Huang, C. T., Tsuei, S. R., & Wang, S. J. (2015). Steganographic greedy algorithms for data hiding based on differences under SMVQ. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9023, pp. 599–612). Springer Verlag. https://doi.org/10.1007/978-3-319-19321-2_46
Mendeley helps you to discover research relevant for your work.