An invisible watermarking scheme using the SVD. 


Vol. 28,  No. 11, pp. 1118-1122, Nov.  2003


PDF
  Abstract

In this paper, we propose a new invisible digital watermarking scheme based on wavelet transform using singular value decomposition. Embedding process is started by decomposing the lowest frequency band image with 3 x 3 block among which we define the watermark block chosen, by a key set; entropy and condition number of the block. A watermark is embedded in the singular values of each watermark blocks. This provides a robust watermarking in. lowest possible time-frequency domain. To detect the watermark, we locally modeling an attack as 3×3 matrices on the watermark blocks. Combining with the SVD and the attack matrices, we estimate watermark set corresponding to the watermark blocks. In each watermark block, we determine an optimal watermark which is justified by the T-testing. A numerical experiment shows that the proposed watermarking scheme efficiently detects the watermarks from several JPEG attacks.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Lyu, J. You, D. Kim, D. Kim, "An invisible watermarking scheme using the SVD.," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 11, pp. 1118-1122, 2003. DOI: .

[ACM Style]

Joo-Yeon Lyu, Ji-Sang You, Dong-Wook Kim, and Dai-Gyoung Kim. 2003. An invisible watermarking scheme using the SVD.. The Journal of Korean Institute of Communications and Information Sciences, 28, 11, (2003), 1118-1122. DOI: .

[KICS Style]

Joo-Yeon Lyu, Ji-Sang You, Dong-Wook Kim, Dai-Gyoung Kim, "An invisible watermarking scheme using the SVD.," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 11, pp. 1118-1122, 11. 2003.