Skip to main content

Performance Analysis of Order Statistical Patchwork

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2939))

Abstract

In conventional patchwork, the difference of the mean values of two groups is compared for watermark detection. We propose order-statistical patchwork schemes, which achieves significant improvements over conventional patchwork. First, we show that, when the mean comparison in patchwork is replaced by the median comparison, we get PSNR improvement due to informed watermarking. Second, we propose a majority voting scheme of a sequential comparison of pixel pairs in a sorted order, which produces significantly lower BER. The performance improvements are mathematically analyzed and tested. In experimental results, PSNR is about 6dB~15dB higher in the first method and BER is about 1/5~1/2 times lower in the second method than conventional patchwork.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cox, I., et al.: Secures spread spectrum watermarking for Multimedia. IEEE Transactions on Image processing 6(12) (1997)

    Google Scholar 

  2. Smith, J., Comiskey, B.: Modulation and information hiding in images. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, Springer, Heidelberg (1996)

    Google Scholar 

  3. Nikolaidis, N., Pitas, I.: Robust image watermarking in the spatial domain. EURASIP 66(3), 385–403 (1998)

    MATH  Google Scholar 

  4. Kim, Y., Choi, B.: Two-step detection algorithm in a HVS-based blind watermarking of still images. In: Petitcolas, F.A.P., Kim, H.-J. (eds.) IWDW 2002. LNCS, vol. 2613, pp. 278–292. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Cox, I., Miller, M., Bloom, J.: Digital Watermarking. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  6. Costa, M.: Writing on Dirty Paper. IEEE Transactions on Information Theory 29, 439–441 (1983)

    Article  MATH  Google Scholar 

  7. Chen, B., Wornell, G.W.: Digital watermarking and information embedding using dither modulation. In: IEEE 2nd Workshop on Multimedia Signal Processing, pp. 273–278 (1998)

    Google Scholar 

  8. Bender, W., et al.: Techniques for data hiding. IBM Systems Journal 35(3&4) (1996)

    Google Scholar 

  9. Papoulis, A.: Probability, Random Variables and Stochastic Processes, 2nd edn. McGraw-Hill, New York (1984)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuk, H., Kim, Y.C. (2004). Performance Analysis of Order Statistical Patchwork. In: Kalker, T., Cox, I., Ro, Y.M. (eds) Digital Watermarking. IWDW 2003. Lecture Notes in Computer Science, vol 2939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24624-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24624-4_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21061-0

  • Online ISBN: 978-3-540-24624-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics