M-ary phase modulation for digital watermarking

Yongqing Xin; Mirosław Pawlak

International Journal of Applied Mathematics and Computer Science (2008)

  • Volume: 18, Issue: 1, page 93-104
  • ISSN: 1641-876X

Abstract

top
In spread spectrum based watermarking schemes, it is a challenging task to embed multiple bits of information into the host signal. M-ary modulation has been proposed as an effective approach to multibit watermarking. It has been proved that an M-ary modulation based watermarking system outperforms significantly a binary modulation based watermarking system. However, in the existing M-ary modulation based algorithms, the value of M is restricted to be less than 256, because as M increases, the computation workload for data extraction advances exponentially. In this paper, we propose an efficient M-ary modulation scheme, i.e., M-ary phase modulation, which reduces the computation in data extraction to a very low level. With this scheme, it is practical to implement an M-ary modulation based algorithm with a high value of M, e.g., M = 2 20 . This is significant for a watermarking system, because it can either greatly increase the data capacity of a watermark given the necessary watermark robustness, or considerably improve the watermark robustness given the amount of information of the watermark. The superiority of the proposed scheme is verified by simulation results.

How to cite

top

Yongqing Xin, and Mirosław Pawlak. "M-ary phase modulation for digital watermarking." International Journal of Applied Mathematics and Computer Science 18.1 (2008): 93-104. <http://eudml.org/doc/207869>.

@article{YongqingXin2008,
abstract = {In spread spectrum based watermarking schemes, it is a challenging task to embed multiple bits of information into the host signal. M-ary modulation has been proposed as an effective approach to multibit watermarking. It has been proved that an M-ary modulation based watermarking system outperforms significantly a binary modulation based watermarking system. However, in the existing M-ary modulation based algorithms, the value of M is restricted to be less than 256, because as M increases, the computation workload for data extraction advances exponentially. In this paper, we propose an efficient M-ary modulation scheme, i.e., M-ary phase modulation, which reduces the computation in data extraction to a very low level. With this scheme, it is practical to implement an M-ary modulation based algorithm with a high value of M, e.g., $M = 2^\{20\}$. This is significant for a watermarking system, because it can either greatly increase the data capacity of a watermark given the necessary watermark robustness, or considerably improve the watermark robustness given the amount of information of the watermark. The superiority of the proposed scheme is verified by simulation results.},
author = {Yongqing Xin, Mirosław Pawlak},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {multibit watermarking; M-ary phase modulation; watermark robustness; data capacity},
language = {eng},
number = {1},
pages = {93-104},
title = {M-ary phase modulation for digital watermarking},
url = {http://eudml.org/doc/207869},
volume = {18},
year = {2008},
}

TY - JOUR
AU - Yongqing Xin
AU - Mirosław Pawlak
TI - M-ary phase modulation for digital watermarking
JO - International Journal of Applied Mathematics and Computer Science
PY - 2008
VL - 18
IS - 1
SP - 93
EP - 104
AB - In spread spectrum based watermarking schemes, it is a challenging task to embed multiple bits of information into the host signal. M-ary modulation has been proposed as an effective approach to multibit watermarking. It has been proved that an M-ary modulation based watermarking system outperforms significantly a binary modulation based watermarking system. However, in the existing M-ary modulation based algorithms, the value of M is restricted to be less than 256, because as M increases, the computation workload for data extraction advances exponentially. In this paper, we propose an efficient M-ary modulation scheme, i.e., M-ary phase modulation, which reduces the computation in data extraction to a very low level. With this scheme, it is practical to implement an M-ary modulation based algorithm with a high value of M, e.g., $M = 2^{20}$. This is significant for a watermarking system, because it can either greatly increase the data capacity of a watermark given the necessary watermark robustness, or considerably improve the watermark robustness given the amount of information of the watermark. The superiority of the proposed scheme is verified by simulation results.
LA - eng
KW - multibit watermarking; M-ary phase modulation; watermark robustness; data capacity
UR - http://eudml.org/doc/207869
ER -

References

top
  1. Cheng Q. and Huang T. S. (2001). An additive approach to transform-domain information hiding and optimum detection structure, IEEE Transactions on Multimedia, 3(3): 273-284. 
  2. Cox I. J., Killian J., Leighton T. and Shanmoon T. (1997). Secure spread spectrum watermarking for multimedia, IEEE Transactions on Image Processing, 6(12): 1673-1687. 
  3. Cox I. J., Miller M. L. and Bloom J. A. (2001). Digital Watermarking, Morgan Kaufmann, San Francisco. 
  4. Gonzalez R. and Woods R. (2002). Digital Image Processing, Prentice-Hall, New York. 
  5. Hernandez J. R., Amado M. and Perez-Gonzalez F. (2000). DCTdomain watermarking techniques for still images: Detector performance analysis and a new structure, IEEE Transactions on Image Processing, 9 (1): 55-68. 
  6. Jain A. K. (1989). Fundamentals of Digital Image Processing, Prentice-Hall: Englewood Cliffs, NJ. Zbl0744.68134
  7. Kutter M. (1999). Performance improvement of spread spectrum based image watermarking schemes through M-ary modulation, Lecture Notes in Computer Science, 1728: 238-250. 
  8. Nikolaidis A. and Pitas I. (2003). Asymptotically optimal detection for additive watermarking in the DCT and DWT domains, IEEE Transactions on Image Processing, 12(5): 563-571. 
  9. O'Ruanaidh J. and Pun T. (1998). Rotation, scale and translation invariant spread spectrum digital image watermarking, Signal Processing, 66(8): 303-317. Zbl0907.68073
  10. Proakis J. G. (2000). Digital Communications, 4th Ed, McGraw Hill: New York. Zbl0292.94002
  11. Trappe W., Wu M., Wang Z. J. and Liu K. J. R. (2003). Anticollusion fingerprinting for multimedia, IEEE Transactions on Signal Processing, 51(4): 1069-1087. 
  12. Wilson S. G. (1996). Digital Modulation and Coding, Prentice Hall, New York. Zbl0828.94001
  13. Zeng W. and Liu B. (1999). A statistical watermark detection technique without using original images for resolving rightful ownerships of digital images, IEEE Transactions on Image Processing, 8(11): 1534-1548. 

NotesEmbed ?

top

You must be logged in to post comments.