An Efficient Video Watermarking Using Re-Estimation and Minimum Modification Technique of Motion Vectors 


Vol. 30,  No. 6, pp. 497-504, Jun.  2005


PDF
  Abstract

We propose an efficient video watermarking scheme using re-estimation and minimum modification technique of motion vectors. Conventional methods based on motion vectors do watermarking using modification of motion vectors. However, change of motion vectors results in the degradation of video quality. Thus, our scheme minimizes the modification of the original motion vectors and replaces an original motion vector by the adjacent optimal motion vector using re-estimation of motion vectors to avoid degradation of video quality. Besides, our scheme guarantees the amount of embedded watermark data using the adaptive threshold considering for an efficient video watermarking. In addition, this is compatible with current video compression standards without changing the bitstream. Experimental result shows that the proposed scheme obtains better video quality than other previous algorithms by about 0.6~1.3 dB.

  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]

K. Kang, K. Moon, J. Kim, "An Efficient Video Watermarking Using Re-Estimation and Minimum Modification Technique of Motion Vectors," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 6, pp. 497-504, 2005. DOI: .

[ACM Style]

Kyung-won Kang, Kwang-seok Moon, and Jong-nam Kim. 2005. An Efficient Video Watermarking Using Re-Estimation and Minimum Modification Technique of Motion Vectors. The Journal of Korean Institute of Communications and Information Sciences, 30, 6, (2005), 497-504. DOI: .

[KICS Style]

Kyung-won Kang, Kwang-seok Moon, Jong-nam Kim, "An Efficient Video Watermarking Using Re-Estimation and Minimum Modification Technique of Motion Vectors," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 6, pp. 497-504, 6. 2005.