Skip to content
naulon
Not checkedNot checked for notices yet.

A Novel Scene-Based Video Watermarking Scheme for Copyright Protection

Shukla Dolley, Sharma Manisha

Journal of Intelligent Systems · 2018

doi:10.1515/jisys-2017-0039 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Many illegal copies of original digital videos are being made, as they can be replicated perfectly through the Internet. Thus, it is extremely necessary to protect the copyrights of the owner and prevent illegal copying. This paper presents a novel approach to digital video watermarking for copyright protection using two different algorithms, whereby successive estimation of a statistical measure was used to detect scene boundaries and watermark was embedded in the detected scenes with discrete wavelet transform. Haar wavelet was used for decomposition. For embedding, the approaches used were (i) the detailed subband (LH subband) and (ii) the approximate subband (LL subband) of the cover video. Imperceptibility, robustness, and channel capacity were measured using both algorithms. The system was tested for robustness in the presence of 15 different attacks of five different categories, and, under multiple attacks, ensured that a wide spectrum of attack analysis has been done. The performance metrics measured included mean square error, peak signal-to-noise ratio, structural similarity index, normalized correlation, and bit error rate. The experimental results demonstrated the better visual imperceptibility and improved performance in terms of normalized correlation and bit error rate with embedding using the LL subband. Comparative analysis with existing schemes proved the improved robustness, better imperceptibility, and reduced computational time of both the proposed schemes.

Abstract licence: CC BY-NC-ND

References32

    32 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.