Image data hiding based on capacity-approaching dirty-paper coding

  • Yang Y
  • Sun Y
  • Stanković V
  • et al.
6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an image data-hiding scheme based on near-capacity dirty-paper codes. The scheme achieves high embedding rates by "hiding" information into mid-frequency DCT coefficients among each DCT block of the host image. To reduce the perceptual distortion due to data-hiding, the mid-frequency DCT coefficients are first perceptually scaled according to Watson's model. Then a rate-1/3 projection matrix in conjunction with a rate-1/5 capacity-approaching dirty-paper code is applied. We are able to embed 1500 information bits into 256 × 256 images, outperforming, under a Gaussian noise attack, currently the best known data-hiding scheme by 33%. Robustness tests against different attacks, such as low-pass filtering, image scaling, and lossy compression, show that our scheme is a good candidate for high-rate image data-hiding applications. © 2006 SPIE-IS&T.

Cite

CITATION STYLE

APA

Yang, Y., Sun, Y., Stanković, V., & Xiong, Z. (2006). Image data hiding based on capacity-approaching dirty-paper coding. In Security, Steganography, and Watermarking of Multimedia Contents VIII (Vol. 6072, p. 607214). SPIE. https://doi.org/10.1117/12.644908

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free