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)

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 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.

Conference

ConferenceConference on Security, Steganography and Watermarking of Multimedia Contents VIII
CountryUnited States
CitySan Jose
Period16/01/0619/01/06

Keywords

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

Cite this

Yang, Y., Sun, Y., Stankovic, V., & Xiong, Z. X. (2006). Image data-hiding based on capacity approaching dirty-paper coding. Paper presented at Conference on Security, Steganography and Watermarking of Multimedia Contents VIII , San Jose, United States. https://doi.org/10.1117/12.644908
Yang, Y. ; Sun, Y. ; Stankovic, V. ; Xiong, Z.X. / Image data-hiding based on capacity approaching dirty-paper coding. Paper presented at Conference on Security, Steganography and Watermarking of Multimedia Contents VIII , San Jose, United States.
@conference{06552c0bc11640e58139ab3dc8fe8ff8,
title = "Image data-hiding based on capacity approaching dirty-paper coding",
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 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.",
keywords = "image, data-hiding, capacity-approaching, dirty-paper coding, watermarking, robustness , perceptual shaping",
author = "Y. Yang and Y. Sun and V. Stankovic and Z.X. Xiong",
year = "2006",
month = "1",
doi = "10.1117/12.644908",
language = "English",
note = "Conference on Security, Steganography and Watermarking of Multimedia Contents VIII ; Conference date: 16-01-2006 Through 19-01-2006",

}

Yang, Y, Sun, Y, Stankovic, V & Xiong, ZX 2006, 'Image data-hiding based on capacity approaching dirty-paper coding' Paper presented at Conference on Security, Steganography and Watermarking of Multimedia Contents VIII , San Jose, United States, 16/01/06 - 19/01/06, . https://doi.org/10.1117/12.644908

Image data-hiding based on capacity approaching dirty-paper coding. / Yang, Y.; Sun, Y.; Stankovic, V.; Xiong, Z.X.

2006. Paper presented at Conference on Security, Steganography and Watermarking of Multimedia Contents VIII , San Jose, United States.

Research output: Contribution to conferencePaper

TY - CONF

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

AU - Yang, Y.

AU - Sun, Y.

AU - Stankovic, V.

AU - Xiong, Z.X.

PY - 2006/1

Y1 - 2006/1

N2 - 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.

AB - 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.

KW - image

KW - data-hiding

KW - capacity-approaching

KW - dirty-paper coding

KW - watermarking

KW - robustness

KW - perceptual shaping

U2 - 10.1117/12.644908

DO - 10.1117/12.644908

M3 - Paper

ER -

Yang Y, Sun Y, Stankovic V, Xiong ZX. Image data-hiding based on capacity approaching dirty-paper coding. 2006. Paper presented at Conference on Security, Steganography and Watermarking of Multimedia Contents VIII , San Jose, United States. https://doi.org/10.1117/12.644908