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

Y. Yang, Y. Sun, V. Stankovic, Z.X. Xiong

Research output: Contribution to conferencePaper

6 Citations (Scopus)


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 x 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.
Original languageEnglish
Publication statusPublished - Jan 2006
EventConference on Security, Steganography and Watermarking of Multimedia Contents VIII - San Jose, United States
Duration: 16 Jan 200619 Jan 2006


ConferenceConference on Security, Steganography and Watermarking of Multimedia Contents VIII
Country/TerritoryUnited States
CitySan Jose


  • image
  • data-hiding
  • capacity-approaching
  • dirty-paper coding
  • watermarking
  • robustness
  • perceptual shaping

Cite this