Journal of Broadcast Engineering (방송공학회논문지)

The Korean Institute of Broadcast and Media Engineers (한국방송∙미디어공학회)
권호 표지

Enhancing Robustness of Information Hiding Through Low-Density Parity-Check Codes

  • Yi, Yu (Institute of Information & Communication, Chonbuk National Univ.) ;
  • Lee, Moon-Ho (Institute of Information & Communication, Chonbuk National Univ.) ;
  • Kim, Ji-Hyun (Institute of Information & Communication, Chonbuk National Univ.) ;
  • Hwang, Gi-Yean (Institute of Information & Communication, Chonbuk National Univ.)
  • Published : 2003.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

With the rapid growth of internet technologies and wide availability of multimedia computing facilities, the enforcement of multimedia copyright protection becomes an important issue. Digital watermarking is viewed as an effective way to deter content users from illegal distributions. In recent years, digital watermarking has been intensively studied to achieve this goal. However, when the watermarked media is transmitted over the channels modeled as the additive white Gaussian noise (AWGN) channel, the watermark information is often interfered by the channel noise and produces a large number of errors. So many error-correcting codes have been applied in the digital watermarking system to protect the embedded message from the disturbance of the noise, such as BCH codes, Reef-Solomon (RS) codes and Turbo codes. Recently, low-density parity-check (LDPC) codes were demonstrated as good error correcting codes achieving near Shannon limit performance and outperforming turbo codes nth low decoding complexity. In this paper, in order to mitigate the channel conditions and improve the quality of watermark, we proposed the application of LDPC codes on implementing a fairly robust digital image watermarking system. The implemented watermarking system operates in the spectrum domain where a subset of the discrete wavelet transform (DWT) coefficients is modified by the watermark without using original image during watermark extraction. The quality of watermark is evaluated by taking Into account the trade-off between the chip-rate and the rate of LDPC codes. Many simulation results are presented in this paper, these results indicate that the quality of the watermark is improved greatly and the proposed system based on LDPC codes is very robust to attacks.

Keywords

References

  1. R.B.Wolfgang and E. J. Delp, Overview of image security techniques with applications in multimedia systems, Proceedings of the SPIE International Conference on Multimedia Networks: Security, Displays, Terminals, and Gateways, November 4-5, 1997, Dallas, Texas, vol. 3228, pp. 297-308.
  2. M. D. Swanson, M. Kobayashi, and A. H. Tewfik, Multimedia data-embedding and watermarking technologies, Proceedings of the IEEE, 86, pp. 1064-1087, June 1998.
  3. J. R. Smith and B. O. Comiskey, Modulation and information hiding in images, in Proc. Of First Int. Workshop on Information Hiding, Lecture Notes in Computer Science, vol. 1174, pp. 207-226, 1996.
  4. I. J. Cox, J.Kilian, F. T. Leighton, and T. Shammon. Secure Spread Spectrum Watermarking for multimedia. IEEE Transactions on Image Processing, 6:1673-1686, December 1997.
  5. Mercy George, Jean-Yves Chouinard, and Nicolas Georganas, Digital Watermarking of Images and Video using Direct Sequence Spread Spectrum Techniques, ICEIC, 1999.
  6. Piva A., M. Barni, F. Bartolini, V.Cappellini and A. De Rosa, Improving the Robustness of Non-additive Watermarks Through Optimum Detection Theory, Proceedings of SPIE, Vol. 3971, 2000.
  7. R.G.Gallager, Low Density Parity Check Codes, MIT Press, Cambridge, Mass., 1963.
  8. D.J.C.Mackay, Good error-correcting codes based on very sparse matrices, IEEE Transaction on Information Theory, vol. 45, pp. 399-431, Mar. 1999.
  9. T. Zhang, Z. Wang, and K. K. Parhi, On finite precision implementation of low-density parity-check codes decoder, in Proceeding of 2001 IEEE International Symposium. On Circuits and Systems, Sydney, May 2001. Available at http:// www.Ece.umn.edu/groups/ddp/turbo/.
  10. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman. Improved low-density parity-check codes using irregular graphs and belief propagation, in Proceedings of IEEE International Symposium on Information Theory, page 117, 1998.
  11. R.G.Gallager, Low-density parity-check codes, IRE Transaction on Information Theory, vol. IT-8, pp. 21-28, Jan. 1992.
  12. C. Howland and A. Blanksby, Parallel decoding architectures for low density parity check codes, in Proc. Of 2001 IEEE International Symposium On Circuits and Systems, Sydney, May 2001.
  13. Kou, Y, Lin, S, Fossorier, M.P.C, Low-density parity-check codes based on finite geometries: a rediscovery and new results, IEEE Transaction on Information Theory, Volume: 47 Issue: 7, Nov. 2001 Page(s): 2711-2736.
  14. S. Litsyn and V. Shevelev, On Ensembles of Low Density Parity Check Codes: Asymptotic Distance Distributions, IEEE Trans. on Information Theory, vol. 48, no. 4, pp. 887-908, Apr. 2002. https://doi.org/10.1109/18.992777
  15. Eunok Lee, Jaebum Kim, Performance of LDPC code based D-blast system,VTC 2003-Spring. The 57th IEEE Semiannual, Volume: 3, April 22-25, 2003.